Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.39495

On quantum interactive proofs with a laconic prover

Zihan Hu, Yupan Liu

quant-phcs.CCcs.CRSubmitted Sep 30, 2026• Announced Oct 1, 2026• 0 citations• Revised Oct 5, 2026 (v2)
v1 · Sep 30, 2026v2 · Oct 5, 2026
arXivHTMLPDF

Abstract

Interactive proof systems with a laconic prover, studied by Goldreich, Vadhan, and Wigderson (CC, 2002), capture problems verifiable with logarithmic prover communication in the classical setting. For two-message quantum analogs, even a single-bit prover response contains quantum statistical zero-knowledge ($\sf QSZK$), introduced by Watrous (FOCS 2002). However, restricting the verifier's question to classical public coins collapses the corresponding class to $\sf BQP$, as shown by Beigi, Shor, and Watrous (ToC, 2011). We further study two-message quantum interactive proof systems with a laconic prover. To this end, we introduce the class ${\sf QIP}_{\ell\text{-}{\rm bit}}(2)$, where $\ell$ is the length of the prover's response, and establish: 1. A natural complete characterization of ${\sf QIP}_{\ell\text{-}{\rm bit}}(2)$ by Multi-State Distinguishability. In particular, Quantum State Distinguishability (QSD) is ${\sf QIP}_{\rm bit}$-complete. Since QSD is $\sf QSZK$-hard, our result places ${\sf QIP}_{\ell\text{-}{\rm bit}}(2)$, for $\ell\geq 2$, in a landscape "just above" $\sf QSZK$. 2. Easy regimes for ${\sf QIP}_{\ell\text{-}{\rm bit}}(2)$ collapsing to $\sf QSZK$. We prove that QSD$[a,b]$ (and thus ${\sf QIP}_{\rm bit}[a,b]$) is in $\sf QSZK$ when $a(n)-b(n)\geq 1/O(\log n)$, and combine this with an answer compression from ${\sf QIP}_{\ell\text{-}{\rm bit}}[2,c,s]$ to ${\sf QIP}_{\rm bit}$ to obtain another easy regime when $2c>(1+2^{\ell/2})s$. Remarkably, our improved polarization applies to SD and $\sf SZK$, resolving an open problem in Sahai and Vadhan (JACM, 2003). 3. Quantum public coins also make the interaction useless: ${\sf qc}\text{-}{\sf QAM}[O(\sqrt{\log{n}})]$ with constant gap is in $\sf BQP$, where ${\sf qc}\text{-}{\sf QAM}[\ell]$ is a subclass of ${\sf QIP}_{\ell\text{-}{\rm bit}}(2)$ in which the verifier's question is exactly halves of EPR pairs.

AI Summary

The paper studies two-message quantum interactive proofs in which the verifier sends polynomially many qubits and the prover returns only $\ell=O(\log n)$ classical bits. Quantum responses are equivalent up to a factor-two communication overhead via teleportation and superdense coding. It characterizes the resulting class $\mathsf{QIP}_{\ell\text{-bit}}(2)$ by multi-state distinguishability: estimating the optimal probability of identifying a uniformly sampled label among $2^\ell$ efficiently preparable states is complete for the class. For one-bit responses, ordinary quantum state distinguishability (QSD) is complete. The reductions express verifier acceptance as a POVM optimization over subnormalized states and add normalization padding. It also establishes $\mathsf{QSD}[a,b]\in\mathsf{QSZK}$ and classical $\mathsf{SD}[a,b]\in\mathsf{SZK}$ whenever $a-b\geq1/O(\log n)$, covering arbitrary constant thresholds $a>b$ beyond the previous $a^2>b$ regime. The construction approximates trace distance using signed combinations of smoothed Jensen–Shannon divergences, then encodes these as entropy differences. A separate answer-compression construction uses pairwise-independent hashing with quantum side information; its separation condition is $2c>(1+2^{\ell/2})s$, with additional quantitative gap requirements for the resulting $\mathsf{QSZK}$ containment. For quantum-public-coin questions consisting of EPR halves, constant-gap protocols lie in $\mathsf{BQP}$ for $\ell=O(\sqrt{\log n})$. The algorithm combines matrix multiplicative weights, QSVT and normalized trace estimation, with runtime $\operatorname{poly}(n,\ell,1/\Delta)\exp(O(\ell^2/\Delta^6))$. One-bit responses allow inverse-polynomial gaps. Extending this collapse to logarithmic responses and inverse-polynomial gaps remains open, as does polarization for arbitrary inverse-polynomial gaps. The polarization construction incurs an exponential-in-inverse-error normalization loss, which is unavoidable within its approximation family.

