Trainability barriers and opportunities in quantum generative modeling

Abstract Quantum generative models provide inherently efficient sampling strategies and thus show promise for achieving an advantage using quantum hardware. In this work, we investigate the barriers to the trainability of quantum generative models posed by barren plateaus and exponential loss concentration. We explore the interplay between explicit and implicit models and losses, and show that using quantum generative models with explicit losses such as the KL divergence leads to a new flavor of barren plateaus. In contrast, the implicit Maximum Mean Discrepancy loss can be viewed as the expectation value of an observable that is either low-bodied and provably trainable, or global and untrainable depending on the choice of kernel. In parallel, we find that solely low-bodied implicit losses cannot in general distinguish high-order correlations in the target data, while some quantum loss estimation strategies can. We validate our findings by comparing different loss functions for modeling data from High-Energy-Physics.

Authors

Institutions

Publication Details

Journal
npj Quantum Information
Published
2024-11-13
DOI
https://doi.org/10.1038/s41534-024-00902-0
Citations
29
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
9.03

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Trainability barriers and opportunities in quantum generative modeling

S. Vallecorsa, Oriel Kiss, Michele Grossi, Manuel S. Rudolph et al.
29 citations
npj Quantum Information
Quantum Computing Algorithms and Architecture
9.03
article

Trainability barriers and opportunities in quantum generative modeling

S. Vallecorsa, Oriel Kiss, Michele Grossi, Manuel S. Rudolph, Supanut Thanasilp, Zoë Holmes, Oxana Shaya, Sacha Lerch
article en
29 citations

Abstract

Abstract Quantum generative models provide inherently efficient sampling strategies and thus show promise for achieving an advantage using quantum hardware. In this work, we investigate the barriers to the trainability of quantum generative models posed by barren plateaus and exponential loss concentration. We explore the interplay between explicit and implicit models and losses, and show that using quantum generative models with explicit losses such as the KL divergence leads to a new flavor of barren plateaus. In contrast, the implicit Maximum Mean Discrepancy loss can be viewed as the expectation value of an observable that is either low-bodied and provably trainable, or global and untrainable depending on the choice of kernel. In parallel, we find that solely low-bodied implicit losses cannot in general distinguish high-order correlations in the target data, while some quantum loss estimation strategies can. We validate our findings by comparing different loss functions for modeling data from High-Energy-Physics.

npj Quantum InformationVol. 10(1)
University of Geneva (CH), Chulalongkorn University (TH), École Polytechnique Fédérale de Lausanne (CH), European Organization for Nuclear Research (CH)
CERN
Affordable and clean energy
Openalex Percentile: Top 2%
Quantum Computing Algorithms and Architecture
9.03
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.