Two-message quantum-Arthur-Merlin game with single-qubit measurements
Tomoyuki Morimae · Physical Review A · 2016
We show that the class quantum-Arthur-Merlin (QAM) does not change even if the verifier's ability is restricted to only single-qubit measurements. To show the result, we use the idea of measurement-based quantum computing: the verifier, who can do only single-qubit measurements, can test the graph state sent from the prover and use it for his measurement-based quantum computing. Inspired by this construction, we also introduce a problem which we call stabilizer state optimization, and show that it is QMA-complete.