Quantum Algorithm History: From Early Models to Hybrid Methods

Q1. Which early proposal, from around 1982, argued that quantum systems could be used to simulate quantum physics more efficiently than classical computers?
- Richard Feynman's quantum simulation proposal
- Grover's database-search algorithm
- The variational quantum eigensolver
- The quantum approximate optimization algorithm
Answer: Richard Feynman's quantum simulation proposal
Q2. Which model of quantum computation is based on applying a sequence of quantum gates to qubits?
- The quantum circuit model
- The classical Turing model
- The adiabatic-only model
- The analog sorting model
Answer: The quantum circuit model
Q3. Deutsch's early quantum algorithm, proposed around 1985, was designed to distinguish which type of functions?
- Constant functions from balanced functions
- Prime numbers from composite numbers
- Marked database entries from unmarked entries
- Low-energy states from high-energy states
Answer: Constant functions from balanced functions
Q4. Simon’s algorithm, introduced in the 1990s, is primarily associated with solving which kind of problem?
- Finding a hidden period or XOR mask in a function
- Searching an unstructured database
- Approximating a molecular ground-state energy
- Optimizing a classical scheduling problem
Answer: Finding a hidden period or XOR mask in a function
Q5. What is the central computational task addressed by Shor’s algorithm, proposed in 1994?
- Integer factoring and discrete logarithms
- Unstructured database search
- Quantum state tomography
- Variational energy minimization
Answer: Integer factoring and discrete logarithms
Q6. Grover’s algorithm, introduced in the 1990s, is best known for providing a quantum speedup for which task?
- Searching an unstructured database
- Factoring large integers
- Simulating only classical systems
- Preparing a thermal equilibrium state
Answer: Searching an unstructured database
Q7. Quantum-walk algorithms are based on what general idea?
- Using quantum versions of walks on graphs or other spaces
- Replacing all quantum gates with measurements
- Factoring numbers through classical trial division
- Optimizing only by randomly changing circuit depth
Answer: Using quantum versions of walks on graphs or other spaces
Q8. Adiabatic quantum computation is based on which broad strategy?
- Slowly evolving a system so that it remains near a ground state
- Searching every database item sequentially with a classical processor
- Using only Fourier transforms to factor integers
- Measuring each qubit before applying any operation
Answer: Slowly evolving a system so that it remains near a ground state
Q9. The variational quantum eigensolver, or VQE, is an example of which approach?
- A hybrid quantum-classical method using a parameterized quantum state and classical optimization
- A purely classical factoring algorithm
- A fixed-depth database-search routine with no classical loop
- A quantum error-correction code
Answer: A hybrid quantum-classical method using a parameterized quantum state and classical optimization
Q10. QAOA, developed in the mid-2010s, is primarily associated with which goal?
- Approximately solving combinatorial optimization problems with alternating parameterized operations
- Exactly factoring every integer with a classical computer
- Distinguishing constant functions from balanced functions
- Simulating arbitrary quantum dynamics without measurements
Answer: Approximately solving combinatorial optimization problems with alternating parameterized operations

Quantum Algorithm History: From Early Models to Hybrid Methods

Explore related topics