Quantum state and circuit distinguishability with singlequbit measurements
Abstract
We show that the Quantum State Distinguishability (QSD), which is a QSZKcomplete problem, and the Quantum Circuit Distinguishability (QCD), which is a QIPcomplete problem, can be solved by the verifier who can perform only singlequbit measurements. To show these results, we use measurementbased quantum computing: the honest prover sends a graph state to the verifier, and the verifier can perform universal quantum computing on it with only singlequbit measurements. If the prover is malicious, he does not necessarily generate the correct graph state, but the verifier can verify the correctness of the graph state by measuring the stabilizer operators.
 Publication:

arXiv eprints
 Pub Date:
 July 2016
 DOI:
 10.48550/arXiv.1607.00574
 arXiv:
 arXiv:1607.00574
 Bibcode:
 2016arXiv160700574M
 Keywords:

 Quantum Physics;
 Computer Science  Computational Complexity
 EPrint:
 17 pages, 5 figures