Distinguishing Bipartitite Orthogonal States using LOCC: Best and Worst Cases

Details Distinguishing Bipartitite Orthogonal States using LOCC: Best and Worst Cases Distinguishing Bipartitite Orthogonal States using LOCC: Best and Worst Cases

2004-11-15

arxiv.org/abs/quant-ph/0411110v2

J. Math. Phys. 46, 062103 (2005)

Physics

Quantum Physics

22 pages, published version. Some proofs rewritten for clarity

Scientific paper

10.1063/1.1914731

Two types of results are presented for distinguishing pure bipartite quantum states using Local Operations and Classical Communications. We examine sets of states that can be perfectly distinguished, in particular showing that any three orthogonal maximally entangled states in C^3 tensor C^3 form such a set. In cases where orthogonal states cannot be distinguished, we obtain upper bounds for the probability of error using LOCC taken over all sets of k orthogonal states in C^n tensor C^m. In the process of proving these bounds, we identify some sets of orthogonal states for which perfect distinguishability is not possible.

Affiliated with

Also associated with

No associations

Rating

Distinguishing Bipartitite Orthogonal States using LOCC: Best and Worst Cases 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 Distinguishing Bipartitite Orthogonal States using LOCC: Best and Worst Cases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distinguishing Bipartitite Orthogonal States using LOCC: Best and Worst Cases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-212759