Cited by 78Quantum Computing Algorithms and ArchitectureQuantum many-body systemsQuantum Information and Cryptography

Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers

Open access
Liu, Xiaoyuan, Angone, Anthony, Shaydulin, Ruslan, Safro, Ilya, Alexeev, Yuri, Cincio, Lukasz·2022·IEEE Transactions on Quantum Engineering

Abstract

Combinatorial optimization on near-term quantum devices is a promising path to demonstrating quantum advantage. However, the capabilities of these devices are constrained by high noise or error rates. In this article, inspired by the variational quantum eigensolver (VQE), we propose an iterative layer VQE (L-VQE) approach. We present a large-scale numerical study, simulating circuits with up to 40 qubits and 352 parameters, that demonstrates the potential of the proposed approach. We evaluate quantum optimization heuristics on the problem of detecting multiple communities in networks, for which we introduce a novel qubit-frugal formulation. We numerically compare L-VQE with the quantum approximate optimization algorithm (QAOA) and demonstrate that QAOA achieves lower approximation ratios while requiring significantly deeper circuits. We show that L-VQE is more robust to finite sampling errors and has a higher chance of finding the solution as compared with standard VQE approaches. Our simulation results show that L-VQE performs well under realistic hardware noise.

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.1109/tqe.2021.3140190

Cites

85 of 85 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?

  • The Layer-VQE iteratively builds the quantum circuit by starting with a shallow ansatz, optimizing parameters, stopping before convergence, then iteratively adding a new layer and optimizing until a point prior to convergence.

    “The basic idea behind Layer-VQE is to start with a shallow ansatz, then, optimize the parameters and stop the optimization before convergence is reached. Thereafter, the procedure of (i) adding a new layer to the ansatz and (ii) parameter optimization until a certain point prior to convergence is iteratively repeated.”
  • L-VQE uses a very expressive parameterized circuit that can in principle solve the problem exactly with no two-qubit gates, just by optimizing the parameters of the initial single-qubit-gate layer.

    “L-VQE uses a very expressive parameterized circuit that can in principle solve the problem exactly with no two-qubit gates, just by optimizing the parameters of the initial single-qubit-gate layer .”

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: 1

  1. S. Wang et al., "Noise-induced barren plateaus in variational quan- tum algorithms," Nature Commun., vol. 12, 2021, Art. no. 6961, doi: 10.1038/s41467-021-27045-6. · DOI · Paper page

Cited by

Sorted by citations

Authors
Liu, X., Angone, A., Shaydulin, R., Safro, I., Alexeev, Y., & Cincio, L.
Affiliations
  • University of Delaware (US)
  • Clemson University (US)
  • Argonne National Laboratory (US)
  • Theoretical Division, Los Alamos National Laboratory, Los Alamos, NM, USA
Venue
IEEE Transactions on Quantum Engineering
Published
2022
Volume
3
Pages
1-20
ISSN
2689-1808 (ISSN-L)
OpenAlex
W3127043585
Cited by
78
References
85
Citations by year
2026: 7 · 2025: 12 · 2024: 21 · 2023: 17 · 2022: 17 · 2021: 4
FWCI
5.51
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Quantum Engineering (publishedVersion, cc-by-nc-nd)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Defense Advanced Research Projects Agency
  • Laboratory Directed Research and Development
  • Argonne National Laboratory
  • Office of Science
  • U.S. Department of Energy (DE-AC02-06CH11357)
  • Office of Advanced Scientific Computing Research
  • Accelerated Research for Quantum Computing program
  • Laboratory Directed Research and Development program of Los Alamos National Laboratory (20200056DR)
  • U.S. DOE
  • Accelerated Research in Quantum Computing program
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 › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
Keywords
variational quantum eigensolver, combinatorial optimization, noisy quantum computers, quantum approximate optimization algorithm, community detection, sampling error, circuit depth, device noise

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