Concurrence of assistance and Mermin inequality on three-qubit pure states

2009/09/29 by Dong Pyo, Dong Pyo Chi, Kabgyun Jeong +5
Computer Science · Mathematics · Physics and Astronomy · #Concurrence #Inequality #Mathematical analysis #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Qubit #quant-ph

paper · pdf · doi:10.1103/physreva.81.044302

published as Phys. Rev. A 81, 044302 (2010). · 4 pages, 1 figure

arxiv created 2009/09/29 · openalex publication_date 2010/04/08 · arxiv updated 2015/05/14 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05

Abstract

We study a relation between the concurrence of assistance and the Mermin inequality on three-qubit pure states and claim that if a three-qubit pure state has a minimal concurrence of assistance greater than 1/2 then the state violates some Mermin inequality. In this work, we analytically show that our claim holds for several classes and also find that it can be generalized to the set of all three-qubit pure states by exploiting previous numerical work [C. Emary and C. W. J. Beenakker, Phys. Rev. A 69, 032317 (2004)].

Citations

• Three qubits can be entangled in two inequivalent ways
• Do all pure entangled states violate Bell's inequalities for correlation functions?
• Gisin's Theorem for Three Qubits
• Entanglement of Formation of an Arbitrary State of Two Qubits
• Monogamy equality in 2⊗2⊗d quantum systems
• Deterministic entanglement of assistance and monogamy constraints
• Relation between entanglement measures and Bell inequalities for three qubits
• Generalized Schmidt Decomposition and Classification of Three-Quantum-Bit States
• Distributed Entanglement