Papers
Topics
Authors
Recent
Search
2000 character limit reached

Energy Landscapes for the Quantum Approximate Optimisation Algorithm

Published 9 Jan 2024 in quant-ph | (2401.04784v2)

Abstract: Variational quantum algorithms (VQAs) have demonstrated considerable potential in solving NP-hard combinatorial problems in the contemporary near intermediate-scale quantum (NISQ) era. The quantum approximate optimisation algorithm (QAOA) is one such algorithm, used in solving the maximum cut (Max-Cut) problem for a given graph by successive implementation of $L$ quantum circuit layers within a corresponding Trotterised ansatz. The challenge of exploring the cost function of VQAs arising from an exponential proliferation of local minima with increasing circuit depth has been well-documented. However, fewer studies have investigated the impact of circuit depth on QAOA performance in finding the correct Max-Cut solution. Here, we employ basin-hopping global optimisation methods to navigate the energy landscapes for QAOA ans\"atze for various graphs, and analyse QAOA performance in finding the correct Max-Cut solution. The structure of the solution space is also investigated using discrete path sampling to build databases of local minima and the transition states that connect them, providing insightful visualisations using disconnectivity graphs. We find that the corresponding landscapes generally have a single funnel organisation, which makes it relatively straightforward to locate low-lying minima with good Max-Cut solution probabilities. In some cases below the adiabatic limit the second lowest local minimum may even yield a higher solution probability than the global minimum. This important observation has motivated us to develop broader metrics in evaluating QAOA performance, based on collections of minima obtained from basin-hopping global optimisation. Hence we establish expectation thresholds in elucidating useful solution probabilities from local minima, an approach that may provide significant gains in elucidating reasonable solution probabilities from local minima.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (45)
  1. F. Leymann and J. Barzen, The bitter truth about gate–based quantum algorithms in the NISQ era, Quant. Sci. Tech. 5, 044007 (2020).
  2. U. Skosana and M. Tame, Demonstration of Shor’s factoring algorithm for N=21𝑁21{N}=21italic_N = 21 on IBM quantum processors, Sci. Rep. 11, 16599 (2021).
  3. K. Ito, W. Mizukami, and K. Fujii, Universal noise–precision relations in variational quantum algorithms, Phys. Rev. Res. 5, 023025 (2023).
  4. S. Halder, C. Shrikhande, and R. Maitra, Development of zero–noise extrapolated projective quantum algorithm for accurate evaluation of molecular energetics in noisy quantum devices, J. Chem. Phys. 159, 114115 (2023).
  5. A. Weidinger, G. B. Mbeng, and W. Lechner, Error mitigation for quantum approximate optimization, Phys. Rev. A 108, 032408 (2023).
  6. E. Farhi, J. Goldstone, and S. Gutmann, A quantum approximate optimization algorithm (2014).
  7. J. Wurtz and P. J. Love, Counterdiabaticity and the quantum approximate optimization algorithm, Quantum 6, 635 (2022).
  8. S. Hadfield, T. Hogg, and E. G. Rieffel, Analytical framework for quantum alternating operator ansätze, Quantum Sci. Tech. 8, 015017 (2022).
  9. D. Wierichs, C. Gogolin, and M. Kastoryano, Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer, Phys. Rev. Res. 2, 043246 (2020).
  10. E. R. Anschuetz and B. T. Kiani, Quantum variational algorithms are swamped with traps, Nat. Commun. 13 (2022).
  11. E. R. Anschuetz and B. T. Kiani, Performance of the quantum approximate optimization algorithm on the maximum cut problem (2018).
  12. D. J. Wales, Energy landscapes (Cambridge University Press, Cambridge, 2003).
  13. D. J. Wales, Exploring energy landscapes, Ann. Rev. Phys. Chem. 69, 401 (2018).
  14. Z. Li and H. A. Scheraga, Monte Carlo-minimization approach to the multiple-minima problem in protein folding, Proc. Natl. Acad. Sci. USA 84, 6611 (1987).
  15. D. J. Wales and J. P. K. Doye, Global optimization by basin-hopping and the lowest energy structures of Lennard-Jones clusters containing up to 110 atoms, J. Phys. Chem. A 101, 5111 (1997).
  16. D. J. Wales and H. A. Scheraga, Global optimization of clusters, crystals and biomolecules, Science 285, 1368 (1999).
  17. D. J. Wales, Discrete path sampling, Mol. Phys. 100, 3285 (2002).
  18. D. J. Wales, Some further applications of discrete path sampling to cluster isomerization, Mol. Phys. 102, 891 (2004).
  19. B. Choy and D. J. Wales, Molecular energy landscapes of hardware–efficient ansätze in quantum computing, J. Chem. Theory. Comput. 19, 1197–1206 (2023).
  20. D. J. Wales, M. A. Miller, and T. R. Walsh, Archetypal energy landscapes, Nature 394, 758–760 (1998).
  21. T. V. Bogdan and D. J. Wales, New results for phase transitions from catastrophe theory, J. Chem. Phys. 120, 11090 (2004).
  22. D. J. Wales, GMIN: A program for finding global minima and calculating thermodynamic properties from basin–sampling, https://www-wales.ch.cam.ac.uk/GMIN/ (2023), accessed 1 December 2023.
  23. A. Mari, T. R. Bromley, and N. Killoran, Estimating the gradient and higher–order derivatives on quantum hardware, Phys. Rev. A 103, 012405 (2021).
  24. C. G. Broyden, The convergence of a class of double-rank minimization algorithms 1. General considerations, J. Inst. Math. Appl. 6, 76 (1970).
  25. R. Fletcher, A new approach to variable metric algorithms, Comput. J. 13, 317 (1970).
  26. D. Goldfarb, A family of variable metric updates derived by variational means, Math. Comput. 24, 23 (1970).
  27. D. F. Shanno, Conditioning of quasi-Newton methods for function minimization, Math. Comput. 24, 647 (1970).
  28. D. C. Liu and J. Nocedal, On the limited memory bfgs method for large scale optimization, Math. Program. 45, 503 (1989).
  29. J. Nocedal, Updating quasi-Newton matrices with limited storage, Math. Comput. 35, 773 (1980).
  30. M. L. Paleico and J. Behler, A flexible and adaptive grid algorithm for global optimization utilizing basin hopping Monte Carlo, J. Chem. Phys. 152, 094109 (2020).
  31. F. Noé and S. Fischer, Transition networks for modeling the kinetics of conformational change in macromolecules, Curr. Opin. Struc. Biol. 18, 154 (2008).
  32. D. J. Wales, Energy landscapes: some new horizons, Curr. Opin. Struct. Biol. 20, 3 (2010).
  33. S. A. Trygubenko and D. J. Wales, A doubly nudged elastic band method for finding transition states, J. Chem. Phys. 120, 2082 (2004).
  34. D. Sheppard, R. Terrell, and G. Henkelman, Optimization methods for finding minimum energy paths, J. Chem. Phys. 128, 134106 (2008).
  35. G. Mills, H. Jónsson, and G. K. Schenter, Reversible work transition state theory: application to dissociative adsorption of hydrogen, Surf. Sci. 324, 305 (1995).
  36. G. Henkelman, B. P. Uberuaga, and H. Jónsson, A climbing image nudged elastic band method for finding saddle points and minimum energy paths, J. Chem. Phys. 113, 9901 (2000).
  37. G. Henkelman and H. Jónsson, Improved tangent estimate in the nudged elastic band method for finding minimum energy paths and saddle points, J. Chem. Phys. 113, 9978 (2000).
  38. L. J. Munro and D. J. Wales, Defect migration in crystalline silicon, Phys. Rev. B 59, 3969–3980 (1999).
  39. G. Henkelman and H. Jónsson, A dimer method for finding saddle points on high dimensional potential surfaces using only first derivatives, J. Chem. Phys. 111, 7010 (1999).
  40. Y. Kumeda, L. J. Munro, and D. J. Wales, Transition states and rearrangement mechanisms from hybrid eigenvector-following and density functional theory. application to C1010{}_{10}start_FLOATSUBSCRIPT 10 end_FLOATSUBSCRIPTH1010{}_{10}start_FLOATSUBSCRIPT 10 end_FLOATSUBSCRIPT and defect migration in crystalline silicon, Chem. Phys. Lett. 341, 185 (2001).
  41. J. M. Carr, S. A. Trygubenko, and D. J. Wales, Finding pathways between distant local minima, J. Chem. Phys. 122, 234903 (2005).
  42. E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Math. 1, 269 (1959).
  43. O. M. Becker and M. Karplus, The topology of multidimensional potential energy surfaces: Theory and application to peptide structure and kinetics, J. Chem. Phys. 106, 1495 (1997).
  44. G. G. Guerreschi and A. Y. Matsuura, QAOA for max–cut requires hundreds of qubits for quantum speed–up, Sci. Rep. 9, 332–336 (2019).
  45. J. Jäger and R. V. Krems, Universal expressiveness of variational quantum classifiers and quantum kernels for support vector machines, Nat. Commun. 14, 576 (2023).
Citations (1)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Boy Choy 
  2. David J. Wales 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 3 tweets with 6 likes about this paper.

Sign Up for Free