Full-Rank Constructions of Explicit Lossless Expanders and Good Small-Set qLTCs
quant-ph, cs.CC, cs.DS, math.CO, math.GR
Submitted: 2026-11-02
Updated: 2026-11-02
Terminology
Sources
- Balanced Product Quantum Codes
- Explicit bounds for primes in arithmetic progressions
- Good Quantum Locally Testable Codes from Lossless Cubical Complexes
- Quantum memory at nonzero temperature in a thermodynamically trivial system
- Explicit Lossless Vertex Expanders
- Good quantum LDPC codes with linear time decoder from lossless expanders
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