Tuesday, August 6, 2013

1308.0707 (Tao Zhou)

A universal programmable discriminator can perform the discrimination between two unknown states, and the optimal solution can be approached via the discrimination between the two averages over the uniformly distributed unknown input pure states, which has been widely discussed in previous works. In this paper, we consider the success probabilities of the optimal universal programmable unambiguous discriminators when applied to the pure input states. More precisely, the analytic results of the success probabilities are derived with the representation theory of U(d) group and angular momentum theory, and we find that the success probabilities have nothing to do with the dimension d while the amounts of the copies in the two program registers are equal.

Followers

About CPR

A site to capture the informal process of peer review that happens daily in academia. This is intended to be a useful resource for authors, referees, and editors of journals to optimize their publications based on input from the accumulated expertise of their community.