Succinct arguments for QMA from standard assumptions via compiled nonlocal games

arXiv:2404.19754v1 Announce Type: cross
Abstract: We construct a succinct classical argument system for QMA, the quantum analogue of NP, from generic and standard cryptographic assumptions. Previously, building on the prior work of Mahadev (FOCS '18), Bartusek et al. (CRYPTO '22) also constructed a succinct classical argument system for QMA. However, their construction relied on post-quantumly secure indistinguishability obfuscation, a very strong primitive which is not known from standard cryptographic assumptions. In contrast, the primitives we use (namely, collapsing hash functions …

argument arxiv building crypto cryptographic cs.cr games quant-ph quantum standard system work