The power of quantum proofs in two well studied models of quantum computation was discussed. The main results were obtained for the communication complexity model. A very simple proof for the exponential separation between quantum Merlin-Arthur (QMA) black box complexity and MA block complexity was obtained. Lower bounds for the QMA black box complexity of several functions is proved.
|Number of pages||15|
|Journal||Proceedings of the Annual IEEE Conference on Computational Complexity|
|State||Published - 2004|
|Event||Proceedings - 19th IEEE Annual Conference on Computational Complexity - Amherst, MA, United States|
Duration: 21 Jun 2004 → 24 Jun 2004