Practice quantum algorithm vocabulary: Shor's algorithm, Grover's algorithm, VQE, QAOA, quantum speedup, and the quantum supremacy vs. quantum advantage distinction.
0 / 5 completed
1 / 5
What computational problem does Shor's algorithm solve, and why is it significant for cryptography?
Shor's algorithm factors large integers in polynomial time on a quantum computer, compared to sub-exponential classical algorithms. Since RSA encryption depends on factoring being hard, a fault-tolerant quantum computer running Shor's would break current RSA cryptography.
2 / 5
What does Grover's algorithm do, and what is its quantum speedup?
Grover's algorithm provides a quadratic speedup for unstructured search: finding a marked item in N entries requires O(√N) quantum operations vs. O(N) classically. While valuable, it is less dramatic than Shor's exponential speedup.
3 / 5
What is the Variational Quantum Eigensolver (VQE)?
VQE is a leading NISQ algorithm for quantum chemistry. A parameterized quantum circuit prepares a trial state, the energy is measured, and a classical optimizer adjusts parameters to minimize it. It can run on noisy hardware because circuits are shallow.
4 / 5
What is the distinction between 'quantum supremacy' and 'quantum advantage'?
'Quantum supremacy' (Google's 2019 claim) meant a quantum computer solved a specific task classically intractable — but the task was not practically useful. 'Quantum advantage' is the stronger, more meaningful claim: quantum outperforms classical on a real-world useful problem.
5 / 5
What is QAOA (Quantum Approximate Optimization Algorithm) designed for?
QAOA is a variational algorithm targeting combinatorial optimization (e.g., graph partitioning, scheduling). It alternates between applying a problem Hamiltonian and a mixing Hamiltonian, with parameters optimized classically. It is a leading candidate for near-term quantum advantage in optimization.