CoChat

Large gradients via correlation in random parameterized quantum circuits

Open access
Volkoff, Tyler, Coles, Patrick J · 2021 · Quantum Science and Technology

The DOI matches its Crossref record; 72 of the 72 references it cites were found in a registry or an index.

Abstract

Scaling of variational quantum algorithms to large problem sizes requires efficient optimization of random parameterized quantum circuits. For such circuits with uncorrelated parameters, the presence of exponentially vanishing gradients in cost function landscapes is an obstacle to optimization by gradient descent methods. In this work, we prove that reducing the dimensionality of the parameter space by utilizing circuit modules containing spatially or temporally correlated gate layers can allow one to circumvent the vanishing gradient phenomenon. Examples are drawn from random separable circuits and asymptotically optimal variational versions of Grover’s algorithm based on the quantum alternating operator ansatz. In the latter scenario, our bounds on cost function variation imply a transition between vanishing gradients and efficient trainability as the number of layers is increased toward O ( 2 n / 2 ) , the optimal oracle complexity of quantum unstructured search.

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.

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

Integrity signals

Registry

Crossref · 10.1088/2058-9565/abd891

Cites

72 of 72 references verified0 citation errors · 0 not checkable

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.

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?

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

Show all 72 references

Research works printed but not linked: 1

  1. Nielsen M A and Chuang I L 2011 Quantum Computation and Quantum Information (Cambridge: Cambridge University Press)

Cited by

See all 145

Metadata

Authors
Volkoff, T., & Coles, P. J.
Affiliations
Los Alamos National Laboratory (US)
Corresponding author
Volkoff, Tyler
Venue
Quantum Science and Technology
Published
2021-01-18
Volume
6
Issue
2
Pages
025008
ISSN
2058-9565 (ISSN-L)
OpenAlex
W3026863321
Cited by
143
References
71
Citations by year
2026: 12 · 2025: 16 · 2024: 32 · 2023: 19 · 2022: 35 · 2021: 27
FWCI
9.99
Type
journal article
Language
en
Open access
Licence
Locations
  • Quantum Science and Technology (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • U.S. Department of Energy (#89233218CNA000001)
  • Office of Science (89233218CNA000001)
  • National Nuclear Security Administration (89233218C-NA000001)
  • Advanced Scientific Computing Research (89233218CNA000001)
  • Laboratory Directed Research and Development (89233218CNA000001)
  • Los Alamos National Laboratory (89233218CNA 000001)
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 › Quantum Information and Cryptography
Keywords
gradient vanishing, variational quantum circuits, variational quantum algorithms, gradient descent, Grover's algorithm, Quantum Alternating Operator Ansatz, trainability, oracle complexity

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Large gradients via correlation in random parameterized quantum circuits. https://app.cochat.ai/papers/10.1088/2058-9565/abd891
The paper
Volkoff, T., & Coles, P. J. (2021). Large gradients via correlation in random parameterized quantum circuits. Quantum Science and Technology. https://doi.org/10.1088/2058-9565/abd891

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.