Large gradients via correlation in random parameterized quantum circuits
Open accessThe 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.
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.
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 source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Based on these observations initialization strategies were proposed and which were heuristically shown to outperform randomly initialized optimizations.”
From Variational quantum algorithms (2021) · cites this paper as [204]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Larger p requires improvements in the parametrization and optimization [204].”
From Variational quantum algorithms (2021) · cites this paper as [204]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The importance of parameter initialization was made clear in Ref. [204] where it was noted that the optimal parameters in QAOA exhibit persistent patterns.”
From Variational quantum algorithms (2021) · cites this paper as [204]
Experimental — accuracy not yet measuredIn the citing paper
“These types of spectra are known to slow down a model's training and may render optimisation suboptimal [31].”
From The power of quantum neural networks (2021) · cites this paper as [31]
In the citing paper
“Classically, the observed Fisher information spectrum is known to have undesirable optimisation properties where the outlying eigenvalues slow down training and loss convergence [31].”
From The power of quantum neural networks (2021) · cites this paper as [31]
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
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
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 · cited 2×
“Variational quantum algorithms [1] are a class of quantum algorithms especially suited to near-term applications including eigenvalue estimation [1–7], quantum compiling [8, 9], linear systems [10, 11], and quantum dynamics [12–16].”
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306 · cited 2×
“[30] Lov K.”
Barren plateaus in quantum neural network training landscapes
McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2018) · Nature Communications · doi:10.1038/s41467-018-07090-4 · Cited by 2,329 · cited 3×
“BPL are expected in randomly initialized quantum neural networks [22] and, when BPL is avoided for a given cost function, one can consider the cost function to exhibit a large gradient (relative to the generic case).”
InfluentialThe 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
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860 · cited 2×
“, quantum communication protocols that rely on collective measurements for their efficiency [31]), variational versions require new approaches for avoiding BPL.”
A Quantum Approximate Optimization Algorithm
Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv · doi:10.48550/arxiv.1411.4028 · Cited by 1,789 · cited 9×
“For the ring of disagrees problem with 4 ≤ n ≤ 10, we find numerically that maxβ,γ C(L)(β, γ) with (β1 = . . . = βL and γ1 = . . . = γL) is increasing with L, suggesting that in this case, layer-correlated QAOA provides a suboptimal, but low-dimensional, approach to the ring of disagrees problem.”
BackgroundInfluentialQuantum convolutional neural networks
Cong, I., Choi, S., & Lukin, M. D. (2019) · Nature Physics · doi:10.1038/s41567-019-0648-8 · Cited by 1,517 · cited 2×
“[37] I.”
BackgroundThe Theory of Quantum Information
Watrous, J. (2018) · doi:10.1017/9781316848142 · Cited by 1,325 · cited 1×
“Examples of quantum algorithm modules involving application of correlated gate layers to a compound quantum register [18] include coherence generation by a tensor product of Hadamard gates in quantum phase estimation [19] and quantum algorithms for linear equations [20], and sequential application…”
Cost function dependent barren plateaus in shallow parametrized quantum circuits
Cerezo, M., Sone, A., Volkoff, T., Cincio, L., & Coles, P. J. (2021) · Nature Communications · doi:10.1038/s41467-021-21728-w · Cited by 1,047
Self-citation
Research works printed but not linked: 1
- Nielsen M A and Chuang I L 2011 Quantum Computation and Quantum Information (Cambridge: Cambridge University Press)
Cited by
Variational 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
“For instance, the proposal of [177] showed that correlating the parameters in the ansatz effectively reduces the dimension of the hyperparameter space and can lead to large cost function gradients.”
BackgroundSelf-citationNoisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
The power of quantum neural networks
Abbas, A., Sutter, D., Zoufal, C., Lucchi, A., Figalli, A., & Woerner, S. (2021) · Nature Computational Science · doi:10.1038/s43588-021-00084-1 · Cited by 1,082
Cost function dependent barren plateaus in shallow parametrized quantum circuits
Cerezo, M., Sone, A., Volkoff, T., Cincio, L., & Coles, P. J. (2021) · Nature Communications · doi:10.1038/s41467-021-21728-w · Cited by 1,047
“Finally, we remark that some strategies have been developed to mitigate the effects of barren plateaus 32,33,53,54 .”
BackgroundSelf-citationThe 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
Metadata
- Authors
- Volkoff, T., & Coles, P. J.
- Affiliations
- Los Alamos National Laboratory (US)
- Corresponding author
- Volkoff, Tyler
- Venue
- Quantum Science and Technology
- Publisher
- IOP Publishing
- 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
- bronze
- doi.org
- Licence
- publishingsupport.iopscience.iop.org/iop-standard/v1 (vor)
- iopscience.iop.org/info/page/text-and-data-mining (tdm)
- 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.