2010/10/31 by Maciej Demianowicz
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Concurrence #Factorization #Mathematical physics #Mathematics #Monotone polygon #Observable #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Qubit #State (computer science) #Statistical physics #Theoretical physics #quant-ph
paper · pdf · doi:10.1103/physreva.83.034301
published as Phys. Rev. A 83, 034301 (2011) · improved v3, journal ref. added
openalex publication_date 2011/03/03 · arxiv created 2011/06/22 · arxiv updated 2015/05/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
It was shown in Augusiak et al. [Phys. Rev. A 77, 030301(R) (2008)] that discrimination between entanglement and separability in a two-qubit state can be achieved by a measurement of a single observable on four copies of it. Moreover, a pseudoentanglement monotone \ensuremathπ was proposed to quantify entanglement in such states. The main goal of this Brief Report is to show that the close relationship between \ensuremathπ and concurrence reported there is a result of sharing the same underlying construction of a spin-flipped matrix. We also show that monogamy of entanglement can be rephrased in terms of \ensuremathπ and prove the factorization law for \ensuremathπ.