Metraipolis › archive › dc_da22c93f4002
Experimentally Testable Quantum Advantage in Shallow Circuits — arXiv:2609.38775
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.38775
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T15:17:59.434Z
- SHA-256 of the archived text
4bfe1b0bfec4f3c591a0a6e90e815a3bdf7f5f739d266554af6c6e88306386a3- Stable URL of this page
https://metraipolis.com/documento/dc_da22c93f4002
How to cite
Experimentally Testable Quantum Advantage in Shallow Circuits — arXiv:2609.38775 — arXiv (en), https://arxiv.org/abs/2609.38775 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_da22c93f4002 (Metraipolis archive dc_da22c93f4002, sha256 4bfe1b0bfec4f3c591a0a6e90e815a3bdf7f5f739d266554af6c6e88306386a3)
BibTeX
@misc{dcda22c93f4002,
title = {Experimentally Testable Quantum Advantage in Shallow Circuits — arXiv:2609.38775},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.38775},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_da22c93f4002; sha256 4bfe1b0bfec4f3c591a0a6e90e815a3bdf7f5f739d266554af6c6e88306386a3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38775. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Experimental tests of shallow-circuit quantum advantage require explicit classical bounds at finite circuit sizes. We refine the finite-size classical soundness bound of Aasnaess's graph-distributed construction to depend linearly on the number of players. Combined with standard disjoint-player repetition, this gives a two-round test on a single processor for any finite nonlocal game with a finite-dimensional perfect quantum strategy and classical winning probability $\gamma<1$, with arbitrarily small classical success. The method is based on playing $m$ copies with disjoint players and teleporting each player's register to a uniformly random one of $N$ sites before the questions are revealed. Each answer bit of a depth-$D$, fan-in-$K$ classical response with fixed wiring depends on at most $K^D$ question wires, making cross-player dependencies unlikely when $N$ is large. The quantum implementation has constant depth per round and wins with certainty. A classical device wins with probability at most $\gamma^m+O(mK^D/N)$, which vanishes as $O(\log N/N)$ for $m=\lceil\log_{1/\gamma}N\rceil$ at fixed $D$ and $K$. We present an explicit proposal for an experimentally testable quantum advantage with 99 qubits.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in cs.CC).
Categorie arXiv: Quantum Physics (quant-ph) ; Computational Complexity (cs.CC).
Pagina del lavoro: https://arxiv.org/abs/2609.38775 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:51:27.477Z dalla pagina https://arxiv.org/catchup/cs.CC/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).