Multivariate Multicycle Codes for Complete Single-Shot Decoding
quant-ph, cs.IT, math.IT
Submitted: 2026-01-26
Updated: 2026-11-14
Terminology
Sources
- Fault-Tolerant Quantum Computation with Constant Overhead
- Locally Testable Codes with constant rate, distance, and locality
- Asymptotically Good Quantum and Locally Testable Classical LDPC Codes
- Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes
- Good Quantum LDPC Codes with Linear Time Decoders
- An efficient decoder for a linear distance quantum LDPC code
- Quantum Tanner codes
- Small quantum Tanner codes from left--right Cayley complexes
- Explicit Instances of Quantum Tanner Codes
- Decodable quantum LDPC codes beyond the $\sqrt{n}$ distance barrier using high dimensional expanders
- Moderate-length lifted quantum Tanner codes
- Symmetric Self-Dual Quantum Codes on High Dimensional Expanders
- Check-weight-constrained quantum codes: Bounds and examples
- Fault-Tolerant Logical Clifford Gates from Code Automorphisms
- Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes
- Parallel Logical Measurements via Quantum Code Surgery
- High-Rate Surgery: towards constant-overhead logical operations
- Improved QLDPC Surgery: Logical Measurements and Bridging Codes
- Low-overhead fault-tolerant quantum computation by gauging logical operators
- Local Decoders for the 2D and 4D Toric Code
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements