Metraipolis › archive › dc_eeb620384d90
Succinct Arguments for QMA in the Quantum Random Oracle Model — arXiv:2609.37429
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.37429
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T17:27:09.408Z
- SHA-256 of the archived text
0a2ae3b65333cbc92fcd47886d4769ea3f4c93e5166b0a3e70ecc86704b108ba- Stable URL of this page
https://metraipolis.com/documento/dc_eeb620384d90
How to cite
Succinct Arguments for QMA in the Quantum Random Oracle Model — arXiv:2609.37429 — arXiv (en), https://arxiv.org/abs/2609.37429 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_eeb620384d90 (Metraipolis archive dc_eeb620384d90, sha256 0a2ae3b65333cbc92fcd47886d4769ea3f4c93e5166b0a3e70ecc86704b108ba)
BibTeX
@misc{dceeb620384d90,
title = {Succinct Arguments for QMA in the Quantum Random Oracle Model — arXiv:2609.37429},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.37429},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_eeb620384d90; sha256 0a2ae3b65333cbc92fcd47886d4769ea3f4c93e5166b0a3e70ecc86704b108ba},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.37429. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Succinct arguments are a fundamental cryptographic primitive for verifying computational claims with small communication. In the classical setting, succinct arguments for NP can be constructed from unstructured hardness alone (e.g., hash functions) by compiling probabilistically checkable proofs (PCPs) or interactive oracle proofs (IOPs) for NP via the commit-and-open paradigm. In contrast, known succinct arguments for QMA rely on ``structured'' cryptographic primitives, or on the quantum PCP conjecture. We construct the first succinct argument for QMA in the quantum random oracle model (QROM) without relying on additional cryptographic assumptions or unproven conjectures. This yields succinct arguments for QMA from unstructured hardness alone, showing that ideal hash functions not only suffice for succinct arguments for NP but also for QMA. Underlying our result is an efficiency-preserving transformation that compiles quantum interactive oracle proofs (QIOPs), a recently introduced interactive generalization of quantum PCPs, into quantum arguments for the same language, via a natural quantum commit-and-open paradigm. Our transformation applies to every QIOP with public-query soundness, a notion that we formalize to capture a natural requirement of the commit-and-open paradigm and is satisfied by a known QIOP for QMA. As a key ingredient in our transformation, we formalize and construct extractable vector commitments for quantum states with local openings in the QROM, which may be of independent interest. Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-30 in cs.CR). Categorie arXiv: Quantum Physics (quant-ph) ; Cryptography and Security (cs.CR). Pagina del lavoro: https://arxiv.org/abs/2609.37429 — 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-07T16:58:17.389Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).