Fault-tolerant logical measurements via homological measurement
arXiv:2410.02753 · doi:10.1103/PhysRevX.15.021088
Abstract
We introduce homological measurement, a framework for measuring the logical Pauli operators encoded in CSS stabilizer codes. The framework is based on the algebraic description of such codes as chain complexes. Protocols such as lattice surgery some of its recent generalizations are shown to be special cases of homological measurement. Using this framework, we develop a specific protocol called edge expanded homological measurement for fault-tolerant measurement of arbitrary logical Pauli operators of general qLDPC codes, requiring a number of ancillary qubits growing only linearly with the weight of the logical operator measured, and guaranteed that the distance of the code is preserved. We further benchmark our protocol numerically in a photonic architecture based on GKP qubits, showing that the logical error rate of various codes are on par with other methods requiring more ancilla qubits.
arXiv comment20 pages, 5 figures, 5 tables. Version 2 fixes a mistake in section 3.4 and briefly addresses related recent work
References in corpus (39)
- Fault-tolerant quantum computation by anyons
- Topological quantum memory
- Encoding a qubit in an oscillator
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological Quantum Distillation
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
- Topological fault-tolerance in cluster state quantum computation
- Surface code quantum computing by lattice surgery
- High-threshold and low-overhead fault-tolerant quantum memory
- A fault-tolerant one-way quantum computer
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
- Long-range quantum entanglement in noisy cluster states
- Tradeoffs for reliable quantum information storage in 2D systems
- Decoding Across the Quantum LDPC Code Landscape
- Single-shot fault-tolerant quantum error correction
- Strong Resilience of Topological Codes to Depolarization
- Balanced Product Quantum Codes
- Constructions and Noise Threshold of Hyperbolic Surface Codes
- Foliated Quantum Codes
- Low-overhead fault-tolerant quantum computing using long-range connectivity
- Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
- A theory of single-shot error correction for adversarial noise
- Hyperbolic and Semi-Hyperbolic Surface Codes for Quantum Storage
- Quantum Expander Codes
- Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
- Fault-tolerant quantum computation with static linear optics
- Single-shot error correction of three-dimensional homological product codes
- Improved quantum hypergraph-product LDPC codes
- Fault-tolerant interface between quantum memories and quantum processors
- Bias-tailored quantum LDPC codes
- Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound
- High photon-loss threshold quantum computing using GHZ-state measurements
- Quantum LDPC Codes for Modular Architectures
- Quantum Pin Codes
- CSS code surgery as a universal construction
- Weight Reduced Stabilizer Codes with Lower Overhead
Cited by in corpus (7)
- Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes
- Parallel Logical Measurements via Quantum Code Surgery
- Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes
- Color code with a logical control- gate using transversal rotations
- Wire Codes
- Universal fault tolerant quantum computation in 2D without getting tied in knots
- Unified Framework for Quantum Code Embedding