analiza aiqbench
This research establishes the first succinct arguments for QMA based solely on collapsing hash functions, a minimal cryptographic assumption known as "Minicrypt." The authors introduce an efficient quantum-succinct claw-state generation protocol that bootstraps correlations using only classical communication, improving upon previous round complexities and simplifying proofs in the standard model. By integrating this protocol with existing compression compilers, the work enables blind delegation of quantum computation from one-way functions without relying on public-key encryption schemes.
Succinct Arguments for QMA from Collapsing Hash Functions
arXiv:2609.35633v1 Announce Type: new Abstract: We prove the existence of succinct arguments for QMA, assuming only the existence of collapsing hash functions. This is the first scheme that relies only on unstructured ``Minicrypt'' assumptions, which are not known to imply public-key encryption. Our main technical contribution is a quantum-succinct \emph{claw-state generation} protocol that allows us to bootstrap a small number of quantum correlations into an arbitrarily large number of claw-state correlations, using classical communication only. This improves upon the work of [Zhang, STOC 2021], having better round complexity, a proof in the standard model, and being overall much simpler. This yields a quantum-succinct blind delegation of quantum computation protocol from one-way functions, which we plug into the communication-compression compiler of [Bartusek, Liu, and Malavolta, EUROCRYPT 2026] to obtain succinct arguments for QMA.
Abstract:We prove the existence of succinct arguments for QMA, assuming only the existence of collapsing hash functions. This is the first scheme that relies only on unstructured ``Minicrypt'' assumptions, which are not known to imply public-key encryption. Our main technical contribution is a quantum-succinct \emph{claw-state generation} protocol that allows us to bootstrap a small number of quantum correlations into an arbitrarily large number of claw-state correlations, using classical communication only. This improves upon the work of [Zhang, STOC 2021], having better round complexity, a proof in the standard model, and being overall much simpler. This yields a quantum-succinct blind delegation of quantum computation protocol from one-way functions, which we plug into the communication-compression compiler of [Bartusek, Liu, and Malavolta, EUROCRYPT 2026] to obtain succinct arguments for QMA.
Quantum Physics (quant-ph); Cryptography and Security (cs.CR)
arXiv:2609.35633 [quant-ph]
(or arXiv:2609.35633v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.35633 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 225 cuvinte
Subiecte conexe
A Modular Approach to Succinct Arguments for QMA
arXiv · 10 iun. 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · 15 aug. 2026
Succinct Arguments for QMA in the Quantum Random Oracle Model
arXiv · 30 sept. 2026
Notes on Algorithms
LessWrong · 10 iun. 2026