Quantum Arthur-Merlin with single-qubit measurements

We show that the class 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 the 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. We also introduce a new QMA-complete problem related to the stabilizer test.

[1]  Tomohiro Ogawa,et al.  Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing , 2007, IEEE Transactions on Information Theory.

[2]  Tomoyuki Morimae,et al.  Quantum proofs can be verified using only single qubit measurements , 2015, ArXiv.

[3]  Masahito Hayashi,et al.  Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing. , 2015, Physical review letters.

[4]  Elham Kashefi,et al.  Universal Blind Quantum Computation , 2008, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[5]  Andreas J. Winter,et al.  Coding theorem and strong converse for quantum channels , 1999, IEEE Trans. Inf. Theory.

[6]  Chris Marriott,et al.  Quantum Arthur–Merlin games , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[7]  A. Miyake,et al.  Measurement-based quantum computer in the gapped ground state of a two-body Hamiltonian. , 2008, Physical review letters.

[8]  R Raussendorf,et al.  A one-way quantum computer. , 2001, Physical review letters.

[9]  Matthew McKague,et al.  Interactive Proofs for BQP via Self-Tested Graph States , 2013, Theory Comput..

[10]  Robert Raussendorf,et al.  Topological fault-tolerance in cluster state quantum computation , 2007 .

[11]  Leonid Gurvits.  Classical deterministic complexity of Edmonds' Problem and quantum entanglement , 2003, STOC '03.

[12]  T. Morimae,et al.  Blind quantum computation protocol in which Alice only makes measurements , 2012, 1201.3966.

[13]  E. Kashefi,et al.  Unconditionally verifiable blind computation , 2012 .