technology hard fill in the blank

The quantum algorithm that can factor large integers exponentially faster than classical algorithms is ________ Algorithm.

  1. Shor's
  2. Chandrayaan
  3. Second
  4. Gaganyaan

Answer: Shor's

Shor's Algorithm (1994) factors integers in polynomial time on a quantum computer, threatening RSA encryption which relies on factoring difficulty. Requires fault-tolerant quantum computers not yet available. Grover's Algorithm provides quadratic speedup for unstructured search. Critical for cryptography and quantum advantage questions.

Topic Quantum Computing
Exam Relevance UPSC, Banking, SSC

More Technology Questions