Efficiently tracking errors and outcomes in universal quantum circuits
quant-ph
Submitted: 2026-11-04
Updated: 2026-11-04
Terminology
Sources
- Efficiently estimating failure rates of fault-tolerant logical non-Clifford blocks
- Stim: a fast stabilizer circuit simulator
- PyMatching: A Python package for decoding quantum codes with minimum-weight perfect matching
- Efficient simulation of logical magic state preparation protocols
- Polynomial-time simulation of non-Clifford quantum error correction
- Magna: simulating magic state factories as cheaply as Clifford circuits
- Efficient fidelity simulation of high-rate magic distillation circuits
- Tsim: Fast Universal Simulator for Quantum Error Correction
- SyQMA: A memory-efficient, symbolic and exact universal simulator for quantum error correction
- SOFT: a high-performance simulator for universal fault-tolerant quantum circuits
- How to factor 2048 bit RSA integers with less than a million noisy qubits
- The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes
- Tour de gross: A modular quantum computer based on bivariate bicycle codes
- High-rate qLDPC processors
- Operator quantum error correction
- Clifford-hierarchy stabilizer formalism with applications to twisted quantum doubles
- Fast surgery for quantum LDPC codes
- Fast and fault-tolerant logical measurements: Auxiliary hypergraphs and transversal surgery
- Spacetime codes of Clifford circuits
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