Entanglement is Not Necessary for Perfect Discrimination between Unitary Operations

Runyao Duan, Yuan Feng, and Mingsheng Ying

Phys. Rev. Lett. 98, 100503 – Published 9 March 2007; Erratum Phys. Rev. Lett. 98, 129901 (2007)

Abstract

We show that a unitary operation (quantum circuit) secretly 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 are 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.

Received 21 February 2006
Corrected 12 March 2007

DOI:https://doi.org/10.1103/PhysRevLett.98.100503

Corrections

12 March 2007

Erratum

Publisher’s Note: Entanglement is Not Necessary for Perfect Discrimination between Unitary Operations [Phys. Rev. Lett.PRLTAO0031-9007 98, 100503 (2007)]

Runyao Duan, Yuan Feng, and Mingsheng Ying

Phys. Rev. Lett. 98, 129901 (2007)

Authors & Affiliations

Runyao Duan^*, Yuan Feng^†, and Mingsheng Ying^‡

State Key Laboratory of Intelligent Technology and Systems, Department of Computer Science and Technology, Tsinghua University, Beijing, China, 100084

^*Electronic address: dry@tsinghua.edu.cn
^†Electronic address: feng-y@tsinghua.edu.cn
^‡Electronic address: yingmsh@tsinghua.edu.cn

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand

Issue

Vol. 98, Iss. 10 — 9 March 2007

Reuse & Permissions

Access Options

Author publication services for translation and copyediting assistance advertisement

Physical Review Letters