LIPIcs.STACS.2008.1322.pdf
- Filesize: 171 kB
- 12 pages
Document
Distinguishing Short Quantum Computations
Author
-
Part of:
Volume:
25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Theoretical Aspects of Computer Science (STACS) - License:
Creative Commons Attribution-NoDerivs 3.0 Unported license
- Publication Date: 2008-02-06
Cite AsGet BibTex
Bill Rosgen. Distinguishing Short Quantum Computations. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 597-608, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/LIPIcs.STACS.2008.1322
https://doi.org/10.4230/LIPIcs.STACS.2008.1322
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.
Keywords
- Quantum information
- computational complexity
- quantum circuits
- quantum interactive proof systems
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads