Skip to content
NewA calmer, faster ZeroHour
Researchinfo

Succinct Arguments for QMA in the Quantum Random Oracle Model

arXiv cs.CRby Alessandro Chiesa ()1 min read5 · 5 reads
Read at arxiv.org
AI summary · grok-4.7Summaries by Vani AI

Researchers give the first succinct argument for QMA in the quantum random oracle model from unstructured hardness.

The paper constructs the first succinct argument for QMA in the quantum random oracle model without extra cryptographic assumptions or the quantum PCP conjecture. An efficiency-preserving transformation compiles quantum interactive oracle proofs with public-query soundness into quantum arguments using a quantum commit-and-open paradigm. A key ingredient is extractable vector commitments for quantum states with local openings in the QROM.

Key facts
  • First succinct argument for QMA in the quantum random oracle model.
  • Construction needs no structured cryptography or the quantum PCP conjecture.
  • Public-query-sound QIOPs compile via a quantum commit-and-open paradigm.
  • Extractable vector commitments for quantum states are built in the QROM.
Analyze this story with Vani AIImpact, who is affected and what defenders should do, in a new chat
Tags
cryptographyqmaqromsuccinct-argumentsquantumvector-commitments

From the original article

1 min read at arxiv.org

Succinct arguments are a fundamental cryptographic primitive for verifying computational claims with small communication. In the classical setting, succinct arguments for NP can be constructed from unstructured hardness alone (e. g.

arXiv cs.CR

By Alessandro Chiesa · 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.