Statistical Distinguishability between Unitary Operations

The problem of distinguishing two unitary transformations, or quantum gates, is analyzed and a function reflecting their statistical distinguishability is found. Given two unitary operations, U1 and U2, it is proved that there always exists a finite number N such that U(x in circle N)(1) and U(x in circle N)(2) are perfectly distinguishable, although they were not in the single-copy case. This result can be extended to any finite set of unitary transformations. Finally, a fidelity for one-qubit gates, which satisfies many useful properties from the point of view of quantum information theory, is presented.