Resonance Breaking in Noisy Shor's Algorithm

arXiv:2609.37636 · quant-ph, cs.CC, cs.IT, math-ph, math.IT, math.MP, math.OA · Submitted 2026-09-29 · Read on arXiv

quant-ph, cs.CC, cs.IT, math-ph, math.IT, math.MP, math.OA

Submitted: 2026-09-29

Updated: 2026-09-29

Terminology

• Quantum Circuits — 3× in this paper · explained in 2 episodes
• Hamming Distance — 2× in this paper · explained in 2 episodes
• Angular Error — 1× in this paper · explained in 1 episode
• Robustness — 1× in this paper · explained in 5 episodes

Sources

• 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
• Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits
• Quon Classical Simulation: Unifying Cliffords, Matchgates and Entanglement
• Efficient classical simulation of noisy quantum computation
• Diagnosing Quantum Circuits: Noise Robustness, Trainability, and Expressibility

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
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity