2013/01/31 by Ming-Liang Hu, Ming‐Liang Hu, Heng Fan
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Bipartite graph #Discrete mathematics #Mathematical analysis #Mathematics #Neural Networks and Reservoir Computing #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum discord #Quantum entanglement #Quantum mechanics #Quantum state #State (computer science) #Statistical physics #Upper and lower bounds #math-ph #math.MP #quant-ph
paper · pdf · doi:10.1103/physreva.88.014105
published as Phys. Rev. A 88, 014105 (2013) · 5 pages, 1 figure, the final version as that published in Phys. Rev. A
openalex publication_date 2013/07/29 · arxiv created 2013/07/30 · arxiv updated 2013/07/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
By using the quantum-memory-assisted entropic uncertainty relation (EUR), we derive a computable tight upper bound for quantum discord, which applies to an arbitrary bipartite state. Detailed examples show that this upper bound is tighter than other known bounds in a wide regime. Furthermore, we show that for any tripartite pure state, the quantum-memory-assisted EUR imposes a constraint on the shareability of quantum correlations among the constituent parties. This conclusion amends the well-accepted result that quantum discord is not monogamous.