Distinguishing Short Quantum Computations

Details Distinguishing Short Quantum Computations Distinguishing Short Quantum Computations

2007-12-16

arxiv.org/abs/0712.2595v1

Physics

Quantum Physics

12 pages, 4 figures, to be published in the proceedings of STACS 2008

Scientific paper

10.4230/LIPIcs.STACS.2008.1322

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.

Affiliated with

Also associated with

No associations

Rating

Distinguishing Short Quantum Computations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distinguishing Short Quantum Computations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distinguishing Short Quantum Computations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-115569