Little sign of AI-generated textAI use disclosedOverclaims
Large language model tools were used interactively at all stages of the preparation of this manuscript: from the earliest exploratory research stages to the final exposition and writing steps.

Central claim may not hold: The abstract overstates the answer-compression-based QSZK regime by omitting the response-length bound and quantitative separation required by the body's corollary; strict positivity of 2c−(1+2^{ℓ/2})s alone is insufficient for the supplied proof. The unconditional corollary QIP_bit=co-QIP_bit is not established by the cited argument, because QIP_bit includes inverse-polynomial gaps while the proved QSZK containment covers only inverse-logarithmic or larger gaps.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
66 pages, 4 protocols, 2 algorithms, 3 circuits, 4 tables. v2: Minor changes

Related papers

On quantum interactive proofs with short messages

Attila Pereszlényi

This paper proves one of the open problem posed by Beigi et al. in arXiv:1004.0411v2. We consider quantum interactive proof systems where in the beginning the verifier and prover send messages to each other with the combined length of all messages being at most logarithmic (in the input length); and at the end the prover sends a polynomial-length message to the verifier. We show that this class has the same expressive power as QMA.

arXiv:1109.0964•Sep 5, 2011•2 citations

Achieving perfect completeness for one- and two-message quantum proof systems

Yupan Liu, Thomas Vidick

While quantum interactive proof systems using at least three messages can achieve perfect completeness, as shown by Kitaev and Watrous (STOC 2000), whether perfect completeness is achievable for one- and two-message quantum proof systems has remained open. For the one-message case, whether $\sf QMA$ can achieve perfect completeness was posed as an open problem in Watrous (FOCS 2000) and Aharonov and Naveh (2002); for the two-message case, the corresponding problems were (implicitly) posed in Jain, Upadhyay, and Watrous~(FOCS 2009) and Kobayashi, Le Gall, and Nishimura (SICOMP, 2019). In this work, we establish that ${\sf QIP}(2)$, ${\rm qq}\text{-}{\sf QAM}$, $\sf QAM$, and $\sf QMA$ can achieve perfect completeness. Here ${\rm qq}\text{-}{\sf QAM}$ denotes the class of promise problems admitting two-message quantum-public-coin quantum interactive proof systems in which the verifier's only message consists of half-EPR pairs. Our main technical contributions are the follows: 1. For $\sf QMA$ (and directly for $\sf QAM$), an exactly constructible block-encoded matrix whose kernel certifies yes instances, constructed from the acceptance operator induced by the verification circuit. This also yields an alternative proof of ${\sf QCMA}={\sf QCMA}_1$. 2. For ${\sf QIP}(2)$ (and implicitly ${\rm qq}\text{-}{\sf QAM}$), a new turn-halving transformation that preserves completeness and ensures that the resulting proof system retains at least two messages, provided that the terminal state before the final measurement is efficiently preparable.

quant-pharXiv:2609.15926•Sep 15, 2026•3 citations

Space-Bounded Quantum Interactive Proof Systems

Le Gall, François, Liu, Yupan, Nishimura, Harumichi +1 more

