Mathematical nature of and a family of lower bounds for the success probability of unambiguous discrimination

Sun, X; Zhang, S; Feng, Y; Ying, M

Mathematical nature of and a family of lower bounds for the success probability of unambiguous discrimination

Sun, X Zhang, S Feng, Y

Ying, M

Permalink

Publication Type:: Journal Article
Citation:: Physical Review A - Atomic, Molecular, and Optical Physics, 2002, 65 (4), pp. 3 - ?
Issue Date:: 2002-01-01

Closed Access

	Filename	Description	Size
	2008004804OK.pdf		49.06 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	Sun, X	en_US
dc.contributor.author	Zhang, S	en_US
dc.contributor.author	Feng, Y https://orcid.org/0000-0002-3097-3896	en_US
dc.contributor.author	Ying, M https://orcid.org/0000-0003-4847-702X	en_US
dc.date.issued	2002-01-01	en_US
dc.identifier.citation	Physical Review A - Atomic, Molecular, and Optical Physics, 2002, 65 (4), pp. 3 - ?	en_US
dc.identifier.issn	1050-2947	en_US
dc.identifier.uri	http://hdl.handle.net/10453/9085
dc.description.abstract	Unambiguous discrimination is a strategy to the discrimination problem that identifies the state with certainty, leaving a possibility of undecidability. This paper points out that the optimal success probability of unambiguous discrimination is mathematically the well-known semidefinite programming problem. A family of lower bounds of the optimal success probability is also given. © 2002 The American Physical Society.	en_US
dc.relation.ispartof	Physical Review A - Atomic, Molecular, and Optical Physics	en_US
dc.relation.isbasedon	10.1103/PhysRevA.65.044306	en_US
dc.subject.classification	General Physics	en_US
dc.title	Mathematical nature of and a family of lower bounds for the success probability of unambiguous discrimination	en_US
dc.type	Journal Article
utslib.citation.volume	4	en_US
utslib.citation.volume	65	en_US
utslib.for	080604 Database Management	en_US
utslib.for	01 Mathematical Sciences	en_US
utslib.for	02 Physical Sciences	en_US
utslib.for	03 Chemical Sciences	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	closed_access
pubs.issue	4	en_US
pubs.publication-status	Published	en_US
pubs.volume	65	en_US

Abstract:

Unambiguous discrimination is a strategy to the discrimination problem that identifies the state with certainty, leaving a possibility of undecidability. This paper points out that the optimal success probability of unambiguous discrimination is mathematically the well-known semidefinite programming problem. A family of lower bounds of the optimal success probability is also given. © 2002 The American Physical Society.

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

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