Fault-tolerant and fully addressable unitary logical gates via round-robin sparsification
quant-ph
Submitted: 2026-10-02
Updated: 2026-10-02
Sources
- Fault-tolerant quantum computation
- Universal adapters between quantum LDPC codes
- SSIP: automated surgery with quantum LDPC codes
- Quantum error correction with the toric code
- Addressable gate-based logical computation with quantum LDPC codes
- Finding diagonal logical gates in CSS codes and circuits
- Quantum Logic Codes: Complete Transversal Logical Clifford Instruction Sets for High-Rate Stabilizer Quantum Error Correcting Codes
- Beyond transversality: structure of Clifford circuits for CSS codes
- Automated logical Clifford gadgets for heterogeneous architectures via chain maps
- A matching decoder for bivariate bicycle codes
- Generalized matching decoders for 2D topological translationally-invariant codes
- Decoupling 2D translation-invariant topological CSS codes
- Directional Codes: a new family of quantum LDPC codes on hexagonal- and square-grid connectivity hardware
- Cyclic Hypergraph Product Code
- Tesseract: A Search-Based Decoder for Quantum Error Correction
- Fast correlated decoding of transversal logical algorithms
- Distance-Finding Algorithms for Quantum Codes and Circuits
- Scalable Neural Decoders for Practical Fault-Tolerant Quantum Computation
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