Hierarchical memories: Simulating quantum LDPC codes with local gates

Abstract

Constant-rate low-density parity-check (LDPC) codes are promising candidates for constructing efficient fault-tolerant quantum memories. However, if physical gates are subject to geometric-locality constraints, it becomes challenging to realize these codes. In this paper, we construct a new family of $[[N,K,D]]$ codes, referred to as hierarchical codes, that encode a number of logical qubits $K=\Omega (N/\log (N{)}^2)$. The N-th element of this code family is obtained by concatenating a constant-rate quantum LDPC code with a surface code; nearest-neighbor gates in two dimensions are sufficient to implement the corresponding syndrome-extraction circuit and achieve a threshold. Below threshold the logical failure rate vanishes superpolynomially as a function of the distance $D(N)$. We present a bilayer architecture for implementing the syndrome-extraction circuit, and estimate the logical failure rate for this architecture. Under conservative assumptions, we find that the hierarchical code outperforms the basic encoding where all logical qubits are encoded in the surface code.

70 pages. Tl;dr in section 1

References in corpus (57)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Surface codes: Towards practical large-scale quantum computation
• Suppressing quantum errors by scaling a surface code logical qubit
• Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator
• An atom-by-atom assembler of defect-free arbitrary 2d atomic arrays
• Topological Quantum Distillation
• Surface code quantum computing by lattice surgery
• The Kerr-Cat Qubit: Stabilization, Readout, and Gates
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• High-Fidelity Entanglement and Detection of Alkaline-Earth Rydberg Atoms
• Many-body interferometry of a Rydberg-dressed spin lattice
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Low-distance Surface Codes under Realistic Quantum Noise
• Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
• A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
• The XZZX Surface Code
• Exponential suppression of bit-flips in a qubit encoded in an oscillator
• Impact of ionizing radiation on superconducting qubit coherence
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Efficient Distributed Quantum Computing
• Ultrahigh Error Threshold for Surface Codes with Biased Noise
• Fault-tolerant quantum computation against biased noise
• Resolving catastrophic error bursts from cosmic rays in large arrays of superconducting qubits
• Bias-preserving gates with stabilized cat qubits
• Tradeoffs for reliable quantum information storage in 2D systems
• Programmable Interactions and Emergent Geometry in an Atomic Array
• Decoding Across the Quantum LDPC Code Landscape
• T-junction ion trap array for two-dimensional ion shuttling, storage and manipulation
• Balanced Product Quantum Codes
• Flag fault-tolerant error correction with arbitrary distance codes
• Universal transversal gates with color codes - a simplified approach
• Universal gate operations on nuclear spin qubits in an optical tweezer array of ${}^{171}$Yb atoms
• Tailoring surface codes for highly biased noise
• Local Fault-tolerant Quantum Computation
• Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
• Optimal and Efficient Decoding of Concatenated Quantum Block Codes
• Neural Belief-Propagation Decoders for Quantum Error-Correcting Codes
• Entanglement Stabilization using Parity Detection and Real-Time Feedback in Superconducting Circuits
• Quantum Expander Codes
• Constant-overhead quantum error correction with thin planar connectivity
• Fiber Bundle Codes: Breaking the $N^{1/2}\mathrm{polylog}(N)$ Barrier for Quantum LDPC Codes
• TLS Dynamics in a Superconducting Qubit Due to Background Ionizing Radiation
• Single-shot error correction of three-dimensional homological product codes
• Fast ion swapping for quantum information processing
• Logical blocks for fault-tolerant topological quantum computation
• Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
• Combining hard and soft decoders for hypergraph product codes
• Reducing the overhead for quantum computation when noise is biased
• Exploiting Degeneracy in Belief Propagation Decoding of Quantum Codes
• Bias-tailored quantum LDPC codes
• Quantifying nonlocality: how outperforming local quantum codes is expensive
• Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound
• Connectivity constrains quantum codes
• Distributed quantum error correction for chip-level catastrophic errors
• Black-body radiation induced facilitated excitation of Rydberg atoms in optical tweezers
• Disentangling the sources of ionizing radiation in superconducting qubits
• Generalized Belief Propagation Algorithms for Decoding of Surface Codes

Cited by in corpus (7)

• Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
• Constant-Overhead Fault-Tolerant Bell-Pair Distillation using High-Rate Codes
• Hybrid cat-transmon architecture for scalable, hardware-efficient quantum error correction
• Adaptive Syndrome Extraction
• Mitigating cosmic ray-like correlated events with a modular quantum processor
• Quantum memory based on concatenating surface codes and quantum Hamming codes
• Hierarchical Quantum Error Correction with Hypergraph Product Code and Rotated Surface Code