Partial Syndrome Measurement for Hypergraph Product Codes
arXiv:2306.17122 · doi:10.22331/q-2024-05-14-1345
Abstract
Hypergraph product codes are a promising avenue to achieving fault-tolerant quantum computation with constant overhead. When embedding these and other constant-rate qLDPC codes into 2D, a significant number of nonlocal connections are required, posing difficulties for some quantum computing architectures. In this work, we introduce a fault-tolerance scheme that aims to alleviate the effects of implementing this nonlocality by measuring generators acting on spatially distant qubits less frequently than those which do not. We investigate the performance of a simplified version of this scheme, where the measured generators are randomly selected. When applied to hypergraph product codes and a modified small-set-flip decoding algorithm, we prove that for a sufficiently high percentage of generators being measured, a threshold still exists. We also find numerical evidence that the logical error rate is exponentially suppressed even when a large constant fraction of generators are not measured.
arXiv commentv3: Accepted to Quantum. Style changes and referee responses
References in corpus (29)
- Fault-tolerant quantum computation by anyons
- Mixed State Entanglement and Quantum Error Correction
- Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
- Good Quantum Error-Correcting Codes Exist
- Quantum Error Correction and Orthogonal Geometry
- Stabilizer Codes and Quantum Error Correction
- High-threshold and low-overhead fault-tolerant quantum memory
- Exponential suppression of bit or phase flip errors with repetitive error correction
- Quantum codes on a lattice with boundary
- Resilient Quantum Computation: Error Models and Thresholds
- 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
- Tradeoffs for reliable quantum information storage in 2D systems
- Decoding Across the Quantum LDPC Code Landscape
- Single-shot fault-tolerant quantum error correction
- Balanced Product Quantum Codes
- Constructions and Noise Threshold of Hyperbolic Surface Codes
- Quantum "hyperbicycle" low-density parity check codes with finite rate
- A theory of single-shot error correction for adversarial noise
- Quantum Expander Codes
- Quantum error-correcting codes and 4-dimensional arithmetic hyperbolic manifolds
- Combining hard and soft decoders for hypergraph product codes
- Quantifying nonlocality: how outperforming local quantum codes is expensive
- Connectivity constrains quantum codes
- Numerical and analytical bounds on threshold error rates for hypergraph-product codes
- Opportunities and Challenges in Fault-Tolerant Quantum Computation
- Numerical study of hypergraph product codes
- Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes
- A lower bound on the overhead of quantum error correction in low dimensions