Entanglement devised barren plateau mitigation
Open accessThe DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Abstract
Hybrid quantum-classical variational algorithms are one of the most propitious implementations of quantum computing on near-term devices, offering classical machine-learning support to quantum scale solution spaces. However, numerous studies have demonstrated that the rate at which this space grows in qubit number could preclude learning in deep quantum circuits, a phenomenon known as barren plateaus. In this work, we implicate random entanglement, i.e., entanglement that is formed due to state evolution with random unitaries, as a source of barren plateaus and characterize them in terms of many-body entanglement dynamics, detailing their formation as a function of system size, circuit depth, and circuit connectivity. Using this comprehension of entanglement, we propose and demonstrate a number of barren plateau ameliorating techniques, including initial partitioning of cost function and non-cost function registers, meta-learning of low-entanglement circuit initializations, selective inter-register interaction, entanglement regularization, the addition of Langevin noise, and rotation into preferred cost function eigenbases. We find that entanglement limiting, both automatic and engineered, is a hallmark of high-accuracy training and emphasize that, because learning is an iterative organization process whereas barren plateaus are a consequence of randomization, they are not necessarily unavoidable or inescapable. Our work forms both a theoretical characterization and a practical toolbox; first defining barren plateaus in terms of random entanglement and then employing this expertise to strategically combat them.
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
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
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
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
Kandala, A., Mezzacapo, A., Temme, K., Takita, M., Brink, M., Chow, J. M., & Gambetta, J. M. (2017) · Nature · doi:10.1038/nature23879 · Cited by 2,982
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
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
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
Noise-Induced Barren Plateaus in Variational Quantum Algorithms
Wang, S., Fontana, E., Cerezo, M., Sharma, K., Sone, A., Cincio, L., & Coles, P. J. (2020) · arXiv · doi:10.48550/arxiv.2007.14384 · Cited by 791
Noise-induced barren plateaus in variational quantum algorithms
Wang, S., Fontana, E., Cerezo, M., Sharma, K., Sone, A., Cincio, L., & Coles, P. J. (2021) · Nature Communications · doi:10.1038/s41467-021-27045-6 · Cited by 773
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 · cited 1×
“The rapid development of noisy quantum devices [1] has lead to great interest in hybrid quantum-classical variational algorithms, through which classical machine learning techniques are employed to prepare, sample, and optimize states on noisy quantum hardware [2–6].”
BackgroundClassification with Quantum Neural Networks on Near Term Processors
Farhi, E., & Neven, H. (2018) · arXiv · doi:10.48550/arxiv.1802.06002 · Cited by 598
Learning to Learn: Introduction and Overview
Thrun, S., & Pratt, L. (1998) · Learning to Learn · doi:10.1007/978-1-4615-5529-2_1 · Cited by 521 · cited 1×
“This process is a form of meta-learning [40], a branch of machine learning algorithms directed at optimizing the learning process of other algorithms.”
BackgroundAn initialization strategy for addressing barren plateaus in parametrized quantum circuits
Grant, E., Wossnig, L., Ostaszewski, M., & Benedetti, M. (2019) · Quantum · doi:10.22331/q-2019-12-09-214 · Cited by 406 · cited 3×
“This method is fundamentally distinct from [15, 19], as we only initialize a subset of two-qubit gates u kij to the identity and have devised a cost function and entanglement-based strategy to motivate this choice.”
BackgroundMethodAbsence of Barren Plateaus in Quantum Convolutional Neural Networks
Pesah, A., Cerezo, M., Wang, S., Volkoff, T., Sornborger, A. T., & Coles, P. J. (2020) · arXiv · doi:10.48550/arxiv.2011.02966 · Cited by 343
Random Quantum Circuits are Approximate 2-designs
Harrow, A. W., & Low, R. A. (2009) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0873-6 · Cited by 324 · cited 2×
“For relatively shallow circuit depth L , it is known that the unitary approaches a quantum 2-design [37].”
BackgroundMeasurement 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 · cited 2×
“Moreover, an extension of this technique could be used to partially factor the cost function registers themselves, resulting generally in fewer required readouts for a given cost function determination and ameliorating the so-called “measurement problem” [26–28].”
BackgroundMethodEffect of barren plateaus on gradient-free optimization
Arrasmith, A., Cerezo, M., Czarnik, P., Cincio, L., & Coles, P. J. (2021) · Quantum · doi:10.22331/q-2021-10-05-558 · Cited by 248 · cited 1×
“Moreover, even gradient-free algorithms can be impacted [12, 13].”
BackgroundFrom transistor to trapped-ion computers for quantum chemistry
Yung, M.-H., Casanova, J., Mezzacapo, A., McClean, J., Lamata, L., Aspuru-Guzik, A., & Solano, E. (2014) · Scientific Reports · doi:10.1038/srep03589 · Cited by 221
Large gradients via correlation in random parameterized quantum circuits
Volkoff, T., & Coles, P. J. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abd891 · Cited by 143 · cited 1×
“…the amelioration of barren plateaus, including layerwise and symmetry based training [16, 17], correlated and identity-esq circuit initialization [18, 19], and quantum convolutional neural network protocols [20], but they have yet to form a complete toolbox that is suitable for large-scale,…”
BackgroundOn barren plateaus and cost function locality in variational quantum algorithms
Uvarov, A. V., & Biamonte, J. D. (2021) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8121/abfac7 · Cited by 126
Barren Plateaus Preclude Learning Scramblers
Holmes, Z., Arrasmith, A., Yan, B., Coles, P. J., Albrecht, A., & Sornborger, A. T. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.190501 · Cited by 125 · cited 1×
“More recently, the relationship between entanglement and barrenness has been explored by quantum scrambling studies [23] and in terms of visible and hidden units [24].”
BackgroundBarren plateaus preclude learning scramblers
Holmes, Z., Arrasmith, A., Yan, B., Coles, P. J., Albrecht, A., & Sornborger, A. T. (2020) · arXiv · doi:10.48550/arxiv.2009.14808 · Cited by 125
Abrupt transitions in variational quantum circuit training
Campos, E., Nasrallah, A., & Biamonte, J. (2021) · Physical Review A · doi:10.1103/physreva.103.032607 · Cited by 46
Entanglement-Induced Barren Plateaus
Ortiz Marrero, C., Kieferová, M., & Wiebe, N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040316 · Cited by 39
Non-trivial symmetries in quantum landscapes and their resilience to quantum noise
Fontana, E., Cerezo, M., Arrasmith, A., Rungger, I., & Coles, P. J. (2020) · arXiv · doi:10.48550/arxiv.2011.08763 · Cited by 32 · cited 1×
“metry based training [16, 17], correlated and identity-esq circuit initialization [18, 19], and quantum convolutional neural network protocols [20], but they have yet to form a complete toolbox that is suitable for large-scale, general purpose QNNs.”
Background
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
Noise-Induced Barren Plateaus in Variational Quantum Algorithms
Wang, S., Fontana, E., Cerezo, M., Sharma, K., Sone, A., Cincio, L., & Coles, P. J. (2020) · arXiv · doi:10.48550/arxiv.2007.14384 · Cited by 791
Noise-induced barren plateaus in variational quantum algorithms
Wang, S., Fontana, E., Cerezo, M., Sharma, K., Sone, A., Cincio, L., & Coles, P. J. (2021) · Nature Communications · doi:10.1038/s41467-021-27045-6 · Cited by 773
Challenges and opportunities in quantum machine learning
Cerezo, M., Verdon, G., Huang, H.-Y., Cincio, L., & Coles, P. J. (2022) · Nature Computational Science · doi:10.1038/s43588-022-00311-3 · Cited by 689
Connecting Ansatz Expressibility to Gradient Magnitudes and Barren Plateaus
Holmes, Z., Sharma, K., Cerezo, M., & Coles, P. J. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010313 · Cited by 570
“[44] Taylor L Patti, Khadijeh Najafi, Xun Gao, and Susanne F Yelin, “Entanglement devised barren plateau mitigation,” arXiv preprint arXiv:2012.”
Background
Metadata
- Authors
- Patti, T. L., Najafi, K., Gao, X., & Yelin, S. F.
- Venue
- Physical Review Research
- Publisher
- American Physical Society (APS)
- Published
- 2021-07-23
- Volume
- 3
- Issue
- 3
- ISSN
- 2643-1564 (ISSN-L)
- OpenAlex
- W3114970264
- Cited by
- 148
- References
- 24
- FWCI
- 9.09
- Type
- journal article
- Language
- en
- Open access
- gold
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.