Rich Rines, Benjamin Hall, Mariesa H. Teo, Joshua Viszlai, Daniel C. Cole, David Mason, Cameron Barker, Matt J. Bedalov, Matt Blakely, Tobias Bothwell, Caitlin Carnahan, Frederic T. Chong, Samuel Y. Eubanks, Brian Fields, Matthew Gillette, Palash Goiporia, Pranav Gokhale, Garrett T. Hickman, Marin Iliev, Eric B. Jones, et al (18) (Sep 17 2025).

Abstract: Logical qubits are considered an essential component for achieving utility-scale quantum computation. Multiple recent demonstrations of logical qubits on neutral atoms have relied on coherent qubit motion into entangling zones. However, this architecture requires motion prior to every entangling gate, incurring significant cost in wall clock runtime and motion-related error accumulation. We propose and experimentally realize an alternative architecture which unites qubit motion and in-place entanglement via nearest-neighbor gates. Our approach maintains all-to-all connectivity, while minimizing qubit motion overheads. We demonstrate three key results on Infleqtion's Sqale QPU, which hosts an array of 114 neutral atom qubits. First, we perform a logical qubit realization of a pre-compiled variant of Shor's Algorithm. We find better logical-than-physical performance over a range of settings including with loss correction and leakage detection. Second, we introduce a technique for performing CNOT ladders with depth independent of both the number of logical qubits N and the code distance d. In proof-of-principle experiments with 8 and 12 logical qubits, we find ~4x reduction in error via the logical encodings. Third, we experimentally realize initialization of the [[16, 4, 4]] many-hypercube QEC code. All three results benefit from optimized compilation via Superstaq, as well as our underlying architecture uniting motion and in-place entanglement. This architecture offers a path to reducing the overhead of utility-scale quantum applications relative to architectures based on entangling zones.

Arxiv: https://arxiv.org/abs/2509.13247