Perfect Distinguishability of Quantum Operations

Duan, R; Feng, Y; Ying, M

Perfect Distinguishability of Quantum Operations

Duan, R Feng, Y Ying, M

Permalink

Publisher:: The American Physical Society
Publication Type:: Journal Article
Citation:: Duan Runyao, Feng Yuan, and Ying Mingsheng 2009, 'Perfect Distinguishability of Quantum Operations', The American Physical Society, vol. 103, no. 21, pp. 210501-1-210501-4.
Issue Date:: 2009

Closed Access

	Filename	Description	Size
	2009001742OK.pdf		152.24 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Duan, R	en_US
dc.contributor.author	Feng, Y	en_US
dc.contributor.author	Ying, M	en_US
dc.date.accessioned	2010-05-28T09:42:53Z
dc.date.available	2010-05-28T09:42:53Z
dc.date.issued	2009	en_US
dc.identifier	2009001742	en_US
dc.identifier.citation	Duan Runyao, Feng Yuan, and Ying Mingsheng 2009, 'Perfect Distinguishability of Quantum Operations', The American Physical Society, vol. 103, no. 21, pp. 210501-1-210501-4.	en_US
dc.identifier.issn	0031-9007	en_US
dc.identifier.other	C1	en_US
dc.identifier.uri	http://hdl.handle.net/10453/8390
dc.description.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.	en_US
dc.language	English	en_US
dc.publisher	The American Physical Society	en_US
dc.relation.ispartof	Physical Review Letters	en_US
dc.relation.ispartof	Verified OK	en_US
dc.relation.isbasedon	http://dx.doi.org/10.1103/PhysRevLett.103.210501	en_US
dc.subject	quantum operations, perfect distinguishability, entanglement, maximal fidelity, numerical range	en_US
dc.subject.classification	Computation Theory and Mathematics	en_US
dc.title	Perfect Distinguishability of Quantum Operations	en_US
dc.type	Journal article
utslib.citation.volume	103	en_US
utslib.citation.number	21	en_US
utslib.location	New York, USA	en_US
utslib.citation.startpage	210501-1	en_US
utslib.citation.endpage	210501-4	en_US
utslib.identifier.org	FEIT.Faculty of Engineering & Information Technology	en_US
utslib.for	080200	en_US
utslib.percentage	67	en_US
utslib.copyright.status	closed_access

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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/8390