Skip to content
aiqbench takeQuantum Comms

aiqbench analysis

This research provides formal evidence that standard Fiat-Shamir-style compilers are incompatible with quantum messages in the Quantum Random Oracle Model, as their existence would imply the collapse of complexity classes (QMA = BQP). The study effectively rules out a major pathway for constructing publicly-verifiable non-interactive zero-knowledge proofs for QMA without introducing interaction or alternative mechanisms. This finding clarifies fundamental limits in quantum cryptography and guides future protocol design away from naive classical-to-quantum adaptations.
Sources coveringarXiv, AI Alignment Forum, pronedra.ru, Quantum Zeitgeist
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

On Removing Interaction from Quantum Proofs

arXiv2 min read

arXiv:2609.38387v1 Announce Type: new Abstract: An important open question in quantum cryptography is the construction of publicly-verifiable NIZKs for QMA. Classically, one can construct NIZKs for NP in the random oracle model (and sometimes in the standard model) by compiling an honest-verifier ZK (HVZK) $\Sigma$-protocol for NP using the Fiat-Shamir transformation. Broadbent and Grilo introduced a quantum analog of a $\Sigma$-protocol (which they call a $\Xi$-protocol) in which the prover's first message is quantum, and show that HVZK $\Xi$-protocols exist for QMA. However, it is not clear how to compile such protocols into NIZKs in the (Q)ROM, because the Fiat-Shamir transformation seems to be incompatible with quantum messages. In this work we give formal evidence that this is indeed the case: we show that if generic "Fiat-Shamir-like" compilers for quantum protocols exist in the QROM (with small completeness and soundness error) then QMA = BQP.

Abstract:An important open question in quantum cryptography is the construction of publicly-verifiable NIZKs for QMA. Classically, one can construct NIZKs for NP in the random oracle model (and sometimes in the standard model) by compiling an honest-verifier ZK (HVZK) $\Sigma$-protocol for NP using the Fiat-Shamir transformation. Broadbent and Grilo introduced a quantum analog of a $\Sigma$-protocol (which they call a $\Xi$-protocol) in which the prover's first message is quantum, and show that HVZK $\Xi$-protocols exist for QMA. However, it is not clear how to compile such protocols into NIZKs in the (Q)ROM, because the Fiat-Shamir transformation seems to be incompatible with quantum messages. In this work we give formal evidence that this is indeed the case: we show that if generic "Fiat-Shamir-like" compilers for quantum protocols exist in the QROM (with small completeness and soundness error) then QMA = BQP.

Quantum Physics (quant-ph); Cryptography and Security (cs.CR)

arXiv:2609.38387 [quant-ph]

(or arXiv:2609.38387v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.38387 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 238 words

Related coverage