November 30, 2011
Author(s)
Stephen P. Jordan, Daniel Nagaj
QCMA is the set of decision problems such that if the answer is yes, there exists a classical bitstring, or proof, that can be efficiently verified by a quantum computer. The verifier is allowed a small probability of rejecting a valid proof or accepting