Computer Science – Computational Complexity
Scientific paper
2004-07-22
Computer Science
Computational Complexity
17 pages
Scientific paper
This paper considers the following problem. Two mixed-state quantum circuits Q and R are given, and the goal is to determine which of two possibilities holds: (i) Q and R act nearly identically on all possible quantum state inputs, or (ii) there exists some input state that Q and R transform into almost perfectly distinguishable outputs. This problem may be viewed as an abstraction of the following problem: given two physical processes described by sequences of local interactions, are the processes effectively the same or are they different? We prove that this problem is a complete promise problem for the class QIP of problems having quantum interactive proof systems, and is therefore PSPACE-hard. This is in sharp contrast to the fact that the analogous problem for classical (probabilistic) circuits is in AM, and for unitary quantum circuits is in QMA.
Rosgen Bill
Watrous John
No associations
LandOfFree
On the hardness of distinguishing mixed-state 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 On the hardness of distinguishing mixed-state quantum computations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the hardness of distinguishing mixed-state quantum computations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-246176