We introduce two models of space-bounded quantum interactive proof systems, QIPL and QIP_{U}L. The QIP_{U}L model, a space-bounded variant of quantum interactive proofs (QIP) introduced by Watrous (CC 2003) and Kitaev and Watrous (STOC 2000), restricts verifier actions to unitary circuits. In contrast, QIPL allows logarithmically many pinching intermediate measurements per verifier action, making it the weakest model that encompasses the classical model of Condon and Ladner (JCSS 1995). We characterize the computational power of QIPL and QIP_{U}L. When the message number m is polynomially bounded, QIP_{U}L ⊊ QIPL unless P = NP: - QIPL^HC, a subclass of QIPL defined by a high-concentration condition on yes instances, exactly characterizes NP. - QIP_{U}L is contained in P and contains SAC¹ ∪ BQL, where SAC¹ denotes problems solvable by classical logarithmic-depth, semi-unbounded fan-in circuits. However, this distinction vanishes when m is constant. Our results further indicate that (pinching) intermediate measurements uniquely impact space-bounded quantum interactive proofs, unlike in space-bounded quantum computation, where BQL = BQ_{U}L. We also introduce space-bounded unitary quantum statistical zero-knowledge (QSZK_{U}L), a specific form of QIP_{U}L proof systems with statistical zero-knowledge against any verifier. This class is a space-bounded variant of quantum statistical zero-knowledge (QSZK) defined by Watrous (SICOMP 2009). We prove that QSZK_{U}L = BQL, implying that the statistical zero-knowledge property negates the computational advantage typically gained from the interaction.

arXiv:2410.23958•Leibniz international proceedings in informatics•Oct 31, 2024•3 citations

Zero-Knowledge against Quantum Attacks

John Watrous

This paper proves that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the well-known Goldreich–Micali–Wigderson classical zero-knowledge protocols for graph isomorphism and graph 3-coloring (assuming the existence of quantum computationally concealing commitment schemes in the second case). Also included is a quantum interactive proof system for a complete problem for the complexity class of problems having honest verifier quantum statistical zero-knowledge proofs, which therefore establishes that honest verifier and general quantum statistical zero-knowledge are equal: $\mathrm{QSZK}= \mathrm{QSZK}_{\mathrm{HV}}$. Previously no nontrivial interactive proof systems were known to be zero-knowledge against quantum attacks, except in restricted settings such as the honest verifier and common reference string models. This paper therefore establishes for the first time that true zero-knowledge is indeed possible in the presence of quantum information and computation.

SIAM Journal on Computing•Jan 1, 2009•206 citations

Limits on the power of quantum statistical zero-knowledge

John Watrous

In this paper we propose a definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZK/sub HV/. We prove several facts regarding this class, including: the following problem is a complete promise problem for QSZKHV: given instructions for preparing two mixed quantum states, are the states close together or far apart in the trace norm metric? This problem is a quantum generalization of the complete promise problem of Sahai and Vadhan (1997) for (classical) statistical zero-knowledge; QSZK/sub HV/ is closed under complement; QSZK/sub HV//spl sube/PSPACE. (At present it is not known if arbitrary quantum interactive proof systems can be simulated in PSPACE even for one-round proof systems); any polynomial-round honest verifier quantum statistical zero-knowledge proof system can be simulated by a two-message (i.e., one-round) honest verifier quantum statistical zero-knowledge proof system. Similarly, any polynomial-round honest verifier quantum statistical zero-knowledge proof system can be simulated by a three-message public-coin honest verifier quantum statistical zero-knowledge proof system. These facts establish close connections between classical statistical zero-knowledge and our definition for quantum statistical zero-knowledge, and give some insight regarding the effect of this zero-knowledge restriction on quantum interactive proof systems. The relationship between our definition and possible definitions of general (i.e., not necessarily honest) quantum statistical zero-knowledge are also discussed.

Annual Symposium on Foundations of Computer Science•Jun 26, 2003•141 citations

Quantum Multi Prover Interactive Proofs with Communicating Provers

Michael Ben-Or, Avinatan Hassidim, Haran Pilpel

Multi Prover Interactive Proof systems (MIPs)were first presented in a cryptographic context, but ever since they were used in various fields. Understanding the power of MIPs in the quantum context raises many open problems, as there are several interesting models to consider. For example, one can study the question when the provers share entanglement or not, and the communication between the verifier and the provers is quantum or classical. While there are several partial results on the subject, so far no one presented an efficient scheme for recognizing NEXP (or NP with logarithmic communication), except for [KM03], in the case there is no entanglement (and of course no communication between the provers). We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are unlimited in the classical communication between them. At first, this model may seem very weak, as provers who exchange information seem to be equivalent in power to a simple prover. This in fact is not the case - we show that any language in NEXP can be recognized in this model efficiently, with just two provers and two rounds of communication, with a constant completeness-soundness gap.

arXiv:0806.3982•Jun 24, 2008•8 citations
Interactive proof systems with a laconic prover, studied by Goldreich, Vadhan, and Wigderson (CC, 2002), capture problems verifiable with logarithmic prover communication in the classical setting. For two-message quantum analogs, even a single-bit prover response contains quantum statistical zero-knowledge (QSZK\sf QSZKQSZK), introduced by Watrous (FOCS 2002). However, restricting the verifier's question to classical public coins collapses the corresponding class to BQP\sf BQPBQP, as shown by Beigi, Shor, and Watrous (ToC, 2011).
We further study two-message quantum interactive proof systems with a laconic prover. To this end, we introduce the class QIPℓ-bit(2){\sf QIP}_{\ell\text{-}{\rm bit}}(2)QIPℓ-bit​(2), where ℓ\ellℓ is the length of the prover's response, and establish:
  1. A natural complete characterization of QIPℓ-bit(2){\sf QIP}_{\ell\text{-}{\rm bit}}(2)QIPℓ-bit​(2) by Multi-State Distinguishability. In particular, Quantum State Distinguishability (QSD) is QIPbit{\sf QIP}_{\rm bit}QIPbit​-complete. Since QSD is QSZK\sf QSZKQSZK-hard, our result places QIPℓ-bit(2){\sf QIP}_{\ell\text{-}{\rm bit}}(2)QIPℓ-bit​(2), for ℓ≥2\ell\geq 2ℓ≥2, in a landscape "just above" QSZK\sf QSZKQSZK.
  2. Easy regimes for QIPℓ-bit(2){\sf QIP}_{\ell\text{-}{\rm bit}}(2)QIPℓ-bit​(2) collapsing to QSZK\sf QSZKQSZK. We prove that QSD[a,b][a,b][a,b] (and thus QIPbit[a,b]{\sf QIP}_{\rm bit}[a,b]QIPbit​[a,b]) is in QSZK\sf QSZKQSZK when a(n)−b(n)≥1/O(log⁡n)a(n)-b(n)\geq 1/O(\log n)a(n)−b(n)≥1/O(logn), and combine this with an answer compression from QIPℓ-bit[2,c,s]{\sf QIP}_{\ell\text{-}{\rm bit}}[2,c,s]QIPℓ-bit​[2,c,s] to QIPbit{\sf QIP}_{\rm bit}QIPbit​ to obtain another easy regime when 2c>(1+2ℓ/2)s2c>(1+2^{\ell/2})s2c>(1+2ℓ/2)s. Remarkably, our improved polarization applies to SD and SZK\sf SZKSZK, resolving an open problem in Sahai and Vadhan (JACM, 2003).
  3. Quantum public coins also make the interaction useless: qc-QAM[O(log⁡n)]{\sf qc}\text{-}{\sf QAM}[O(\sqrt{\log{n}})]qc-QAM[O(logn​)] with constant gap is in BQP\sf BQPBQP, where qc-QAM[ℓ]{\sf qc}\text{-}{\sf QAM}[\ell]qc-QAM[ℓ] is a subclass of QIPℓ-bit(2){\sf QIP}_{\ell\text{-}{\rm bit}}(2)QIPℓ-bit​(2) in which the verifier's question is exactly halves of EPR pairs.
