Training-efficient density quantum machine learning

Quantum machine learning (QML) requires powerful, flexible and efficiently trainable models to be successful in solving challenging problems. We introduce density quantum neural networks, a model family that prepares mixtures of trainable unitaries, with a distributional constraint over coefficients. This framework balances expressivity and efficient trainability, especially on quantum hardware. For expressivity, the Hastings-Campbell Mixing lemma converts benefits from linear combination of unitaries into density models with similar performance guarantees but shallower circuits. For trainability, commuting-generator circuits enable density model construction with efficiently extractable gradients. The framework connects to various facets of QML including post-variational and measurement-based learning. In classical settings, density models naturally integrate the mixture of experts formalism and offer natural overfitting mitigation. The framework is versatile—we uplift several quantum models into density versions to improve model performance, or trainability, or both. These include Hamming weight-preserving and equivariant models, among others. Extensive numerical experiments validate our findings.

Authors

Institutions

Publication Details

Journal
npj Quantum Information
Published
2025-11-07
DOI
https://doi.org/10.1038/s41534-025-01099-6
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
2.48

Funders

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

Training-efficient density quantum machine learning

El Amine Cherrat, Brian Coyle, Snehal Raj, Iordanis Kerenidis et al.
1 citations
npj Quantum Information
Quantum Computing Algorithms and Architecture
2.48
article

Training-efficient density quantum machine learning

El Amine Cherrat, Brian Coyle, Snehal Raj, Iordanis Kerenidis, Natansh Mathur, Skander Kazdaghli, Nishant Jain
article en
1 citations

Abstract

Quantum machine learning (QML) requires powerful, flexible and efficiently trainable models to be successful in solving challenging problems. We introduce density quantum neural networks, a model family that prepares mixtures of trainable unitaries, with a distributional constraint over coefficients. This framework balances expressivity and efficient trainability, especially on quantum hardware. For expressivity, the Hastings-Campbell Mixing lemma converts benefits from linear combination of unitaries into density models with similar performance guarantees but shallower circuits. For trainability, commuting-generator circuits enable density model construction with efficiently extractable gradients. The framework connects to various facets of QML including post-variational and measurement-based learning. In classical settings, density models naturally integrate the mixture of experts formalism and offer natural overfitting mitigation. The framework is versatile—we uplift several quantum models into density versions to improve model performance, or trainability, or both. These include Hamming weight-preserving and equivariant models, among others. Extensive numerical experiments validate our findings.

npj Quantum InformationVol. 11(1)
Centre National de la Recherche Scientifique (FR), Indian Institute of Technology Roorkee (IN), Sorbonne Université (FR), Science Wares (United States) (US), Institut de Recherche en Informatique Fondamentale (FR), LIP6 (FR)
Agence Nationale de la Recherche
Openalex Percentile: Top 8%
Quantum Computing Algorithms and Architecture
2.48
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.