Perfect Distinguishability of Quantum Operations

Runyao Duan, Yuan Feng, and Mingsheng Ying

Phys. Rev. Lett. 103, 210501 – Published 20 November 2009

Abstract

We provide a feasible necessary and sufficient condition for when an unknown quantum operation (quantum device) secretly selected from a set of known quantum operations can be identified perfectly within a finite number of queries, and thus complete the characterization of the perfect distinguishability of quantum operations. We further design an optimal protocol which can achieve the perfect discrimination between two quantum operations by a minimal number of queries. Interestingly, we find that an optimal perfect discrimination between two isometries is always achievable without auxiliary systems or entanglement.

Received 7 August 2009

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

Authors & Affiliations

Runyao Duan^*, Yuan Feng, and Mingsheng Ying

State Key Laboratory of Intelligent Technology and Systems, Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China and Centre for Quantum Computation and Intelligent Systems (QCIS), Faculty of Engineering and Information Technology, University of Technology, Sydney, New South Wales 2007, Australia

^*Runyao.Duan@uts.edu.au

Article Text (Subscription Required)

Click to Expand

Supplemental Material (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand

Issue

Vol. 103, Iss. 21 — 20 November 2009

Reuse & Permissions

Access Options

Author publication services for translation and copyediting assistance advertisement

Physical Review Letters