GK Question

technology hard mcq

Which quantum algorithm provides exponential speedup for factoring large integers?

  1. Grover's Algorithm
  2. Shor's Algorithm
  3. Quantum Phase Estimation
  4. 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.

Topic Emerging Tech: Quantum Computing Review
Exam Relevance UPSC, Banking, SSC