Constant-overhead quantum error correction with thin planar connectivity
arXiv:2109.14609 · doi:10.1103/PhysRevLett.129.050504
Abstract
Quantum LDPC codes may provide a path to build low-overhead fault-tolerant quantum computers. However, as general LDPC codes lack geometric constraints, naïve layouts couple many distant qubits with crossing connections which could be hard to build in hardware and could result in performance-degrading crosstalk. We propose a 2D layout for quantum LDPC codes by decomposing their Tanner graphs into a small number of planar layers. Each layer contains long-range connections which do not cross. For any CSS code with a degree- Tanner graph, we design stabilizer measurement circuits with depth at most using at most layers. We observe a circuit-noise threshold of 0.28\% for a positive-rate code family using 49 physical qubits per logical qubit. For a physical error rate of , this family reaches a logical error rate of using fourteen times fewer physical qubits than the surface code.
7 pages, 4 figures
References in corpus (7)
- Surface codes: Towards practical large-scale quantum computation
- Quantum computing with nearest neighbor interactions and error rates over 1%
- Quantum Low-Density Parity-Check Codes
- A silicon-integrated telecom photon-spin interface
- Low-overhead fault-tolerant quantum computing using long-range connectivity
- Quantifying nonlocality: how outperforming local quantum codes is expensive
- Freely Scalable Quantum Technologies using Cells of 5-to-50 Qubits with Very Lossy and Noisy Photonic Links
Cited by in corpus (46)
- High-threshold and low-overhead fault-tolerant quantum memory
- IBM Quantum Computers: Evolution, Performance, and Future Directions
- Low-overhead fault-tolerant quantum computing using long-range connectivity
- Multicore Quantum Computing
- Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
- How to wire a 1000-qubit trapped ion quantum computer
- Quantifying nonlocality: how outperforming local quantum codes is expensive
- Computational Capabilities and Compiler Development for Neutral Atom Quantum Processors: Connecting Tool Developers and Hardware Experts
- Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes
- Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
- Scalable Networking of Neutral-Atom Qubits: Nanofiber-Based Approach for Multiprocessor Fault-Tolerant Quantum Computer
- Toward a 2D Local Implementation of Quantum LDPC Codes
- High-rate quantum LDPC codes for long-range-connected neutral atom registers
- Quantum LDPC Codes for Modular Architectures
- Single-shot decoding of good quantum LDPC codes
- Tunable coupling of widely separated superconducting qubits: A possible application towards a modular quantum device
- Constant-Overhead Fault-Tolerant Bell-Pair Distillation using High-Rate Codes
- Many-hypercube codes: High-rate quantum error-correcting codes for high-performance fault-tolerant quantum computing
- Hierarchical memories: Simulating quantum LDPC codes with local gates
- Long-Range Interaction via Resonator-Induced Phase in Superconducting Qubits
- Fast erasure decoder for hypergraph product codes
- Distance-preserving stabilizer measurements in hypergraph product codes
- Fault-tolerant hyperbolic Floquet quantum error correcting codes
- Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoders
- TISCC: A Surface Code Compiler and Resource Estimator for Trapped-Ion Processors
- Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes
- Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays
- Concatenate codes, save qubits
- Lift-Connected Surface Codes
- Quantum error correction for long chains of trapped ions
- Adaptive Syndrome Extraction
- Error correctable efficient quantum homomorphic encryption using Calderbank-Shor-Steane codes
- Quantum low-density parity-check codes for erasure-biased atomic quantum processors
- Finite-rate sparse quantum codes aplenty
- On the energy barrier of hypergraph product codes
- High-speed and high-connectivity two-qubit gates in long chains of trapped ions
- Targeted Clifford logical gates for hypergraph product codes
- Scalable Low-overhead Superconducting Non-local Coupler with Exponentially Enhanced Connectivity
- QUITS: A modular Qldpc code circUIT Simulator
- Symmetry-enriched topological order and quasifractonic behavior in stabilizer codes
- Fault-tolerant Quantum Error Correction Using a Linear Array of Emitters
- Quantum memory based on concatenating surface codes and quantum Hamming codes
- Informed Dynamic Scheduling for QLDPC Codes
- Roughening Transition in Quantum Circuits
- Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes
- qSIEVE: Efficient qLDPC Memory via Systolic Movement in Atom Arrays