Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 260-274 |
| Number of pages | 15 |
| Journal | Proceedings of the Annual IEEE Conference on Computational Complexity |
| Volume | 19 |
| State | Published - 2004 |
| Externally published | Yes |
| Event | Proceedings - 19th IEEE Annual Conference on Computational Complexity - Amherst, MA, United States Duration: Jun 21 2004 → Jun 24 2004 |
All Science Journal Classification (ASJC) codes
- Software
- Theoretical Computer Science
- Computational Mathematics