Quantum
On Removing Interaction from Quantum Proofs
Publication: quant-ph updates on arXiv.org
Author: Nicholas Spooner, Max Tromanhauser
Source published: 01/10/2026, 04:00:00 UTC
Briefing created: 01/10/2026, 04:29:31 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 01/10/2026, 04:13:25 UTC.
Briefings
This article presents formal evidence that if generic Fiat-Shamir-like compilers for quantum protocols exist in the quantum random oracle model (QROM) with small completeness and soundness errors, then QMA equals BQP. The authors note that while Broadbent and Grilo showed HVZK Xi-protocols exist for QMA, the incompatibility of Fiat-Shamir with quantum messages prevents their direct use in NIZKs. The work establishes a theoretical link between the existence of such compilers and the collapse of the QMA-BQP gap.
Key points
- Broadbent and Grilo introduced a quantum analog of a Sigma-protocol called a Xi-protocol, proving HVZK Xi-protocols exist for QMA.
- The authors formally demonstrate that generic Fiat-Shamir-like compilers for quantum protocols in the QROM imply QMA = BQP.
Context and limitations
The evidence relies on the assumption of the existence of generic Fiat-Shamir-like compilers in the QROM with small completeness and soundness errors. The article does not provide a method to construct such compilers, nor does it specify the exact error bounds required for the QMA = BQP implication.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 01/10/2026, 04:29:31 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeibq5zxi5odpo63q26tj5jhntxbs2d5lfc6qlxvfrv4tyyxbhidnya