Distinguishability of Bell States

2001/06/30 by Sibasish Ghosh, Guruprasad Kar, Anirban Roy +3 · 5 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Artificial intelligence #Bell state #Bell's theorem #Class (philosophy) #Combinatorics #Computer science #LOCC #Mathematics #Multipartite #Multipartite entanglement #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum channel #Quantum entanglement #Quantum mechanics #Quantum teleportation #Squashed entanglement #State (computer science) #quant-ph

paper · pdf · doi:10.1103/physrevlett.87.277902

3 Pages Latex, references added, minor changes

arxiv created 2001/07/03 · openalex publication_date 2001/12/13 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

More than two multipartite orthogonal states cannot always be discriminated if only local operations and classical communication (LOCC) are allowed. We show that four Bell states cannot be discriminated by LOCC, even probabilistically, using the separability properties of a four-party unlockable bound entangled state. Using an existing inequality among the measures of entanglement, we show that any three Bell states cannot be discriminated with certainty by LOCC. Exploiting the inequality, we calculate the distillable entanglement of a certain class of 4 multiply sign in circle 4 mixed states.

Citations

• A single quantum cannot be cloned
• Communication by EPR devices
• Quantifying Entanglement

Cited by

• Discrimination of genuinely nonlocal sets without entanglement in multipartite systems
• On small set of one-way LOCC indistinguishability of maximally entangled states
• Locally distinguishing unextendible product bases by using entanglement efficiently
• When is the Chernoff Exponent for Quantum Operations Finite?
• Asymptotically perfect discrimination in the local-operation-and-classical-communication paradigm