CoChat

Characterizing the loss landscape of variational quantum circuits

Open access
Huembeli, Patrick, Dauphin, Alexandre · 2021 · Quantum Science and Technology

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

Abstract

Machine learning techniques enhanced by noisy intermediate-scale quantum (NISQ) devices and especially variational quantum circuits (VQC) have recently attracted much interest and have already been benchmarked for certain problems. Inspired by classical deep learning, VQCs are trained by gradient descent methods which allow for efficient training over big parameter spaces. For NISQ sized circuits, such methods show good convergence. There are however still many open questions related to the convergence of the loss function and to the trainability of these circuits in situations of vanishing gradients. Furthermore, it is not clear how ‘good’ the minima are in terms of generalization and stability against perturbations of the data and there is, therefore, a need for tools to quantitatively study the convergence of the VQCs. In this work, we introduce a way to compute the Hessian of the loss function of VQCs and show how to characterize the loss landscape with it. The eigenvalues of the Hessian give information on the local curvature and we discuss how this information can be interpreted and compared to classical neural networks. We benchmark our results on several examples, starting with a simple analytic toy model to provide some intuition about the behaviour of the Hessian, then going to bigger circuits, and also train VQCs on data. Finally, we show how the Hessian can be used to adjust the learning rate for faster convergence during the training of variational circuits.

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/abdbc9

Cites

45 of 45 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

Research works printed but not linked: 5

  1. N. S. Keskar, D. Mudigere, J. Nocedal, M. Smelyanskiy, and P. T. P. Tang, arXiv:1609.04836 [cs, math] (2017), arXiv:1609.04836 [cs, math]. · arXiv
  2. Le, 2011, ICML
  3. Y. LeCun, J. S. Denker, and S. A. Solla, in Advances in Neural Information Processing Systems , edited by D. S. Touretzky (1990) pp. 598-605.
  4. B. Hassibi and D. G. Stork, in Advances in neural information processing systems (1993) p. 164.
  5. P. Huembeli and A. Dauphin, 'PatrickHuembeli/vqc loss landscapes: ArXiv version v1.1,' https: //github.com/PatrickHuembeli/vqc\_loss\_ landscapes (2020).

Cited by

See all 72

Metadata

Authors
Huembeli, P., & Dauphin, A.
Affiliations
Institute of Photonic Sciences (ES)
Corresponding author
  • Huembeli, Patrick
  • Dauphin, Alexandre
Venue
Quantum Science and Technology
Published
2021-02-08
Volume
6
Issue
2
Pages
025011
ISSN
2058-9565 (ISSN-L)
OpenAlex
W3047041739
Cited by
71
References
20
Citations by year
2026: 1 · 2025: 9 · 2024: 23 · 2023: 9 · 2022: 13 · 2021: 16
FWCI
5.39
Type
journal article
Language
en
Open access
Licence
Locations
  • Quantum Science and Technology (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • HAL (submittedVersion)
  • arXiv (Cornell University)
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 › Stochastic Gradient Optimization Techniques
Keywords
variational quantum circuits, loss landscape, Hessian eigenvalues, local curvature, trainability, gradient vanishing, adaptive learning rate, NISQ devices, generalization

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.