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

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

11 pages; v2: Journal version; Minor errors fixed in Section IV

Scientific paper

10.1007/s00220-008-0582-6

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the Chernoff distance for asymptotic LOCC discrimination of bipartite quantum states does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Chernoff distance for asymptotic LOCC discrimination of bipartite quantum states, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Chernoff distance for asymptotic LOCC discrimination of bipartite quantum states will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-358515

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.