Entanglement Is Not Necessary for Perfect Discrimination between Unitary Operations

Abstract

We show that a unitary operation (quantum circuit) secretely chosen from a finite set of unitary operations can be determined with certainty by sequentially applying only a finite amount of runs of the unknown circuit. No entanglement or joint quantum operations is required in our scheme. We further show that our scheme is optimal in the sense that the number of the runs is minimal when discriminating only two unitary operations.

4 pages(in Revtex4), 2 figures (eps). Corrected some typos and two equations. Main results unchanged. Essentially the journal version