On the hardness of distinguishing mixed-state quantum computations

This paper considers the following problem. Two mixed-state quantum circuits Q₀ and Q₁ are given, and the goal is to determine which of two possibilities holds: (i) Q₀ and Q₁ act nearly identically on all possible quantum state inputs, or (ii) there exists some input state ρ that Q₀ and Q₁ transform into almost perfectly distinguishable outputs. This may be viewed as an abstraction of the problem that asks, given two discrete quantum mechanical processes described by sequences of local interactions, are the processes effectively the same or are they different? We prove that this promise problem is complete for the class QIP of problems having quantum interactive proof systems, and is therefore PSPACE-hard. This is in contrast to the fact that the analogous problem for classical (probabilistic) circuits is in AM, and for unitary quantum circuits is in QMA.