Succinct Arguments for QMA from Collapsing Hash Functions

📅 2026-09-28
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
This study addresses the challenge of constructing communication-efficient QMA succinct argument systems in the standard model. It proposes a novel QMA succinct argument scheme that relies solely on unstructured Minicrypt assumptions, specifically the existence of collapsing hash functions. The construction integrates quantum succinct claw-state generation protocols with blind quantum computing delegation techniques and introduces a communication-compression compiler. This work eliminates the dependence on strong cryptographic primitives, significantly simplifies the proof model, and reduces round complexity. Ultimately, it achieves a more succinct QMA argument system based on standard-model assumptions than existing approaches.
📝 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.
Innovation

Methods, ideas, or system contributions that make the work stand out.

succinct arguments for QMA
collapsing hash functions
claw-state generation
blind delegation of quantum computation
Minicrypt assumptions
🔎 Similar Papers
No similar papers found.