Shor's Algorithm Factoring Benchmark
Shor's factoring algorithm · Cryptography · 10 qubits · Qiskit, Cirq
Benchmark of Shor's quantum factoring algorithm on small semiprime instances. Current NISQ hardware can only factor very small numbers (N=15, N=21) with low success rates due to high error rates. GPU-based supercomputer simulations have assessed Shor's algorithm for larger numbers, finding average success probabilities above 50% due to high frequency of 'lucky' cases, with the largest simulated factorization reaching 549,755,813,701.
Benchmark of Shor's quantum factoring algorithm on small semiprime instances. Current NISQ hardware can only factor very small numbers (N=15, N=21) with low success rates due to high error rates. GPU-based supercomputer simulations have assessed Shor's algorithm for larger numbers, finding average success probabilities above 50% due to high frequency of 'lucky' cases, with the largest simulated factorization reaching 549,755,813,701.
Quantifies the massive gap between theoretical promise and NISQ reality for the most famous quantum algorithm, informing realistic timelines for cryptographic impact.
IBM Quantum, photonic (experimental), GPU simulators
Qiskit, Cirq