Fault-tolerant gates on hypergraph product codes
arXiv:1909.07424 · doi:10.1103/PhysRevX.11.011023
Abstract
Hypergraph product codes are a class of quantum low density parity check (LDPC) codes discovered by Tillich and Zémor. These codes have a constant encoding rate and were recently shown to have a constant fault-tolerant error threshold. With these features, they asymptotically offer a smaller overhead compared to topological codes. However, existing techniques to perform logical gates in hypergraph product codes require many separate code blocks, so only becomes effective with a very large number of logical qubits. Here, we demonstrate how to perform Clifford gates on this class of codes using code deformation. To this end, we generalize punctures and wormhole defects, the latter introduced in a companion paper. Together with state injection, we can perform a universal set of gates within a single block of the class of hypergraph product codes.
arXiv comment30 pages, 11 figures. Comments welcome
References in corpus (48)
- Fault-tolerant quantum computation by anyons
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Surface codes: Towards practical large-scale quantum computation
- Good Quantum Error-Correcting Codes Exist
- Topological quantum memory
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Multiple Particle Interference and Quantum Error Correction
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological Quantum Distillation
- Topological fault-tolerance in cluster state quantum computation
- A fault-tolerant one-way quantum computer
- Topological Order with a Twist: Ising Anyons from an Abelian Model
- Sparse Graph Codes for Quantum Error-Correction
- Quantum codes on a lattice with boundary
- Magic state distillation with low overhead
- Methodology for quantum logic gate constructions
- Resilient Quantum Computation: Error Models and Thresholds
- Deterministic Quantum State Transfer and Generation of Remote Entanglement using Microwave Photons
- 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
- On-demand quantum state transfer and entanglement between remote microwave cavity memories
- Degenerate Quantum LDPC Codes With Good Finite Length Performance
- Topological quantum computing with a very noisy network and local error rates approaching one percent
- From three-photon GHZ states to ballistic universal quantum computation
- Long-range quantum entanglement in noisy cluster states
- Tradeoffs for reliable quantum information storage in 2D systems
- Deterministic remote entanglement of superconducting circuits through microwave two-photon transitions
- Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
- Poking holes and cutting corners to achieve Clifford gates with the surface code
- Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
- Foliated Quantum Codes
- Constant overhead quantum fault-tolerance with quantum expander codes
- Quantum Measurements and Gates by Code Deformation
- Neural Belief-Propagation Decoders for Quantum Error-Correcting Codes
- The surface code with a twist
- Hyperbolic and Semi-Hyperbolic Surface Codes for Quantum Storage
- Quantum Expander Codes
- Clifford Gates by Code Deformation
- Code Deformation and Lattice Surgery Are Gauge Fixing
- Quantum error-correcting codes and 4-dimensional arithmetic hyperbolic manifolds
- Universal logical gates with constant overhead: instantaneous Dehn twists for hyperbolic quantum codes
- Topological wormholes
- Numerical and analytical bounds on threshold error rates for hypergraph-product codes
- Low overhead Clifford gates from joint measurements in surface, color, and hyperbolic codes
- Numerical study of hypergraph product codes
- The Small Stellated Dodecahedron Code and Friends
- Fault-tolerant gates via homological product codes
- Decoding Schemes for Foliated Sparse Quantum Error Correcting Codes
Cited by in corpus (29)
- Focus beyond quadratic speedups for error-corrected quantum advantage
- Low-overhead fault-tolerant quantum computing using long-range connectivity
- Constant-overhead quantum error correction with thin planar connectivity
- Logical blocks for fault-tolerant topological quantum computation
- Combining hard and soft decoders for hypergraph product codes
- Quantifying nonlocality: how outperforming local quantum codes is expensive
- Partitioning qubits in hypergraph product codes to implement logical gates
- Fold-Transversal Clifford Gates for Quantum Codes
- Entangling four logical qubits beyond break-even in a nonlocal code
- Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
- Topological wormholes
- Demonstration of Shor encoding on a trapped-ion quantum computer
- Many-hypercube codes: High-rate quantum error-correcting codes for high-performance fault-tolerant quantum computing
- Long-range-enhanced surface codes
- Distance-preserving stabilizer measurements in hypergraph product codes
- CSS code surgery as a universal construction
- Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoders
- Weight Reduced Stabilizer Codes with Lower Overhead
- Lift-Connected Surface Codes
- Limitations on transversal gates for hypergraph product codes
- Letting the tiger out of its cage: bosonic coding without concatenation
- Single-shot preparation of hypergraph product codes via dimension jump
- Classical Coding Approaches to Quantum Applications
- On the energy barrier of hypergraph product codes
- Low-density parity-check representation of fault-tolerant quantum circuits
- Targeted Clifford logical gates for hypergraph product codes
- Effective Distance of Higher Dimensional HGPs and Weight-Reduced Quantum LDPC Codes
- Tessellation codes: encoded quantum gates by geometric rotation
- Color code with a logical control- gate using transversal rotations