Abstract
AbstractQuantum annealing (QA) holds promise for optimization problems in quantum computing, especially for combinatorial optimization. This analog framework attracts attention for its potential to address complex problems. Its gate-based homologous, QAOA with proven performance, has attracted a lot of attention to the NISQ era. Several numerical benchmarks try to compare these two metaheuristics, however, classical computational power highly limits the performance insights. In this work, we introduce a parametrized version of QA enabling a precise 1-local analysis of the algorithm. We develop a tight Lieb–Robinson bound for regular graphs, achieving the best-known numerical value to analyze QA locally. Studying MaxCut over cubic graph as a benchmark optimization problem, we show that a linear-schedule QA with a 1-local analysis achieves an approximation ratio over 0.7020, outperforming any known 1-local algorithms.
Funder
Agence Nationale de la Recherche
HQI and France 2030
Publisher
Springer Science and Business Media LLC
Reference24 articles.
1. Apolloni, B., Carvalho, C. & de Falco, D. Quantum stochastic optimization. Stoch. Process. Appl. 33, 233–244 (1989).
2. Kadowaki, T. & Nishimori, H. Quantum annealing in the transverse ising model. Phys. Rev. E 58, 5355–5363 (1998).
3. Arai, S., Oshiyama, H. & Nishimori, H. Effectiveness of quantum annealing for continuous-variable optimization. Phys. Rev. A 108, 042403 (2023).
4. Yarkoni, S., Raponi, E., Bäck, T. & Schmitt, S. Quantum annealing for industry applications: introduction and review. Rep. Progr. Phys. 85, 104001 (2022).
5. Farhi, E., Goldstone, J., Gutmann, S. & Sipser, M. Quantum computation by adiabatic evolution. Preprint at https://arxiv.org/abs/quant-ph/0001106 (2000).