Designing Group-Valued Codes with Full Regular Low-Weight Bases
quant-ph
Submitted: 2026-10-05
Updated: 2026-10-05
Sources
- Logical Spectroscopy: Lifted-Product Codes with Addressable Bases
- Low-overhead fault-tolerant quantum computing using long-range connectivity
- Improved QLDPC Surgery: Logical Measurements and Bridging Codes
- Homomorphic Logical Measurements
- Fault-tolerant logical measurements via homological measurement
- Low-overhead fault-tolerant quantum computation by gauging logical operators
- Universal adapters between quantum LDPC codes
- Parsimonious Quantum Low-Density Parity-Check Code Surgery
- Explicit construction of low-overhead gadgets for gates on quantum LDPC codes
- Quantum "hyperbicycle" low-density parity check codes with finite rate
- High-threshold and low-overhead fault-tolerant quantum memory
- Quantum two-block group algebra codes
- Degenerate Quantum LDPC Codes With Good Finite Length Performance
- Quantum LDPC Codes with Almost Linear Minimum Distance
- Balanced Product Quantum Codes
- Design Principles for Ultra-High-Rate Quantum Codes
- Partitioning qubits in hypergraph product codes to implement logical gates
- Fast and Parallelizable Logical Computation with Homological Product Codes
- Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes
- Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians