[Paper Review] One-Sided Error QMA with Shared EPR Pairs -- A Simpler Proof

Attila Pereszlényi|arXiv (Cornell University)|Jun 23, 2013

Cryptography and Data Security36 references3 citations

TL;DR

This paper presents a simplified proof that any QMA protocol can be transformed into a one-sided error protocol using a constant number of shared EPR pairs and a single message from Merlin to Arthur. By leveraging trace distance, fidelity, and the quantum de Finetti theorem, the authors provide a more direct and accessible analysis of soundness, offering a cleaner alternative to prior methods that required additional protocol rounds.

ABSTRACT

We give a simpler proof of one of the results of Kobayashi, Le Gall, and Nishimura [arXiv:1210.1290v2], which shows that any QMA protocol can be converted to a one-sided error protocol, in which Arthur and Merlin initially share a constant number of EPR pairs and then Merlin sends his proof to Arthur. Our protocol is similar but somewhat simpler than the original. Our main contribution is a simpler and more direct analysis of the soundness property that uses well-known results in quantum information such as properties of the trace distance and the fidelity, and the quantum de Finetti theorem.

Motivation & Objective

• To simplify the proof that QMA protocols can be converted to one-sided error protocols with shared EPR pairs.
• To eliminate the need for additional interaction rounds used in prior approaches.
• To provide a more direct and accessible analysis of soundness using established quantum information tools.
• To address the longstanding open problem of whether QMA equals QMA₁ through a streamlined technical framework.

Proposed method

• The protocol uses a constant number of shared EPR pairs between Arthur and Merlin, followed by a single quantum proof state from Merlin.
• Soundness is analyzed via the SWAP test applied to entangled pairs, linking success probability to the trace distance between states.
• The proof employs the quantum de Finetti theorem to bound the distance between a symmetric state and a convex combination of product states.
• Trace distance and fidelity inequalities are used to relate the SWAP test outcome to the closeness of input states to pure product states.
• A key lemma bounds the trace distance between the joint state and a mixture of product states based on the SWAP test’s success probability.
• The analysis avoids complex message exchanges by directly relating the protocol’s soundness to the geometry of quantum states.

Experimental results

Research questions

• RQ1 Can one-sided error in QMA protocols be achieved without adding extra rounds of interaction?
• RQ2 How can the soundness of QMA protocols with shared EPR pairs be analyzed more directly using quantum information tools?
• RQ3 What is the quantitative relationship between SWAP test performance and the closeness of quantum states to product states?
• RQ4 Can the quantum de Finetti theorem be effectively applied to simplify soundness proofs in QMA?
• RQ5 Is there a way to streamline the analysis of QMA protocols with shared entanglement to make them more accessible?

Key findings

• The protocol achieves one-sided error using only a constant number of EPR pairs and a single message from Merlin, without additional rounds.
• The soundness error is bounded by $ 6\sqrt{\varepsilon} $, where $ \varepsilon $ is the failure probability of the SWAP test.
• If the SWAP test succeeds with probability at least $ 1 - \varepsilon $, then the state is within trace distance $ 6\sqrt{\varepsilon} $ of a mixture of product states.
• The analysis shows that high SWAP test success implies most components of the state are nearly pure, enabling a clean approximation via pure product states.
• The use of trace distance and fidelity provides a more transparent and modular approach to soundness analysis compared to prior methods.
• The proof avoids complex message sequences and instead relies on structural properties of quantum states and well-known inequalities.