Reference · 2026
A sharp noise threshold for Shor's quantum factoring and discrete log algorithms
Cai, J.-Y., & Young, B. (2026). A sharp noise threshold for Shor's quantum factoring and discrete log algorithms. arXiv:2609.24316.
- Authors
- Jin-Yi Cai; Ben Young
- Venue
- arXiv:2609.24316
Cited from the 12 Oct 2026 digest for Theorems 3.3 and 4.3: expected polynomial time below the threshold, and exponentially small success probability above it on a positive-density set of primes. Also cited from Shor's algorithm and from cryptography, which point at that digest rather than restating the model.
Cited by
- A noise threshold for Shor's Fourier transformdigest
- Cryptographytopic
- Fault toleranceglossary
- Shor's algorithmalgorithm
Updated 12 Oct 2026.