Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems
Quantum Physics
2012-02-29 v2
Abstract
This paper proves that classical-witness quantum Merlin-Arthur proof systems can achieve perfect completeness. That is, QCMA = QCMA1. This holds under any gate set with which the Hadamard and arbitrary classical reversible transformations can be exactly implemented, e.g., {Hadamard, Toffoli, NOT}. The proof is quantumly nonrelativizing, and uses a simple but novel quantum technique that additively adjusts the success probability, which may be of independent interest.
Cite
@article{arxiv.1111.5306,
title = {Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems},
author = {Stephen P. Jordan and Hirotada Kobayashi and Daniel Nagaj and Harumichi Nishimura},
journal= {arXiv preprint arXiv:1111.5306},
year = {2012}
}
Comments
10 pages. Added two more authors and a new proof technique, which requires only a fixed finite gate set