High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory

Abstract

We present a new family of quantum low-density parity-check codes, which we call radial codes, obtained from the lifted product of a specific subset of classical quasi-cyclic codes. The codes are defined using a pair of integers $(r,s)$ and have parameters $[[2r^{2}s,2(r-1{)}^2,\le 2s]]$, with numerical studies suggesting average-case distance linear in $s$. In simulations of circuit-level noise, we observe comparable error suppression to surface codes of similar distance while using approximately five times fewer physical qubits. This is true even when radial codes are decoded using a single-shot approach, which can allow for faster logical clock speeds and reduced decoding complexity. We describe an intuitive visual representation, canonical basis of logical operators and optimal-length stabiliser measurement circuits for these codes, and argue that their error correction capabilities, tunable parameters and small size make them promising candidates for implementation on near-term quantum devices.

17 pages, 11 figures, accepted version

References in corpus (21)

• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Logical quantum processor based on reconfigurable atom arrays
• High-threshold and low-overhead fault-tolerant quantum memory
• Stim: a fast stabilizer circuit simulator
• Decoding Across the Quantum LDPC Code Landscape
• Balanced Product Quantum Codes
• Fault-tolerant error correction with the gauge color code
• A Fault-Tolerant Honeycomb Memory
• Parallel window decoding enables scalable fault tolerant quantum computation
• Floquet codes without parent subsystem codes
• Single-shot error correction of three-dimensional homological product codes
• Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead
• Improved single-shot decoding of higher dimensional hypergraph product codes
• Bias-tailored quantum LDPC codes
• Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound
• Localized statistics decoding for quantum low-density parity-check codes
• Floquetifying the Colour Code
• QDistRnd: A GAP package for computing the distance of quantum error-correcting codes
• Analog information decoding of bosonic quantum LDPC codes
• Weight Reduced Stabilizer Codes with Lower Overhead

Cited by in corpus (2)

• QUITS: A modular Qldpc code circUIT Simulator
• Streaming Belief Propagation on Mixed-Alphabet Tanner Graphs for Practical Quantum Memory