2026-08-16T08:54:18Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1322 2024-03-06T10:33:02Z ddc:004 open_access

Distinguishing Short Quantum Computations Rosgen, Bill Quantum information computational complexity quantum circuits quantum interactive proof systems 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Bill Rosgen 2008 Is Part Of LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2008.1322 urn:nbn:de:0030-drops-13222 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1322 eng https://creativecommons.org/licenses/by-nd/3.0/legalcode