DROPS

Document

DOI: 10.4230/LIPIcs.STACS.2008.1322

Distinguishing Short Quantum Computations

Authors: Bill Rosgen

Published in: LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008)

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.

Cite as

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)

Copy BibTex To Clipboard

@InProceedings{rosgen:LIPIcs.STACS.2008.1322,
  author =	{Rosgen, Bill},
  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 =	{Albers, Susanne and Weil, Pascal},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.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}
}

Search Results

Documents authored by Rosgen, Bill

Distinguishing Short Quantum Computations

Abstract

Cite as

Thanks for your feedback!

Could not send message