Cited by 744Quantum Computing Algorithms and ArchitectureQuantum many-body systemsAdvanced Chemical Physics Studies

Quantum optimization using variational algorithms on near-term quantum devices

Open access
Moll, Nikolaj, Barkoutsos, Panagiotis, Bishop, Lev S, Chow, Jerry M, Cross, Andrew, Egger, Daniel J, Filipp, Stefan, Fuhrer, Andreas +10 more·2018·Quantum Science and Technology

Abstract

Universal fault-tolerant quantum computers will require error-free execution of long sequences of quantum gate operations, which is expected to involve millions of physical qubits. Before the full power of such machines will be available, near-term quantum devices will provide several hundred qubits and limited error correction. Still, there is a realistic prospect to run useful algorithms within the limited circuit depth of such devices. Particularly promising are optimization algorithms that follow a hybrid approach: the aim is to steer a highly entangled state on a quantum system to a target state that minimizes a cost function via variation of some gate parameters. This variational approach can be used both for classical optimization problems as well as for problems in quantum chemistry. The challenge is to converge to the target state given the limited coherence time and connectivity of the qubits. In this context, the quantum volume as a metric to compare the power of near-term quantum devices is discussed. With focus on chemistry applications, a general description of variational algorithms is provided and the mapping from fermions to qubits is explained. Coupled-cluster and heuristic trial wave-functions are considered for efficiently finding molecular ground states. Furthermore, simple error-mitigation schemes are introduced that could improve the accuracy of determining ground-state energies. Advancing these techniques may lead to near-term demonstrations of useful quantum computation with systems containing several hundred qubits.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/2058-9565/aab822

Cites

104 of 104 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Existing quantum hardware is not suited to implement deep and highly connected circuits required for the UCC and similar ansätze for applications beyond basic demonstrations such as the H2 molecule.

    “Therefore, existing quantum hardware is not suited to implement deep and highly connected circuits required for the UCC and similar ansätze for applications beyond basic demonstrations such as the H 2 molecule (Moll et al. , 2018).”

    From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Moll et al., 2018

  • The Trotter error of variational fast forwarding can be removed by diagonalizing instead the Hamiltonian H that generates the evolution.

    “As shown in Ref. [125], the ensuing Trotter error of this approach can be removed by diagonalizing instead the Hamiltonian H that generates the evolution.”

    From Variational quantum algorithms (2021) · cites this paper as [125]

    Section 5.1 mentions a trotterized adiabatic algorithm, while section 3.1 describes variational eigenstate preparation; neither addresses removing Trotter error by diagonalizing the evolution Hamiltonian. Searches for “variational fast forwarding,” “Trotter error,” and Hamiltonian diagonalization found no passage supporting the attributed claim. Page numbers were not available in our copy. (LLM, conf=0.77)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 6

  1. Albash T and Lidar D A 2017 Evidence for a limited quantum speedup on a quantum annealer arXiv:1705.07452 [quant-ph] · arXiv
  2. Jones N C, Whitfield J D, McMahon P L, Yung M H, Meter R V, Aspuru-Guzik A and Yamamoto Y 2012 Faster quantum chemistry simulation on fault-tolerant quantum computers New J. Phys. 14 115023 · DOI · Paper page
  3. Schwenk I, Reiner J M, Zanker S, Tian L, Leppäkangas J and Marthaler M 2017 Reconstructing the ideal results of a perturbed analog quantum simulator arXiv:1701.02683 [quant-ph] · arXiv
  4. Romero J, Babbush R, McClean J R, Hempel C, Love P and Aspuru-Guzik A 2017 Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz arXiv:1701.02691 [quant-ph] · arXiv
  5. Boixo S, Isakov S V, Smelyanskiy V N, Babbush R, Ding N, Jiang Z, Martinis J M and Neven H 2016 Characterizing quantum supremacy in near-term devices arXiv:1608.00263 [quant-ph] · arXiv
  6. Aharonov D, Ben-Or M, Impagliazzo R and Nisan N 1996 Limitations of noisy reversible computation arXiv:quant-ph/9611028 · arXiv

Cited by

Sorted by citations

Authors
Moll, N., Barkoutsos, P., Bishop, L. S., Chow, J. M., Cross, A., Egger, D. J., Filipp, S., Fuhrer, A., Gambetta, J. M., Ganzhorn, M., Kandala, A., Mezzacapo, A., Müller, P., Riess, W., Salis, G., Smolin, J., Tavernelli, I., & Temme, K.
Affiliations
  • IBM Research - Zurich (CH)
  • IBM Research - Thomas J. Watson Research Center (US)
Corresponding author
Moll, Nikolaj
Venue
Quantum Science and Technology
Published
2018-06-19
Volume
3
Issue
3
Pages
030503
ISSN
2058-9565 (ISSN-L)
OpenAlex
W2760965790
Cited by
744
References
104
Citations by year
2026: 56 · 2025: 103 · 2024: 96 · 2023: 133 · 2022: 109 · 2021: 111 · 2020: 81 · 2019: 42 · 2018: 11 · 2017: 2
FWCI
34.02
Type
journal article
Language
en
Open access
Locations
  • Quantum Science and Technology (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Advanced Chemical Physics Studies
Keywords
variational quantum algorithms, quantum optimization, near-term quantum devices, hybrid quantum-classical algorithms, quantum chemistry, quantum volume, fermion-to-qubit mapping, molecular ground state, error mitigation, ground state energy estimation, entanglement

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