The article discusses the effectiveness of different analog quantum algorithms, specifically Quantum Annealing (QA), Quantum Adiabatic Optimization (QAO), and the Quantum Approximate Optimization Algorithm (QAOA). These algorithms are being implemented on current quantum devices and show promise for near-term applications.
The research applies optimal control theory to determine which algorithm is more effective given a fixed amount of time. The findings suggest that a “bang-bang” structure, similar to QAOA, is optimal at the beginning and end of the process, while a smooth annealing structure can be used in between. This approach is demonstrated through simulations of transverse field Ising models, which are of experimental and theoretical interest.
The research, conducted by Lucas Brady, focuses on various aspects of analog quantum algorithms, including the role of quantum tunneling in adiabatic computation, classical simulation of these algorithms, and their underlying physics framework. The findings provide guideposts for the experimental implementation of quantum optimization algorithms on current and near-term devices.
Source: https://www.nist.gov/itl/math/acmd-seminar-qa-vs-qao-vs-qaoa-optimizing-analog-quantum-algorithms
Keywords: Quantum Algorithms, Analog Quantum, Quantum Annealing, Hamiltonians, Optimization
