Reflection-Based Adiabatic State Preparation
arXiv:2111.05461
Abstract
We propose a circuit-model quantum algorithm for eigenpath traversal that is based on a combination of concepts from Grover's search and adiabatic quantum computation. Our algorithm deploys a sequence of reflections determined from eigenspaces of instantaneous Hamiltonians defined along an adiabatic schedule in order to prepare a ground state of a target problem Hamiltonian. We provide numerical evidence suggesting that, for combinatorial search problems, our algorithm can find a solution faster, on average, than Grover's search. We demonstrate our findings by applying both algorithms to solving the NP-hard MAX-2SAT problem.
arXiv comment10 pages, 9 figures
References in corpus (13)
- A variational eigenvalue solver on a quantum processor
- Barren plateaus in quantum neural network training landscapes
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Grover's quantum searching algorithm is optimal
- Quantum Search by Local Adiabatic Evolution
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- A Quantum Algorithm for Finding the Minimum
- Improved Techniques for Preparing Eigenstates of Fermionic Hamiltonians
- Quantum Algorithm for Spectral Measurement with Lower Gate Count
- Resource estimate for quantum many-body ground-state preparation on a quantum computer
- Fast quantum algorithms for traversing paths of eigenstates