发表机构
Columbia University; Bocconi University（哥伦比亚大学; 博科尼大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本研究仅基于坍缩哈希函数，通过提出量子简洁的爪态生成协议，并借助通信压缩编译器，首次构建了QMA的简洁论证方案，改进了先前工作的轮复杂度与证明模型。
AI 中文摘要
我们证明了在仅假设存在坍缩哈希函数的情况下，QMA具有简洁论证的存在性。这是第一个仅依赖非结构化“Minicrypt”假设的方案，而此类假设并未被已知蕴含公钥加密。我们的主要技术贡献是一个量子简洁的“爪态生成”协议，该协议允许我们仅通过经典通信，将少量量子关联引导为任意大规模的爪态关联。这改进了[Zhang, STOC 2021]的工作，具有更优的轮复杂度、标准模型下的证明，并且整体上更为简单。由此，我们基于单向函数得到了一个量子简洁的盲量子计算委托协议，并将其接入[Bartusek, Liu, 和 Malavolta, EUROCRYPT 2026]的通信压缩编译器，从而获得QMA的简洁论证。
英文摘要
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.
