Schedule path optimization for adiabatic quantum computing and optimization
From MaRDI portal
Abstract: Adiabatic quantum computing and optimization have garnered much attention recently as possible models for achieving a quantum advantage over classical approaches to optimization and other special purpose computations. Both techniques are probabilistic in nature and the minimum gap between the ground state and first excited state of the system during evolution is a major factor in determining the success probability. In this work we investigate a strategy for increasing the minimum gap and success probability by introducing intermediate Hamiltonians that modify the evolution path between initial and final Hamiltonians. We focus on an optimization problem relevant to recent hardware implementations and present numerical evidence for the existence of a purely local intermediate Hamiltonian that achieve the optimum performance in terms of pushing the minimum gap to one of the end points of the evolution. As a part of this study we develop a convex optimization formulation of the search for optimal adiabatic schedules that makes this computation more tractable, and which may be of independent interest. We further study the effectiveness of random intermediate Hamiltonians on the minimum gap and success probability, and empirically find that random Hamiltonians have a significant probability of increasing the success probability, but only by a modest amount.
Recommendations
- On the optimal schedule of adiabatic quantum computing
- Adiabatic quantum optimization with qudits
- A quantum adiabatic algorithm for multiobjective combinatorial optimization
- Optimization on large interconnected graphs and networks using adiabatic quantum computation
- Resource efficient gadgets for compiling adiabatic quantum optimization problems
- An \(R||C_{\max}\) quantum scheduling algorithm
- The quantum adiabatic optimization algorithm and local minima
- The parallel quantum algorithm for the class of optimization
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework
- scientific article; zbMATH DE number 5953558
Cited in
(5)- On the quantum adiabatic evolution with the most general system Hamiltonian
- scientific article; zbMATH DE number 5953558 (Why is no real title available?)
- Why adiabatic quantum annealing is unlikely to yield speed-up
- Grover search inspired alternating operator ansatz of quantum approximate optimization algorithm for search problems
- Deep learning optimal quantum annealing schedules for random Ising models
This page was built for publication: Schedule path optimization for adiabatic quantum computing and optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186634)
