Which quantum algorithm provides exponential speedup for factoring large integers?
- Grover's Algorithm
- Shor's Algorithm
- Quantum Phase Estimation
- Variational Quantum Eigensolver
Answer: Shor's Algorithm
Shor's Algorithm factors integers in polynomial time on quantum computers, threatening RSA encryption. Requires fault-tolerant quantum computers not yet available at scale.