Limitations on separable measurements by convex optimization

Bandyopadhyay, S; Cosentino, A; Johnston, N; Russo, V; Watrous, J; Yu, N

Limitations on separable measurements by convex optimization

Bandyopadhyay, S Cosentino, A Johnston, N Russo, V Watrous, J Yu, N

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Information Theory, 2015, 61 (6), pp. 3593 - 3604
Issue Date:: 2015-06-01

Closed Access

	Filename	Description	Size
	07086052.pdf	Published Version	267.77 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	Bandyopadhyay, S	en_US
dc.contributor.author	Cosentino, A	en_US
dc.contributor.author	Johnston, N	en_US
dc.contributor.author	Russo, V	en_US
dc.contributor.author	Watrous, J	en_US
dc.contributor.author	Yu, N https://orcid.org/0000-0003-1188-3032	en_US
dc.date.issued	2015-06-01	en_US
dc.identifier.citation	IEEE Transactions on Information Theory, 2015, 61 (6), pp. 3593 - 3604	en_US
dc.identifier.issn	0018-9448	en_US
dc.identifier.uri	http://hdl.handle.net/10453/119404
dc.description.abstract	© 1963-2012 IEEE. We prove limitations on LOCC and separable measurements in bipartite state discrimination problems using techniques from convex optimization. Specific results that we prove include: an exact formula for the optimal probability of correctly discriminating any set of either three or four Bell states via LOCC or separable measurements when the parties are given an ancillary partially entangled pair of qubits; an easily checkable characterization of when an unextendable product set is perfectly discriminated by separable measurements, along with the first known example of an unextendable product set that cannot be perfectly discriminated by separable measurements; and an optimal bound on the success probability for any LOCC or separable measurement for the recently proposed state discrimination problem of Yu, Duan, and Ying.	en_US
dc.relation.ispartof	IEEE Transactions on Information Theory	en_US
dc.relation.isbasedon	10.1109/TIT.2015.2417755	en_US
dc.subject.classification	Networking & Telecommunications	en_US
dc.title	Limitations on separable measurements by convex optimization	en_US
dc.type	Journal Article
utslib.citation.volume	6	en_US
utslib.citation.volume	61	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	1005 Communications Technologies	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	6	en_US
pubs.publication-status	Published	en_US
pubs.volume	61	en_US

Abstract:

© 1963-2012 IEEE. We prove limitations on LOCC and separable measurements in bipartite state discrimination problems using techniques from convex optimization. Specific results that we prove include: an exact formula for the optimal probability of correctly discriminating any set of either three or four Bell states via LOCC or separable measurements when the parties are given an ancillary partially entangled pair of qubits; an easily checkable characterization of when an unextendable product set is perfectly discriminated by separable measurements, along with the first known example of an unextendable product set that cannot be perfectly discriminated by separable measurements; and an optimal bound on the success probability for any LOCC or separable measurement for the recently proposed state discrimination problem of Yu, Duan, and Ying.

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

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