On a Block Matrix Inequality quantifying the Monogamy of the Negativity of Entanglement
Koenraad M.R. Audenaert

TL;DR
This paper converts a conjectured quantum information inequality into a block matrix form and proves it for a special case, advancing understanding of entanglement monogamy related to negativity.
Contribution
It reformulates a quantum inequality as a block matrix inequality and proves it for the case n=2 with one matrix as the identity, providing a partial proof of the conjecture.
Findings
Proved the block matrix inequality for n=2 with A_1 as identity.
Connected the inequality to the monogamy of negativity in entanglement.
Extended the understanding of matrix inequalities in quantum information theory.
Abstract
We convert a conjectured inequality from quantum information theory, due to He and Vidal, into a block matrix inequality and prove a special case. Given matrices , , of the same size, let and be the block matrices and . Then the conjectured inequality is \[ \left(||Z_1||_1-\trace Z_1\right)^2 + \left(||Z_2||_1-\trace Z_2\right)^2 \le \left(\sum_{i\neq j} ||A_i||_2 ||A_j||_2\right)^2. \] We prove this inequality for the already challenging case with equal to the identity matrix.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
