2013/06/23 by Attila Pereszlényi, Pereszlényi, Attila
Computer Science · #Computational Complexity (cs.CC) #Cryptography and Data Security #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.1306.5406
openalex publication_date 2013/06/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.