Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals
We construct a family of distributions $\{\mathcal{D}_n\}_n$ with $\mathcal{D}_n$ over $\{0, 1\}^n$ and a family of depth-$7$ quantum circuits $\{C_n\}_n$ such that $\mathcal{D}_n$ is produced exactly by $C_n$ with the all zeros state as input, yet any constant-depth classical circuit with bounded fan-in gates evaluated on any binary product distribution has total variation distance $1 - e^{-Ω(n)}$ from $\mathcal{D}_n$. Moreover, the quantum circuits we construct are geometrically local and use a relatively standard gate set: Hadamard, controlled-phase, CNOT, and Toffoli gates. All previous separations of this type suffer from some undesirable constraint on the classical circuit model or the quantum circuits witnessing the separation. Our family of distributions is inspired by the Parity Halving Problem of Watts, Kothari, Schaeffer, and Tal (STOC, 2019), which built on the work of Bravyi, Gosset, and König (Science, 2018) to separate shallow quantum and classical circuits for relational problems.
Authors
- Anthony Ostuni (ORCID: https://orcid.org/0000-0002-8530-6476)
- Daniel M. Kane (ORCID: https://orcid.org/0009-0007-9647-2609)
- Daniel Grier
- Kewen Wu (ORCID: https://orcid.org/0000-0002-5894-822X)
- John R. Morris (ORCID: https://orcid.org/0000-0001-9140-5211)
Publication Details
- Journal
- ArXiv.org
- Published
- 2025-10-09
- DOI
- https://doi.org/10.4230/lipics.itcs.2026.73
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation