Quantum Arthur---Merlin games

  • Authors:

  • Chris Marriott;John Watrous

  • Affiliations:

  • Department of Computer Science, University of Calgary, Calgary, Canada T2N 1N4;Department of Computer Science, University of Calgary, Calgary, Canada T2N 1N4

  • Venue:
  • Computational Complexity
  • Year:
  • 2005

Quantified Score

Hi-index 0.02

Visualization

Abstract

This paper studies quantum Arthur---Merlin games, which are Arthur---Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum information. As in the classical case, messages from Arthur to Merlin are restricted to be strings of uniformly generated random bits. It is proved that for one-message quantum Arthur---Merlin games, which correspond to the complexity class QMA, completeness and soundness errors can be reduced exponentially without increasing the length of Merlin's message. Previous constructions for reducing error required a polynomial increase in the length of Merlin's message. Applications of this fact include a proof that logarithmic length quantum certificates yield no increase in power over BQP and a simple proof that $${\text{QMA}} \subseteq {\text{PP}}.$$ Other facts that are proved include the equivalence of three (or more) message quantum Arthur---Merlin games with ordinary quantum interactive proof systems and some basic properties concerning two-message quantum Arthur---Merlin games.