License: 
Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2008.1322
URN: urn:nbn:de:0030-drops-13222
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1322/
Rosgen, Bill
Distinguishing Short Quantum Computations
Abstract
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.
BibTeX - Entry
@InProceedings{rosgen:LIPIcs:2008:1322,
author = {Bill Rosgen},
title = {{Distinguishing Short Quantum Computations}},
booktitle = {25th International Symposium on Theoretical Aspects of Computer Science},
pages = {597--608},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-06-4},
ISSN = {1868-8969},
year = {2008},
volume = {1},
editor = {Susanne Albers and Pascal Weil},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2008/1322},
URN = {urn:nbn:de:0030-drops-13222},
doi = {10.4230/LIPIcs.STACS.2008.1322},
annote = {Keywords: Quantum information, computational complexity, quantum circuits, quantum interactive proof systems}
}
|
Keywords: |
|
Quantum information, computational complexity, quantum circuits, quantum interactive proof systems |
|
Collection: |
|
25th International Symposium on Theoretical Aspects of Computer Science |
|
Issue Date: |
|
2008 |
|
Date of publication: |
|
06.02.2008 |
