LDPC-cat codes for low-overhead quantum computing in 2D

Abstract

Quantum low-density parity-check (qLDPC) codes are a promising construction for drastically reducing the overhead of fault-tolerant quantum computing (FTQC) architectures. However, all of the known hardware implementations of these codes require advanced technologies, such as long-range qubit connectivity, high-weight stabilizers, or multi-layered chip layouts. An alternative approach to reduce the hardware overhead of fault-tolerance is to use bosonic cat qubits where bit-flip errors are exponentially suppressed by design. In this work, we combine both approaches and propose an architecture based on cat qubits concatenated in classical LDPC codes correcting for phase-flips. We find that employing such phase-flip LDPC codes provides two major advantages. First, the hardware implementation of the code can be realised using short-range qubit interactions in 2D and low-weight stabilizers, which makes it readily compatible with current superconducting circuit technologies. Second, we demonstrate how to implement a fault-tolerant universal set of logical gates with a second layer of cat qubits while maintaining the local connectivity. We conduct a numerical brute force optimisation of these classical codes to find the ones with the best encoding rate for algorithmically relevant code distances. We discover that some of the best codes benefit from a cellular automaton structure. This allows us to define families of codes with high encoding rates and distances. Finally, we numerically assess the performance of our codes under circuit-level noise. Assuming a physical phase-flip error probability $\epsilon \approx 0.1\%$, our $[165+8\ell ,34+2\ell ,22]$ code family allows to encode $100$ logical qubits with a total logical error probability (including both logical phase-flip and bit-flip) per cycle and per logical qubit ${\epsilon }_L\le 10^{-8}$ on a $758$ cat qubit chip.

arXiv comment23 pages, 11 figures

References in corpus (45)

• Fault-tolerant quantum computation by anyons
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Surface codes: Towards practical large-scale quantum computation
• Multiple Particle Interference and Quantum Error Correction
• Suppressing quantum errors by scaling a surface code logical qubit
• Logical quantum processor based on reconfigurable atom arrays
• A Theory of Fault-Tolerant Quantum Computation
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• Dynamically protected cat-qubits: a new paradigm for universal quantum computation
• Surface code quantum computing by lattice surgery
• Confining the state of light to a quantum manifold by engineered two-photon loss
• High-threshold and low-overhead fault-tolerant quantum memory
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Quantum Low-Density Parity-Check Codes
• Building a fault-tolerant quantum computer using concatenated cat codes
• Exponential suppression of bit-flips in a qubit encoded in an oscillator
• Tradeoffs for reliable quantum information storage in 2D systems
• Decoding Across the Quantum LDPC Code Landscape
• Efficient fault-tolerant quantum computing
• Fault-tolerant bosonic quantum error correction with the surface-GKP code
• Quantum information processing with bosonic qubits in circuit QED
• Quantum Error Correction with the Toric-GKP Code
• Glassy dynamics and aging in an exactly solvable spin model
• Factoring 2048-bit RSA Integers in 177 Days with 13436 Qubits and a Multimode Memory
• Low-overhead fault-tolerant quantum computing using long-range connectivity
• Surface code implementation of block code state distillation
• Hyperbolic and Semi-Hyperbolic Surface Codes for Quantum Storage
• Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
• Quantum control of a cat-qubit with bit-flip times exceeding ten seconds
• One hundred second bit-flip time in a two-photon dissipative oscillator
• Error Rates and Resource Overheads of Repetition Cat Qubits
• Fault-Tolerant Logical Gate Networks for CSS Codes
• Partitioning qubits in hypergraph product codes to implement logical gates
• Connectivity constrains quantum codes
• Universal logical gates with constant overhead: instantaneous Dehn twists for hyperbolic quantum codes
• Fold-Transversal Clifford Gates for Quantum Codes
• Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes
• Autoparametric resonance extending the bit-flip time of a cat qubit up to 0.3 s
• High-performance repetition cat code using fast noisy operations
• Higher-group symmetry of (3+1)D fermionic ${\mathbb{Z}}_2$ gauge theory: logical CCZ, CS, and T gates from higher symmetry
• Fault-tolerant gates via homological product codes
• Information storage capacity of discrete spin systems
• A cellular automaton decoder for a noise-bias tailored color code
• Correcting spanning errors with a fractal code
• CSS code surgery as a universal construction

Cited by in corpus (14)

• Hardware-efficient quantum error correction via concatenated bosonic qubits
• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Quantum error correction for long chains of trapped ions
• Preserving phase coherence and linearity in cat qubits with exponential bit-flip suppression
• Fault-tolerant quantum computing with the parity code and noise-biased qubits
• Stabilization of cat-state manifolds using nonlinear reservoir engineering
• A cat qubit stabilization scheme using a voltage biased Josephson junction
• Unfolded distillation: very low-cost magic state preparation for biased-noise qubits
• Multimode rotationally symmetric bosonic codes from group-theoretic construction
• Exact and Efficient Stabilizer Simulation of Thermal-Relaxation Noise for Quantum Error Correction
• Quantum Error Correction with Superpositions of Squeezed Fock States
• Fault Tolerant Quantum Simulation via Symplectic Transvections
• Hierarchical Quantum Error Correction with Hypergraph Product Code and Rotated Surface Code
• Non-perturbative switching rates in bistable open quantum systems: from driven Kerr oscillators to dissipative cat qubits