Towards self-correcting quantum codes for neutral atom arrays

Abstract

Discovering low-overhead quantum error-correcting codes is of significant interest for fault-tolerant quantum computation. For hardware capable of long-range connectivity, the bivariate bicycle codes offer significant overhead reduction compared to surface codes with similar performance. In this work, we present "ZSZ codes", a simple non-abelian generalization of the bivariate bicycle codes based on the group ${\mathbb{Z}}_{\ell }⋊{\mathbb{Z}}_m$. We numerically demonstrate that certain instances of this code family achieve competitive performance with the bivariate bicycle codes under circuit-level depolarizing noise using a belief-propagation and ordered-statistics decoder, with an observed threshold around $0.5\%$. We also benchmark the performance of this code family under local "self-correcting" decoders, where we observe significant improvements over the bivariate bicycle codes, including evidence of a sustainable threshold around $0.095\%$, which is higher than the $0.06\%$ that we estimate for the four-dimensional toric code under the same noise model. These results suggest that ZSZ codes are promising candidates for scalable self-correcting quantum memories. Finally, we describe how ZSZ codes can be realized with neutral atoms trapped in movable tweezer arrays, where a complete round of syndrome extraction can be achieved using simple global motions of the atomic arrays.

29 pages, 9 figures, 2 tables

References in corpus (50)

• Surface codes: Towards practical large-scale quantum computation
• Quantum information with Rydberg atoms
• Suppressing quantum errors by scaling a surface code logical qubit
• Logical quantum processor based on reconfigurable atom arrays
• Quantum error correction below the surface code threshold
• High-fidelity parallel entangling gates on a neutral atom quantum computer
• High-threshold and low-overhead fault-tolerant quantum memory
• Controlling many-body dynamics with driven quantum scars in Rydberg atom arrays
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Stim: a fast stabilizer circuit simulator
• Quantum Low-Density Parity-Check Codes
• Quantum Metropolis Sampling
• A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
• High-fidelity gates with mid-circuit erasure conversion in a metastable neutral atom qubit
• Quantum error correction with only two extra qubits
• Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays
• Tradeoffs for reliable quantum information storage in 2D systems
• Two-dimensional transport and transfer of a single atomic qubit in optical tweezers
• Decoding Across the Quantum LDPC Code Landscape
• Single-shot fault-tolerant quantum error correction
• Ytterbium nuclear-spin qubits in an optical tweezer array
• Erasure conversion in a high-fidelity Rydberg quantum simulator
• Balanced Product Quantum Codes
• Quantum "hyperbicycle" low-density parity check codes with finite rate
• On the dynamics of the glass transition on Bethe lattices
• A theory of single-shot error correction for adversarial noise
• Erasure qubits: Overcoming the $T_1$ limit in superconducting circuits
• Dual-rail encoding with superconducting cavities
• High threshold codes for neutral atom qubits with biased erasure errors
• Continuous quantum error correction by cooling
• Single-shot error correction of three-dimensional homological product codes
• Cellular-automaton decoders with provable thresholds for topological codes
• Demonstrating a long-coherence dual-rail erasure qubit using tunable transmons
• Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
• Experimental Demonstration of Logical Magic State Distillation
• Measurement-free fault-tolerant quantum error correction in near-term devices
• Improved single-shot decoding of higher dimensional hypergraph product codes
• On fault-tolerance with noisy and slow measurements
• The computational power of random quantum circuits in arbitrary geometries
• Entangling four logical qubits beyond break-even in a nonlocal code
• Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
• Efficient quantum Gibbs samplers with Kubo--Martin--Schwinger detailed balance condition
• Localized statistics decoding for quantum low-density parity-check codes
• Experiments with the 4D Surface Code on a QCCD Quantum Computer
• Quantum memory at nonzero temperature in a thermodynamically trivial system
• Experimental Demonstration of High-Fidelity Logical Magic States from Code Switching
• Single-shot and measurement-based quantum error correction via fault complexes
• Enhancing Quantum Memory Lifetime with Measurement-Free Local Error Correction and Reinforcement Learning
• Single-shot preparation of hypergraph product codes via dimension jump
• On fault tolerant single-shot logical state preparation and robust long-range entanglement