OpenResearchAlpha

npj Quantum Information · 10 Nov 2026

An unconditional distribution learning advantage with shallow quantum circuits

N. Pirnayh-index 3, S. Jerbi, J.-P. Seifert, J. Eisert

0
Citations
no database records one yet
0
Citations in 2026
so far
3
Leading author's h-index
N. Pirnay, in QAI's scholar index
26
References
works it cites, from open citation data

Citations by database

Each database indexes a different set of journals, preprints and books, so they are shown side by side rather than blended.

  • OpenCitations0
  • Crossref0

Citations per year

The current year is still counting.

  • 2026 so far0

Abstract

Abstract One of the core challenges of research in quantum computing is concerned with the question whether quantum advantages can be found for near-term quantum circuits that have implications for practical applications. Motivated by this mindset, in this work, we prove an unconditional quantum advantage in the probably approximately correct (PAC) distribution learning framework with shallow quantum circuit hypotheses. We identify a meaningful generative distribution learning problem where constant-depth quantum circuits using one and two qubit gates are superior compared to constant-depth bounded fan-in and fan-out classical circuits as a choice for hypothesis classes. We hence prove a PAC distribution learning separation for shallow quantum circuits over shallow classical circuits. We do so by building on recent results by Bene Watts and Parham on unconditional quantum advantages for sampling tasks with shallow circuits, which we technically uplift to a hyperplane learning problem, identifying non-local correlations as the origin of the quantum advantage.

What the data shows

  • No database records a citation yet, as is usual for a paper this new.
  • N. Pirnay has the highest h-index among the authors (3).

Graph

This paper in the middle, its authors and their most-cited papers below, the papers it cites to the left and the papers citing it to the right. The timeline lays every paper out by year.

Citing paper shares an authorAuthor without a profileSize shows citations, or h-index for authors

Select a node for its details. Drag to pan, scroll to zoom, drag a node to move it.

Start with

Authors (4)

Each author's standing in QAI's scholar index: the works their ORCID iD is attached to, and for anyone whose ORCID record names a lab OpenResearch follows, their arXiv preprints matched by name and a shared co-author. Names are as printed on the paper.

ProfileMost-cited paper

Cited by 0 papers

Who cites this paper, from open citation data, with Crossref's record of each; the 100 newest when there are more.

0 shown
No citing papers for this filter.

References (26)

What it cites, from open citation data, with Crossref's record of each.

Learning juntas
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · 2003
53

Sign in to see 6 more references

A free account opens the rest of the citing papers and references on every paper’s page.