Performance comparison of optimization methods on variational quantum algorithms
Open accessThe DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Abstract
Variational quantum algorithms (VQAs) offer a promising path toward using near-term quantum hardware for applications in academic and industrial research. These algorithms aim to find approximate solutions to quantum problems by optimizing a parametrized quantum circuit using a classical optimization algorithm. A successful VQA requires fast and reliable classical optimization algorithms. Understanding and optimizing how off-the-shelf optimization methods perform in this context is important for the future of the field. In this work, we study the performance of four commonly used gradient-free optimization methods [sequential least-squares quadratic programming, constrained optimization by linear approximations, the covariance matrix adaptation evolutionary strategy (CMA-ES), and the simultaneous perturbation stochastic approximation (SPSA)] to find ground-state energies of a range of small chemistry and material science problems. We test a telescoping sampling scheme (where the accuracy of the cost-function estimate provided to the optimizer is increased as the optimization converges) for all methods, demonstrating mixed results across our range of optimizers and problems chosen. We further hyperparameter tune two of the four optimizers (CMA-ES and SPSA) across a large range of models and demonstrate that with appropriate hyperparameter tuning, CMA-ES is competitive with and sometimes outperforms SPSA (which is not observed in the absence of hyperparameter tuning). Finally, we investigate the ability of an optimizer to beat the ``sampling-noise floor'' given by the sampling noise of each cost-function estimate provided to the optimizer. Our results demonstrate the necessity for tailoring and hyperparameter tuning known optimization techniques for inherently noisy variational quantum algorithms and that the variational landscape that one finds in a VQA is highly problem and system dependent. This provides guidance for future implementations of these algorithms in experiments.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
SciPy 1.0: fundamental algorithms for scientific computing in Python
Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., et al. (2020) · Nature Methods · doi:10.1038/s41592-019-0686-2 · Cited by 38,430
SciPy 1.0: fundamental algorithms for scientific computing in Python
Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., et al. (2019) · Apollo - University of Cambridge Repository · doi:10.17863/cam.64134 · Cited by 10,460
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397 · cited 4×
“• Covariance Matrix Adaptation Evolutionary Strategy (CMA-ES) [25] is the state-of-the-art direct search algorithm for the continuous black-box optimization problem, which distinguishes itself from other algorithms in the self-adaptation of its internal variables to the energy landscape.”
BackgroundMethodInfluentialVariational quantum algorithms
Cerezo, M., Arrasmith, A., Babbush, R., Benjamin, S. C., Endo, S., Fujii, K., McClean, J. R., Mitarai, K., Yuan, X., Cincio, L., et al. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00348-9 · Cited by 3,385
Coupled-cluster theory in quantum chemistry
Bartlett, R. J., & Musiał, M. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.291 · Cited by 3,343
Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
Spall, J. C. (1992) · IEEE Transactions on Automatic Control · doi:10.1109/9.119632 · Cited by 2,283
The theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
The irace package: Iterated racing for automatic algorithm configuration
López-Ibáñez, M., Dubois-Lacoste, J., Pérez Cáceres, L., Birattari, M., & Stützle, T. (2016) · Operations Research Perspectives · doi:10.1016/j.orp.2016.09.002 · Cited by 1,761
An adaptive variational algorithm for exact molecular simulations on a quantum computer
Grimsley, H. R., Economou, S. E., Barnes, E., & Mayhall, N. J. (2019) · Nature Communications · doi:10.1038/s41467-019-10988-2 · Cited by 1,033
Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz
Romero, J., Babbush, R., McClean, J. R., Hempel, C., Love, P. J., & Aspuru-Guzik, A. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/aad3e4 · Cited by 726
Progress towards practical quantum variational algorithms
Wecker, D., Hastings, M. B., & Troyer, M. (2015) · Physical Review A · doi:10.1103/physreva.92.042303 · Cited by 716
Generalized Unitary Coupled Cluster Wave functions for Quantum Computation
Lee, J., Huggins, W. J., Head-Gordon, M., & Whaley, K. B. (2019) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.8b01004 · Cited by 432
Tang, H. L., Shkolnikov, V. O., Barron, G. S., Grimsley, H. R., Mayhall, N. J., Barnes, E., & Economou, S. E. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020310 · Cited by 408
Tang, H. L., Shkolnikov, V. O., Barron, G. S., Grimsley, H. R., Mayhall, N. J., Barnes, E., & Economou, S. E. (2019) · arXiv · doi:10.48550/arxiv.1911.10205 · Cited by 408
Measurement optimization in the variational quantum eigensolver using a minimum clique cover
Verteletskyi, V., Yen, T.-C., & Izmaylov, A. F. (2020) · The Journal of Chemical Physics · doi:10.1063/1.5141458 · Cited by 269
Quantum computational advantage via 60-qubit 24-cycle random circuit sampling
Zhu, Q., Cao, S., Chen, F., Chen, M.-C., Chen, X., Chung, T.-H., Deng, H., Du, Y., Fan, D., Gong, M., et al. (2022) · Science Bulletin · doi:10.1016/j.scib.2021.10.017 · Cited by 263
Efficient and noise resilient measurements for quantum chemistry on near-term quantum computers
Huggins, W. J., McClean, J. R., Rubin, N. C., Jiang, Z., Wiebe, N., Whaley, K. B., & Babbush, R. (2021) · npj Quantum Information · doi:10.1038/s41534-020-00341-7 · Cited by 256
Structure optimization for parameterized quantum circuits
Ostaszewski, M., Grant, E., & Benedetti, M. (2019) · arXiv · doi:10.48550/arxiv.1905.09692 · Cited by 214
Strategies for solving the Fermi-Hubbard model on near-term quantum computers
Cade, C., Mineh, L., Montanaro, A., & Stanisic, S. (2020) · Physical Review B · doi:10.1103/physrevb.102.235122 · Cited by 178
Sokolov, I. O., Barkoutsos, P. K., Ollitrault, P. J., Greenberg, D., Rice, J., Pistoia, M., & Tavernelli, I. (2020) · The Journal of Chemical Physics · doi:10.1063/1.5141835 · Cited by 164
Can Single-Reference Coupled Cluster Theory Describe Static Correlation?
Bulik, I. W., Henderson, T. M., & Scuseria, G. E. (2015) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5b00422 · Cited by 161
Application of fermionic marginal constraints to hybrid quantum algorithms
Rubin, N. C., Babbush, R., & McClean, J. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aab919 · Cited by 152
Iterative qubit-excitation based variational quantum eigensolver
Yordanov, Y., Armaos, V., Barnes, C., & Arvidsson-Shukur, D. (2021) · doi:10.21203/rs.3.rs-404173/v1 · Cited by 145
Measurement reduction in variational quantum algorithms
Zhao, A., Tranter, A., Kirby, W. M., Ung, S. F., Miyake, A., & Love, P. J. (2020) · Physical Review A · doi:10.1103/physreva.101.062322 · Cited by 121
Orbital optimized unitary coupled cluster theory for quantum computer
Mizukami, W., Mitarai, K., Nakagawa, Y. O., Yamamoto, T., Yan, T., & Ohnishi, Y.-Y. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033421 · Cited by 116
Optimizing quantum heuristics with meta-learning
Wilson, M., Stromswold, S., Wudarski, F., Hadfield, S., Tubman, N. M., & Rieffel, E. (2019) · arXiv · doi:10.48550/arxiv.1908.03185 · Cited by 77
Benchmarking Adaptive Variational Quantum Eigensolvers
Claudino, D., Wright, J., McCaskey, A. J., & Humble, T. S. (2020) · Frontiers in Chemistry · doi:10.3389/fchem.2020.606863 · Cited by 52
Mutual information-assisted adaptive variational quantum eigensolver
Zhang, Z.-J., Kyaw, T. H., Kottmann, J. S., Degroote, M., & Aspuru-Guzik, A. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abdca4 · Cited by 52
Cited by
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
A review on Quantum Approximate Optimization Algorithm and its variants
Blekos, K., Brand, D., Ceschini, A., Chou, C.-H., Li, R.-H., Pandya, K., & Summer, A. (2024) · Physics Reports · doi:10.1016/j.physrep.2024.03.002 · Cited by 408
Singh, H., Majumder, S., & Mishra, S. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0161057 · Cited by 51
Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study
Gemeinhardt, F., Garmendia, A., Wimmer, M., Weder, B., & Leymann, F. (2024) · ACM Computing Surveys · doi:10.1145/3620668 · Cited by 22
“It shall be noted at this point that, according to our exclusion criteria, we refrain from taking into account the former in our analysis, as these approaches deserve a survey on their own [166].”
MethodResultTransfer learning of optimal QAOA parameters in combinatorial optimization
Montañez-Barrera, J. A., Willsch, D., & Michielsen, K. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04743-4 · Cited by 19
“(A2) represented in terms of the Ising model reads where Q ij and h i are real coefficients that represent the combinatorial optimization problem, and the offset is a constant value.”
Metadata
- Authors
- Bonet-Monroig, X., Wang, H., Vermetten, D., Senjean, B., Moussa, C., Bäck, T., Dunjko, V., & O'Brien, T. E.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2023-03-07
- Volume
- 107
- Issue
- 3
- ISSN
- 0556-2791 (ISSN-L)
- 2469-9926
- 2469-9934
- OpenAlex
- W3217665308
- Cited by
- 107
- References
- 31
- FWCI
- 9.14
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.