Limitations on Separable Measurements by Convex Optimization

DOI10.1109/TIT.2015.2417755MaRDI QIDQ2978595zbMATH OpenFDO

Authors Alessandro Cosentino, Nathaniel Johnston, Vincent F. Russo, John Watrous, Nengkun Yu, Somshubhro Bandyopadhyay

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1408.6981

Mathematics Subject Classification ID

Convex programming (90C25) Information theory (general) (94A15)

Abstract: 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.

Cited in

(14)

• Local discrimination of qudit lattice states
• Nonlocality without entanglement: an acyclic configuration
• Construction of noisy bound entangled states and the range criterion
• Nonlocality of tripartite orthogonal product states
• Locally distinguishing multipartite orthogonal product states with different entanglement resource
• Positive tensor products of maps and n-tensor-stable positive qubit maps
• LOCC protocols with bounded width per round optimize convex functions
• Entanglement witness and multipartite quantum state discrimination
• Discrimination of quantum states under locality constraints in the many-copy setting
• More assistance of entanglement, less rounds of classical communication
• Local discrimination of lattice states via adjacent matrix
• Local distinguishability of lattice states in arbitrary dimensional system
• Locally distinguishing nonlocal orthogonal product states with entanglement as a universal auxiliary resource
• Optimizing entanglement manipulation via algebraic-geometric decompositions and semi-definite programming hierarchies

This page was built for publication: Limitations on Separable Measurements by Convex Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978595)