Analog Quantum Approximate Optimization Algorithm
arXiv:2112.07461 · doi:10.1088/2058-9565/ac91f0
Abstract
We present an analog version of the quantum approximate optimization algorithm suitable for current quantum annealers. The central idea of this algorithm is to optimize the schedule function, which defines the adiabatic evolution. It is achieved by choosing a suitable parametrization of the schedule function based on interpolation methods for a fixed time, with the potential to generate any function. This algorithm provides an approximate result of optimization problems that may be developed during the coherence time of current quantum annealers on their way toward quantum advantage.
13 pages, 4 figures
References in corpus (5)
- Shortcuts to Adiabaticity in Digitized Adiabatic Quantum Computing
- On barren plateaus and cost function locality in variational quantum algorithms
- A measurement-based variational quantum eigensolver
- Electronic structure with direct diagonalization on a D-Wave quantum annealer
- Digitized Adiabatic Quantum Factorization