Bounded decoding complexity in transversal circuits with magic state injection
quant-ph
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- Opportunities and Challenges in Fault-Tolerant Quantum Computation
- Mind the gaps: The fraught road to quantum advantage
- Surface code logical operations on a superconducting quantum processor
- A superconducting surface-code processor with lattice-surgery logical operations
- Genuine Multipartite Entanglement between Logical Qubits via Cross-Code Lattice Surgery
- Fault-tolerant quantum computation with a neutral atom processor
- Quantum error correction with the toric code
- High-fidelity entangling gates and nonlocal circuits with neutral atoms
- Computing with many encoded logical qubits beyond break-even
- Fast correlated decoding of transversal logical algorithms
- An iterative transversal CNOT decoder
- Scalable Constant-Time Logical Gates for Large-Scale Quantum Computation Using Window-Based Correlated Decoding
- High-Accuracy Propagation-Assisted Local Decoding for Fast Transversal Clifford Circuits
- The Heisenberg Representation of Quantum Computers
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