Low-cost algorithm-to-execution framework for surface-code quantum computing
quant-ph
Submitted: 2026-09-10
Updated: 2026-10-13
Comments: 36 pages, 7 figures, updated on resource estimation results and relative discussions
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
- How to factor 2048 bit RSA integers with less than a million noisy qubits
- Tour de gross: A modular quantum computer based on bivariate bicycle codes
- The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes
- Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits
- Surface code logical operations on a superconducting quantum processor
- Assessing requirements to scale to practical quantum advantage
- Quantum-classical crossover in fault-tolerant quantum dynamics simulation
- Explicit construction of low-overhead gadgets for gates on quantum LDPC codes
- Planar fault-tolerant logical measurements with low qubit overhead
- Hardware-Tailored Resource Estimation for Magic-State Distillation on Silicon Spin Qubits
- Fault Tolerant Non-Clifford State Preparation for Arbitrary Rotations
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
- Incoherent Imaging with Spatially Structured Quantum Probes
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources