On the Chernoff distance for asymptotic LOCC discrimination of bipartite quantum states

From MaRDI portal
Publication:657932

DOI10.1007/S00220-008-0582-6zbMATH Open1228.81117arXiv0710.4113OpenAlexW3103649244WikidataQ57522135 ScholiaQ57522135MaRDI QIDQ657932FDOQ657932

William Matthews, Andreas Winter

Publication date: 11 January 2012

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Abstract: Motivated by the recent discovery of a quantum Chernoff theorem for asymptotic state discrimination, we investigate the distinguishability of two bipartite mixed states under the constraint of local operations and classical communication (LOCC), in the limit of many copies. While for two pure states a result of Walgate et al. shows that LOCC is just as powerful as global measurements, data hiding states (DiVincenzo et al.) show that locality can impose severe restrictions on the distinguishability of even orthogonal states. Here we determine the optimal error probability and measurement to discriminate many copies of particular data hiding states (extremal d x d Werner states) by a linear programming approach. Surprisingly, the single-copy optimal measurement remains optimal for n copies, in the sense that the best strategy is measuring each copy separately, followed by a simple classical decision rule. We also put a lower bound on the bias with which states can be distinguished by separable operations.


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




Recommendations



Cites Work


Cited In (12)





This page was built for publication: On the Chernoff distance for asymptotic LOCC discrimination of bipartite quantum states

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