A Sharp Noise Threshold for Shor's Quantum Factoring and Discrete Log Algorithms

arXiv:2609.24316 · quant-ph · Submitted 2026-09-21 · Read on arXiv

quant-ph

Submitted: 2026-09-21

Updated: 2026-09-21

Terminology

• Accuracy — 1× in this paper · explained in 1 episode
• Consistency — 1× in this paper · explained in 3 episodes
• Robustness — 1× in this paper · explained in 5 episodes

Sources

• An approximate Fourier transform useful in quantum factoring
• Notes on Hallgren's efficient quantum algorithm for solving Pell's equation

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