{
  "abstract": "We construct protocols for classically verifiable quantum advantage and classical verification of $\\mathsf{BQP}$ computations using \\emph{quantum indistinguishability obfuscation} (qiO). Specifically, given qiO and assuming a slightly stronger version of $\\mathsf{BQP}\\neq\\mathsf{BPP}$, we construct a two-message quantum-advantage protocol that is efficiently and publicly verifiable. Our result can be viewed as a rigorous cryptographic foundation for the heuristic quantum advantage proposals based on \\emph{peaked random circuit sampling} of Aaronson and Zhang (arXiv:2404.14493). We also construct two simple protocols for classically verifying arbitrary $\\mathsf{BQP}$ computations. The first protocol is privately verifiable and assumes only the existence of qiO. This gives a rare example of a nontrivial cryptographic application of (quantum) iO that does not make additional computational hardness assumptions. The second protocol additionally assumes post-quantum one-way functions and is \\emph{publicly verifiable}. To our knowledge, this is the first publicly verifiable protocol for classical verification of $\\mathsf{BQP}$ computations under computational assumptions in the standard model. As qiO is the basis for our results, we propose an approach to constructing qiO by adapting the local-mixing framework of Canetti--Chamon--Mucciolo--Ruckenstein.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.40289",
  "author_total": 4,
  "authors": [
    {
      "name": "Alexandru Gheorghiu"
    },
    {
      "name": "Aparna Gupte"
    },
    {
      "name": "Vojtěch Havlíček"
    },
    {
      "name": "Yunchao Liu"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/b8zd006174pck.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.40289",
  "fulltext_url": null,
  "id": "b8zd006174pck",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.40289",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.CR"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Cryptography and Data Security"
    ]
  ],
  "openalex": "W7215089470",
  "pdf_url": "https://arxiv.org/pdf/2609.40289",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-02",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/b8zd006174pck.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:27:01Z",
      "native_id": "2609.40289",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.40289"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Verifiable Quantum Advantage and Computation via Quantum Circuit Obfuscation",
  "title_text": "Verifiable Quantum Advantage and Computation via Quantum Circuit Obfuscation",
  "type": "preprint",
  "updated_at": "2026-10-30T12:27:01Z",
  "url": "https://research.draconitic.com/paper/b8zd006174pck",
  "venue": "arXiv",
  "versions": []
}