Logical Qubit demonstrations of Shor's Algorithm, Constant Depth CX Ladders, and the Many-Hypercube code on Neutral Atoms

Recent demonstrations of logical qubits on neutral atom computers have relied on coherent qubit motion into entangling zones, requiring motion prior to every entangling gate and incurring significant cost in runtime and motion-related error accumulation. Infleqtion's new architecture unites qubit motion and in-place entanglement via nearest-neighbor gates, maintaining all-to-all connectivity while minimizing motion overheads. In this talk, we describe three logical qubit demonstrations on Infleqtion's 114 qubit neutral atom Sqale QPU. First, we perform a logical qubit realization of a pre-compiled variant of Shor's Algorithm, finding better logical-than-physical performance across a range of settings including loss correction and leakage detection. Second, we introduce a technique for performing CX ladders with depth independent of both the number of logical qubits N and the code distance d, demonstrating reduced error in proof-of-principle experiments on 8 and 12 logical qubits. Third, we realize an initialization of the [[16, 4, 4]] many-hypercube QEC code. All three results are enabled by optimized compilation via Infleqtion's quantum software platform Superstaq, as well as an underlying system architecture uniting motion and in-place entanglement.