Single-Shot Error Correction of Three-Dimensional Homological Product Codes

  title={Single-Shot Error Correction of Three-Dimensional Homological Product Codes},
  author={A. O. Quintavalle and M. Vasmer and Joschka Roffe and E. Campbell},
  journal={arXiv: Quantum Physics},
Single-shot error correction corrects data noise using only a single round of noisy measurements on the data qubits, removing the need for intensive measurement repetition. We introduce a general concept of confinement for quantum codes, which roughly stipulates qubit errors cannot grow without triggering more measurement syndromes. We prove confinement is sufficient for single-shot decoding of adversarial errors. Further to this, we prove that all three-dimensional homological product codes… Expand
PyMatching: A fast implementation of the minimum-weight perfect matching decoder
This paper introduces PyMatching, a fast open-source Python package for decoding quantum error-correcting codes with the minimum-weight perfect matching (MWPM) algorithm. PyMatching includes theExpand
Quantum XYZ Product Codes
A three-fold variant of the hypergraph product code construction, differing from the standard homological product of three classical codes, which yields a non CSS quantum LDPC code which might display a large minimum distance and obtain the dimension of a large class of XYZ product codes. Expand
Limitations on transversal gates for hypergraph product codes.
We analyze the structure of the logical operators from a class of quantum codes that generalizes the surface codes. These are the hypergraph product codes, restricted to the vertical sector. ByExpand
Lifting decoders for classical codes to decoders for quantum codes
The design of decoding algorithms is a significant technological component in the development of faulttolerant quantum computers. Often design of quantum decoders is inspired by classical decodingExpand
PyMatching: A Python package for decoding quantum codes with minimum-weight perfect matching
This paper introduces PyMatching, a fast open-source Python package for decoding quantum error-correcting codes with the minimum-weight perfect matching (MWPM) algorithm. PyMatching includes theExpand
Union-Find Decoders For Homological Product Codes
While the threshold of these augmented codes is lower than that of the surface code, the low noise performance is improved, and the union-find decoder, with slight modifications, can decode errors up to half the distance. Expand
Universal quantum computing with twist-free and temporally encoded lattice surgery
Lattice surgery protocols allow for the efficient implementation of universal gate sets with two-dimensional topological codes where qubits are constrained to interact with one another locally. InExpand
Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code.
A fully detailed set of bounded-height lattice slices through the 3D codes which retain the code distance and measurement-error detecting properties of the full 3D code and admit a dimension-jumping process which expands from/collapses to 2D surface codes supported on the boundaries of each slice. Expand


A theory of single-shot error correction for adversarial noise
Single-shot error correction is a technique for correcting physical errors using only a single round of noisy check measurements, such that any residual noise affects a small number of qubits. WeExpand
Fault-tolerant error correction with the gauge color code
This work makes use of single-shot error correction to develop a simple decoding algorithm for the gauge color code, and it numerically analyse its performance, finding threshold error rates comparable to other leading proposals. Expand
Three-Dimensional Color Code Thresholds via Statistical-Mechanical Mapping.
These results are obtained by using parallel tempering Monte Carlo simulations to study the disorder-temperature phase diagrams of two new 3D statistical-mechanical models: the four- and six-body random coupling Ising models. Expand
Single-Shot Decoding of Linear Rate LDPC Quantum Codes with High Performance
We construct and analyze a family of low-density parity check (LDPC) quantum codes with a linear encoding rate, polynomial scaling distance and efficient decoding schemes. The code family is based onExpand
Constant Overhead Quantum Fault-Tolerance with Quantum Expander Codes
We prove that quantum expander codes can be combined with quantum fault-tolerance techniques to achieve constant overhead: the ratio between the total number of physical qubits required for a quantumExpand
Foliated Quantum Error-Correcting Codes.
This work shows how to construct a large class of quantum error-correcting codes, known as Calderbank-Steane-Shor codes, from highly entangled cluster states, and proposes a generic method for decoding foliated codes. Expand
Constant Time Decoding of Quantum Expander Codes and Application to Fault-Tolerant Quantum Computation
This PhD thesis shows that the family of quantum expander codes and the small-set-flip decoder can be used in the construction of a fault-tolerant quantum circuit with constant space overhead and reveals that these constant rate codes have a decent threshold and good finite length performance. Expand
Numerical study of hypergraph product codes
Hypergraph product codes introduced by Tillich and Zemor are a class of quantum LDPC codes with constant rate and distance scaling with the square-root of the block size. Quantum expander codes, aExpand
Parallelized quantum error correction with fracton topological codes
This work proposes and implements decoding algorithms for the three-dimensional X-cube model and proposes that the new concept represents a generalization of single-shot error correction, and explains the connection between parallelizable codes and other methods of quantum error correction. Expand
Fault tolerance of quantum low-density parity check codes with sublinear distance scaling
We discuss error-correction properties for families of quantum low-density parity check (LDPC) codes with relative distance that tends to zero in the limit of large blocklength. In particular, weExpand