{
  "abstract": "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 $γ<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 $γ^m+O(mK^D/N)$, which vanishes as $O(\\log N/N)$ for $m=\\lceil\\log_{1/γ}N\\rceil$ at fixed $D$ and $K$. We present an explicit proposal for an experimentally testable quantum advantage with 99 qubits.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.38775",
  "author_total": 2,
  "authors": [
    {
      "name": "Kishor Bharti"
    },
    {
      "name": "Adán Cabello"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/5ng2nyveq3tb1.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.38775",
  "fulltext_url": null,
  "id": "5ng2nyveq3tb1",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.38775",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.CC"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7215114596",
  "pdf_url": "https://arxiv.org/pdf/2609.38775",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-30",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/5ng2nyveq3tb1.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:25:49Z",
      "native_id": "2609.38775",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.38775"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Experimentally Testable Quantum Advantage in Shallow Circuits",
  "title_text": "Experimentally Testable Quantum Advantage in Shallow Circuits",
  "type": "preprint",
  "updated_at": "2026-10-30T12:25:49Z",
  "url": "https://research.draconitic.com/paper/5ng2nyveq3tb1",
  "venue": "arXiv",
  "versions": []
}