The paper studies two-message quantum interactive proofs in which the verifier sends polynomially many qubits and the prover returns only ℓ=O(log⁡n)\ell=O(\log n)ℓ=O(logn) classical bits. Quantum responses are equivalent up to a factor-two communication overhead via teleportation and superdense coding.
It characterizes the resulting class QIPℓ-bit(2)\mathsf{QIP}_{\ell\text{-bit}}(2)QIPℓ-bit​(2) by multi-state distinguishability: estimating the optimal probability of identifying a uniformly sampled label among 2ℓ2^\ell2ℓ efficiently preparable states is complete for the class. For one-bit responses, ordinary quantum state distinguishability (QSD) is complete. The reductions express verifier acceptance as a POVM optimization over subnormalized states and add normalization padding.
It also establishes QSD[a,b]∈QSZK\mathsf{QSD}[a,b]\in\mathsf{QSZK}QSD[a,b]∈QSZK and classical SD[a,b]∈SZK\mathsf{SD}[a,b]\in\mathsf{SZK}SD[a,b]∈SZK whenever a−b≥1/O(log⁡n)a-b\geq1/O(\log n)a−b≥1/O(logn), covering arbitrary constant thresholds a>ba>ba>b beyond the previous a2>ba^2>ba2>b regime. The construction approximates trace distance using signed combinations of smoothed Jensen–Shannon divergences, then encodes these as entropy differences. A separate answer-compression construction uses pairwise-independent hashing with quantum side information; its separation condition is 2c>(1+2ℓ/2)s2c>(1+2^{\ell/2})s2c>(1+2ℓ/2)s, with additional quantitative gap requirements for the resulting QSZK\mathsf{QSZK}QSZK containment.
For quantum-public-coin questions consisting of EPR halves, constant-gap protocols lie in BQP\mathsf{BQP}BQP for ℓ=O(log⁡n)\ell=O(\sqrt{\log n})ℓ=O(logn​). The algorithm combines matrix multiplicative weights, QSVT and normalized trace estimation, with runtime poly⁡(n,ℓ,1/Δ)exp⁡(O(ℓ2/Δ6))\operatorname{poly}(n,\ell,1/\Delta)\exp(O(\ell^2/\Delta^6))poly(n,ℓ,1/Δ)exp(O(ℓ2/Δ6)). One-bit responses allow inverse-polynomial gaps. Extending this collapse to logarithmic responses and inverse-polynomial gaps remains open, as does polarization for arbitrary inverse-polynomial gaps. The polarization construction incurs an exponential-in-inverse-error normalization loss, which is unavoidable within its approximation family.
While quantum interactive proof systems using at least three messages can achieve perfect completeness, as shown by Kitaev and Watrous (STOC 2000), whether perfect completeness is achievable for one- and two-message quantum proof systems has remained open. For the one-message case, whether QMA\sf QMAQMA can achieve perfect completeness was posed as an open problem in Watrous (FOCS 2000) and Aharonov and Naveh (2002); for the two-message case, the corresponding problems were (implicitly) posed in Jain, Upadhyay, and Watrous~(FOCS 2009) and Kobayashi, Le Gall, and Nishimura (SICOMP, 2019). In this work, we establish that QIP(2){\sf QIP}(2)QIP(2), qq-QAM{\rm qq}\text{-}{\sf QAM}qq-QAM, QAM\sf QAMQAM, and QMA\sf QMAQMA can achieve perfect completeness. Here qq-QAM{\rm qq}\text{-}{\sf QAM}qq-QAM denotes the class of promise problems admitting two-message quantum-public-coin quantum interactive proof systems in which the verifier's only message consists of half-EPR pairs. Our main technical contributions are the follows: 1. For QMA\sf QMAQMA (and directly for QAM\sf QAMQAM), an exactly constructible block-encoded matrix whose kernel certifies yes instances, constructed from the acceptance operator induced by the verification circuit. This also yields an alternative proof of QCMA=QCMA1{\sf QCMA}={\sf QCMA}_1QCMA=QCMA1​. 2. For QIP(2){\sf QIP}(2)QIP(2) (and implicitly qq-QAM{\rm qq}\text{-}{\sf QAM}qq-QAM), a new turn-halving transformation that preserves completeness and ensures that the resulting proof system retains at least two messages, provided that the terminal state before the final measurement is efficiently preparable.
We introduce two models of space-bounded quantum interactive proof systems, QIPL and QIP_{U}L. The QIP_{U}L model, a space-bounded variant of quantum interactive proofs (QIP) introduced by Watrous (CC 2003) and Kitaev and Watrous (STOC 2000), restricts verifier actions to unitary circuits. In contrast, QIPL allows logarithmically many pinching intermediate measurements per verifier action, making it the weakest model that encompasses the classical model of Condon and Ladner (JCSS 1995). We characterize the computational power of QIPL and QIP_{U}L. When the message number m is polynomially bounded, QIP_{U}L ⊊ QIPL unless P = NP: - QIPL^HC, a subclass of QIPL defined by a high-concentration condition on yes instances, exactly characterizes NP. - QIP_{U}L is contained in P and contains SAC¹ ∪ BQL, where SAC¹ denotes problems solvable by classical logarithmic-depth, semi-unbounded fan-in circuits. However, this distinction vanishes when m is constant. Our results further indicate that (pinching) intermediate measurements uniquely impact space-bounded quantum interactive proofs, unlike in space-bounded quantum computation, where BQL = BQ_{U}L. We also introduce space-bounded unitary quantum statistical zero-knowledge (QSZK_{U}L), a specific form of QIP_{U}L proof systems with statistical zero-knowledge against any verifier. This class is a space-bounded variant of quantum statistical zero-knowledge (QSZK) defined by Watrous (SICOMP 2009). We prove that QSZK_{U}L = BQL, implying that the statistical zero-knowledge property negates the computational advantage typically gained from the interaction.
This paper proves that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the well-known Goldreich–Micali–Wigderson classical zero-knowledge protocols for graph isomorphism and graph 3-coloring (assuming the existence of quantum computationally concealing commitment schemes in the second case). Also included is a quantum interactive proof system for a complete problem for the complexity class of problems having honest verifier quantum statistical zero-knowledge proofs, which therefore establishes that honest verifier and general quantum statistical zero-knowledge are equal: QSZK=QSZKHV\mathrm{QSZK}= \mathrm{QSZK}_{\mathrm{HV}}QSZK=QSZKHV​. Previously no nontrivial interactive proof systems were known to be zero-knowledge against quantum attacks, except in restricted settings such as the honest verifier and common reference string models. This paper therefore establishes for the first time that true zero-knowledge is indeed possible in the presence of quantum information and computation.
In this paper we propose a definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZK/sub HV/. We prove several facts regarding this class, including: the following problem is a complete promise problem for QSZKHV: given instructions for preparing two mixed quantum states, are the states close together or far apart in the trace norm metric? This problem is a quantum generalization of the complete promise problem of Sahai and Vadhan (1997) for (classical) statistical zero-knowledge; QSZK/sub HV/ is closed under complement; QSZK/sub HV//spl sube/PSPACE. (At present it is not known if arbitrary quantum interactive proof systems can be simulated in PSPACE even for one-round proof systems); any polynomial-round honest verifier quantum statistical zero-knowledge proof system can be simulated by a two-message (i.e., one-round) honest verifier quantum statistical zero-knowledge proof system. Similarly, any polynomial-round honest verifier quantum statistical zero-knowledge proof system can be simulated by a three-message public-coin honest verifier quantum statistical zero-knowledge proof system. These facts establish close connections between classical statistical zero-knowledge and our definition for quantum statistical zero-knowledge, and give some insight regarding the effect of this zero-knowledge restriction on quantum interactive proof systems. The relationship between our definition and possible definitions of general (i.e., not necessarily honest) quantum statistical zero-knowledge are also discussed.
Multi Prover Interactive Proof systems (MIPs)were first presented in a cryptographic context, but ever since they were used in various fields. Understanding the power of MIPs in the quantum context raises many open problems, as there are several interesting models to consider. For example, one can study the question when the provers share entanglement or not, and the communication between the verifier and the provers is quantum or classical. While there are several partial results on the subject, so far no one presented an efficient scheme for recognizing NEXP (or NP with logarithmic communication), except for [KM03], in the case there is no entanglement (and of course no communication between the provers). We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are unlimited in the classical communication between them. At first, this model may seem very weak, as provers who exchange information seem to be equivalent in power to a simple prover. This in fact is not the case - we show that any language in NEXP can be recognized in this model efficiently, with just two provers and two rounds of communication, with a constant completeness-soundness gap.