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

Layerwise learning for quantum neural networks

Open access
Skolik, Andrea, McClean, Jarrod R., Mohseni, Masoud, van der Smagt, Patrick, Leib, Martin·2021·Quantum Machine Intelligence

Abstract

Abstract With the increased focus on quantum circuit learning for near-term applications on quantum devices, in conjunction with unique challenges presented by cost function landscapes of parametrized quantum circuits, strategies for effective training are becoming increasingly important. In order to ameliorate some of these challenges, we investigate a layerwise learning strategy for parametrized quantum circuits. The circuit depth is incrementally grown during optimization, and only subsets of parameters are updated in each training step. We show that when considering sampling noise, this strategy can help avoid the problem of barren plateaus of the error surface due to the low depth of circuits, low number of parameters trained in one step, and larger magnitude of gradients compared to training the full circuit. These properties make our algorithm preferable for execution on noisy intermediate-scale quantum devices. We demonstrate our approach on an image-classification task on handwritten digits, and show that layerwise learning attains an 8% lower generalization error on average in comparison to standard learning schemes for training quantum circuits of the same size. Additionally, the percentage of runs that reach lower test errors is up to 40% larger compared to training the full circuit, which is susceptible to creeping onto a plateau during training.

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.1007/s42484-020-00036-4

Cites

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

  • An initialization strategy was developed specifically to address BPs in deep circuits by selecting at random a subset of parameters and choosing the remaining ones so that the circuit is a sequence of shallow unitaries that evaluates to the identity.

    “Additionally, in Refs. [29, 205] an initialization strategy was developed specifically to address BPs in deep circuits. Here, one selects at random a subset of parameters in θ , and chooses the value of the remaining ones so that the circuit is a sequence of shallow unitaries that evaluates to the identity.”

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

    Split into 2 atoms — 0 confirmed, 1 partially supported, 0 disputed, 1 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.

    Experimental — accuracy not yet measured
  • These quantum machine learning approaches need careful consideration of subtle issues that do not appear in classical algorithms and are strongly intertwined with the underlying hardware.

    “Regardless of the conditions of their advantages, these approaches need careful consideration of subtle issues (see, e.g., Refs.[112-115]) that do not appear in classical algorithms and are, in particular, strongly intertwined with the underlying hardware.”
  • The entries of the Hessian vanish exponentially with the size of the system in models that are in a barren plateau.

    “It was found that the entries of the Hessian vanish exponentially with the size of the system in models that are in a barren plateau.”

    From The power of quantum neural networks (2021) · cites this paper as [32]

  • In the quantum realm, the negative effect of barren plateaus on training quantum neural networks has been linked to the Hessian matrix.

    “In the quantum realm, the negative effect of barren plateaus on training quantum neural networks has been linked to the Hessian matrix [32].”

    From The power of quantum neural networks (2021) · cites this paper as [32]

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

2 of the 63 references couldn’t be matched to a known paper.

Research works printed but not linked: 17

  1. Arute F, Arya K, Babbush R, Bacon D, Bardin JC, Barends R, Biswas R, Boixo S, Brandao FernandoGSL, Buell DA et al (2019) Nature 574(7779):505-510
  2. Carolan J, Mohseni M, Olson JP, Prabhu M, Chen C, Bunandar D, Niu MY, Harris NC, Wong FrancoNC, Hochberg M et al (2020) Nat Phys 16(3):322-327
  3. Cerezo M, Sone A, Volkoff T, Cincio L, Coles PJ (2020) arXiv:2001.00550 · arXiv
  4. Chen H, Wossnig L, Severini S, Neven H, Mohseni M (2018) arXiv:1805.08654 · arXiv
  5. Cong I, Choi S, Lukin MD (2019) Nat Phys 15(12):1273-1278
  6. Fahlman SE, Lebiere C (1990) Adv Neural Inf Process 2:524-532. https://doi.org/10.1.1.125.6421
  7. Havlíček V, Córcoles AD, Temme K, Harrow AW, Kandala A, Chow JM, Gambetta JM (2019) Nature 567(7747):209-212
  8. Kandala A, Mezzacapo A, Temme K, Takita M, Brink M, Chow JM, Gambetta JM (2017) Nature 549(7671):242-246
  9. McClean JR, Jiang Z, Rubin NC, Babbush R, Neven H (2020) Nat Commun 11(1):1-9
  10. Mitarai K, Negoro M, Kitagawa M, Fujii K (2018) Phys Rev A 98(3):032309
  11. Nakanishi KM, Fujii K, Todo S (2020) Phys Rev Res 2(4):043158
  12. Peruzzo A, McClean J, Shadbolt P, Yung M-H, Zhou X-Q, Love PJ, Aspuru-Guzik A, O'brien JL (2014) Nat Commun 5:4213. https:// www.nature.com/articles/ncomms5213
  13. Romero J, Olson JP, Aspuru-Guzik A (2017) Quantum Sci Technol 2(4):045001. https://doi.org/10.1088/2058-9565/aa8072/meta · DOI
  14. Santagati R, Wang J, Gentile AA, Paesani S, Wiebe N, McClean JR, Morley-Short S, Shadbolt PJ, Bonneau D, Silverstone JW, Tew DP, Zhou X, O'Brien JL, Thompson MG (2018) Sci Adv 4:1. http://advances.sciencemag.org/content/4/1/eaap9646
  15. Streif M, Leib M (2020) Quantum Sci Technol 5(3):034008
  16. Volkoff T, Coles PJ (2020) arXiv:2005.12200 · arXiv
  17. Yung M-H, Casanova J, Mezzacapo A, McClean J, Lamata L, Aspuru- Guzik A, Solano E (2014) Sci Rep 4(3589):1-7. https://www. nature.com/articles/srep03589

Cited by

Sorted by citations

Authors
Skolik, A., McClean, J. R., Mohseni, M., van der Smagt, P., & Leib, M.
Affiliations
  • Leiden University (NL)
  • Google (United States) (US)
Corresponding author
Skolik, Andrea
Venue
Quantum Machine Intelligence
Published
2021-01-25
Volume
3
Issue
1
ISSN
  • 2524-4906 (ISSN-L)
  • 2524-4914
OpenAlex
W3004252283
Cited by
324
References
63
Citations by year
2026: 43 · 2025: 58 · 2024: 65 · 2023: 59 · 2022: 46 · 2021: 48 · 2020: 5
FWCI
19.09
Type
journal article
Language
en
Open access
Locations
  • Quantum Machine Intelligence (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
  • Bulletin of the American Physical Society
Funders
Horizon 2020 (828826)
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
quantum neural networks, variational quantum circuits, barren plateaus, NISQ devices, circuit depth, sampling noise, image classification, handwritten digits, generalization error

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