Skip to content
NewA calmer, faster ZeroHour
Researchinfo

Succinct Arguments for QMA from Collapsing Hash Functions

arXiv cs.CRby James Bartusek ()1 min read2 · 2 reads
Read at arxiv.org
AI summary · grok-4.7Summaries by Vani AI

Researchers prove succinct arguments for QMA from collapsing hash functions, without public-key assumptions.

The paper proves succinct arguments for QMA assuming only collapsing hash functions, the first such scheme from unstructured Minicrypt assumptions not known to imply public-key encryption. A quantum-succinct claw-state generation protocol bootstraps a small number of quantum correlations into arbitrarily many using only classical communication. It improves on Zhang (STOC 2021) with better round complexity, a standard-model proof, and a simpler design, and yields blind delegation of quantum computation from one-way functions.

Key facts
  • First succinct QMA arguments from collapsing hash functions alone.
  • Assumptions stay in Minicrypt and are not known to imply public-key encryption.
  • Claw-state protocol amplifies quantum correlations with classical communication.
  • Construction improves round complexity and simplicity versus Zhang, STOC 2021.
Analyze this story with Vani AIImpact, who is affected and what defenders should do, in a new chat
Tags
cryptographyqmasuccinct-argumentscollapsing-hashquantumminicryptzero-knowledge

From the original article

1 min read at arxiv.org

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.

arXiv cs.CR

By James Bartusek · arxiv.org

Read the full article at arXiv cs.CR

A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.