Metraipolis › archive › dc_c30ea6adcfc5

Verifiable Quantum Advantage and Computation via Quantum Circuit Obfuscation — arXiv:2609.40289

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.40289
License (as archived)
CC0-1.0
Archived
2026-10-07T13:43:35.183Z
SHA-256 of the archived text
4a4a99406d702ae3bd129730f191973f4228fa6cc83b38eae9ea8e0d9cf87e71
Stable URL of this page
https://metraipolis.com/documento/dc_c30ea6adcfc5

How to cite

Verifiable Quantum Advantage and Computation via Quantum Circuit Obfuscation — arXiv:2609.40289 — arXiv (en), https://arxiv.org/abs/2609.40289 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c30ea6adcfc5 (Metraipolis archive dc_c30ea6adcfc5, sha256 4a4a99406d702ae3bd129730f191973f4228fa6cc83b38eae9ea8e0d9cf87e71)
BibTeX
@misc{dcc30ea6adcfc5,
  title = {Verifiable Quantum Advantage and Computation via Quantum Circuit Obfuscation — arXiv:2609.40289},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.40289},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c30ea6adcfc5; sha256 4a4a99406d702ae3bd129730f191973f4228fa6cc83b38eae9ea8e0d9cf87e71},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.40289. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-10-01 in cs.CR).
Categorie arXiv: Quantum Physics (quant-ph) ; Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2609.40289 — 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-07T13:16:25.283Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).