Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Grier, Daniel, Kane, Daniel M., Morris, Jackson, Ostuni, Anthony, Wu, Kewen
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866908584151875584
author Grier, Daniel
Kane, Daniel M.
Morris, Jackson
Ostuni, Anthony
Wu, Kewen
author_facet Grier, Daniel
Kane, Daniel M.
Morris, Jackson
Ostuni, Anthony
Wu, Kewen
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2510_07808
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals
Grier, Daniel
Kane, Daniel M.
Morris, Jackson
Ostuni, Anthony
Wu, Kewen
Computational Complexity
Quantum Physics
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.
title Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals
topic Computational Complexity
Quantum Physics
url https://arxiv.org/abs/2510.07808