Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?

作者: Hirotada Kobayashi , Keiji Matsumoto , Tomoyuki Yamakami

DOI: 10.1007/978-3-540-24587-2_21

关键词: Quantum circuitQuantum channelQuantumCalculusQuantum capacityMathematical proofOpen quantum systemQuantum systemQuantum networkPure mathematicsQuantum cryptographyQuantum computerQuantum processQuantum algorithmComputer scienceSoundness

摘要: This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur uses multiple proofs unentangled with each other for his verification. Although classical multi-proof are obviously equivalent to single-proof systems, it is unclear whether collapse systems. presents a necessary and sufficient condition under the number of reducible two. It also proved that using does not increase power Merlin-Arthur case perfect soundness, there relativized world co-NP (actually co-UP) have even proofs.

参考文章(53)
E. Knill, Quantum Randomness and Nondeterminism arXiv: Quantum Physics. ,(1996)
Isaac L. Chuang, Michael A. Nielsen, Quantum Computation and Quantum Information ,(2000)
Oded Regev, Julia Kempe, 3-local Hamitonian is QMA-complete Quantum Information & Computation. ,vol. 3, pp. 258- 264 ,(2003) , 10.26421/QIC3.3-7
Dominik Janzing, Thomas Beth, Pawel Wocjan, Cooling and Low Energy State Preparation for 3-local Hamiltonians are FQMA-complete arXiv: Quantum Physics. ,(2003)
Dominik Janzing, Thomas Beth, Pawel Wocjan, "Identity check" is QMA-complete arXiv: Quantum Physics. ,(2003)
Dominik Janzing, Pawel Wocjan, Thomas Beth, Two QCMA-complete problems Quantum Information & Computation. ,vol. 3, pp. 635- 643 ,(2003) , 10.26421/QIC3.6-7
Tomoyuki Yamakami, A Foundation of Programming a Multi-tape Quantum Turing Machine mathematical foundations of computer science. pp. 430- 441 ,(1999) , 10.1007/3-540-48340-3_39
Lance Fortnow, John Rogers, Complexity Limitations on Quantum Computation Journal of Computer and System Sciences. ,vol. 59, pp. 240- 252 ,(1999) , 10.1006/JCSS.1999.1651
Charles H. Bennett, Gilles Brassard, Claude Crépeau, Richard Jozsa, Asher Peres, William K. Wootters, Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels Physical Review Letters. ,vol. 70, pp. 1895- 1899 ,(1993) , 10.1103/PHYSREVLETT.70.1895
Lance Fortnow, Michael Sipser, Are there interactive protocols for CO-NP languages? Information Processing Letters. ,vol. 28, pp. 249- 251 ,(1988) , 10.1016/0020-0190(88)90199-8