2002/01/31 by Michael Seevinck, George Svetlichny · 3 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1103/physrevlett.89.060401
published as Phys. Rev. Lett. 89, 060401 (2002) · 4 pages, Published by Physical Review Letters. Final version
openalex publication_date 2002/07/18 · arxiv created 2002/07/26 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
We derive N-particle Bell-type inequalities under the assumption of partial separability, i.e., that the N-particle system is composed of subsystems which may be correlated in any way (e.g., entangled) but which are uncorrelated with respect to each other. These inequalities provide, upon violation, experi-mentally accessible sufficient conditions for full N-particle entanglement, i.e., for N-particle entanglement that cannot be reduced to mixtures of states in which a smaller number of particles are entangled. The inequalities are shown to be maximally violated by the N-particle Greenberger-Horne-Zeilinger states.