 |
|
|
|
| HAL: hal-00255825, version 1 |
| Detailed view |  Export this paper |
|
|
| STACS 2008, Bordeaux : France (2008) |
|
|
|
|
| Distinguishing Short Quantum Computations |
|
|
| Bill Rosgen 1, 2 |
|
|
| (2008-02) |
|
|
|
| Distinguishing logarithmic depth quantum circuits on mixed states is shown to be complete for $QIP$, the class of problems having quantum interactive proof systems. Circuits in this model can represent arbitrary quantum processes, and thus this result has implications for the verification of implementations of quantum algorithms. The distinguishability problem is also complete for $QIP$ on constant depth circuits containing the unbounded fan-out gate. These results are shown by reducing a $QIP$-complete problem to a logarithmic depth version of itself using a parallelization technique. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Institute for Quantum Computing |
|
|
|
University of Waterloo |
|
|
| 2: | School of Computer Science |
|
|
|
University of Waterloo |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Computational Complexity |
|
|
| quantum information – computational complexity – quantum circuits – quantum interactive proof systems |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00255825, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00255825/en/ | |
| oai:hal.archives-ouvertes.fr:hal-00255825 | |
| From: Pascal Weil | |
| Submitted on: Thursday, 14 February 2008 10:47:38 | |
| Updated on: Wednesday, 20 February 2008 14:53:55 | |
