Metraipolis › archive › dc_c554d179be83
Zero-Knowledge Proofs of Quantumness — arXiv:2609.23455
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.23455
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T22:46:47.529Z
- SHA-256 of the archived text
0cdf835c4a9256692521484138e651df97d188a1653603a0754bd6b111e09091- Stable URL of this page
https://metraipolis.com/documento/dc_c554d179be83
How to cite
Zero-Knowledge Proofs of Quantumness — arXiv:2609.23455 — arXiv (en), https://arxiv.org/abs/2609.23455 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c554d179be83 (Metraipolis archive dc_c554d179be83, sha256 0cdf835c4a9256692521484138e651df97d188a1653603a0754bd6b111e09091)
BibTeX
@misc{dcc554d179be83,
title = {Zero-Knowledge Proofs of Quantumness — arXiv:2609.23455},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.23455},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c554d179be83; sha256 0cdf835c4a9256692521484138e651df97d188a1653603a0754bd6b111e09091},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.23455. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
With the rapid development of quantum computers, proofs of quantumness have recently become an interesting research direction. However, in current schemes for proofs of quantumness, quantum provers face the risk of being maliciously exploited by classical verifiers. Through malicious strategies in interaction with quantum provers, classical verifiers could solve some instances of hard problems that arise from the specific scheme in use. This is due to the lack of formalization that prevents malicious verifiers from extracting useful information in proofs of quantumness. To address this issue, we formalize zero-knowledge proofs of quantumness. Intuitively, the zero-knowledge property necessitates that the information gained by the classical verifier from interactions with the quantum prover should not surpass what can be simulated using a simulated classical prover interacting with the same verifier. As a result, the new zero-knowledge notion can prevent a malicious verifier from exploiting quantum advantage. We find that the classical zero-knowledge proof is sufficient to compile some existing proofs of quantumness schemes into zero-knowledge proofs of quantumness schemes. It appears to be more general to require zero-knowledge proof on the verifier side instead of the prover side. This helps to regulate the verifier's behavior from malicious to be honest-but-curious. As a result, both parties will play not only one role in the proofs of quantumness but also the dual role in the classical zero-knowledge proof. Specifically, Shor's factoring-based scheme and the learning with errors-based scheme in [Brakerski et al., FOCS, 2018] can be transformed into zero-knowledge proofs of quantumness by requiring an extractable non-interactive zero-knowledge argument on the verifier side. Zero-knowledge proofs of quantumness can thus be viewed as an enhanced security notion for proofs of quantumness. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-22 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2609.23455 — 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-09T22:25:52.401Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).