Document Open Access Logo

Distinguishing Short Quantum Computations

Author Bill Rosgen

PDF

File

Thumbnail PDF
PDF
LIPIcs.STACS.2008.1322.pdf
  • Filesize: 171 kB
  • 12 pages

Document Identifiers

Subject Classification

Keywords
  • Quantum information
  • computational complexity
  • quantum circuits
  • quantum interactive proof systems

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

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 Get 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

Author Details

Bill Rosgen
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact