Shor's Algorithm Factoring Benchmark
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.[1]
- Algorithm: Shor's factoring algorithm
- Category: cryptography
- Qubits: 10
- Framework: Qiskit, Cirq
- Hardware: IBM Quantum, photonic (experimental), GPU simulators
- Reproducible: Yes
- Published:
- Shor
- factoring
- RSA
- cryptography
- fault-tolerant
What algorithm does Shor's Algorithm Factoring Benchmark use?
Shor's Algorithm Factoring Benchmark uses the Shor's factoring algorithm algorithm, categorized under cryptography.
Frequently Asked Questions
What is the Shor's Algorithm Factoring Benchmark benchmark?
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.
Is Shor's Algorithm Factoring Benchmark reproducible?
Yes, this benchmark is reproducible.