Simple permutation-based measure of quantum correlations and maximally-3-tangled states
Udaysinh T. Bhosale, Arul Lakshminarayan

TL;DR
This paper introduces a simple permutation-based measure of quantum correlations, $R_{12}$, which detects entanglement and relates to three-qubit entanglement measures, providing bounds and insights into multipartite entanglement structures.
Contribution
It proposes a new, simple invariant quantity $R_{12}$ based on permutations of the density matrix, linking bipartite and tripartite entanglement measures and establishing bounds on concurrence and negativity.
Findings
$R_{12}$ vanishes on many separable states and peaks for maximally entangled states.
States satisfying bounds on $R_{12}$ maximize tripartite entanglement (3-tangle) for given bipartite entanglement.
Numerical evidence suggests $R_{12}$ is always larger than concurrence and negativity, especially for $X$ states.
Abstract
Quantities invariant under local unitary transformations are of natural interest in the study of entanglement. This paper deduces and studies a particularly simple quantity that is constructed from a combination of two standard permutations of the density matrix, namely realignment and partial transpose. This bipartite quantity, denoted here as , vanishes on large classes of separable states including classical-quantum correlated states, while being maximum for only maximally entangled states. It is shown to be naturally related to the 3-tangle in three qubit states via their two-qubit reduced density matrices. Upper and lower bounds on concurrence and negativity of two-qubit density matrices for all ranks are given in terms of . Ansatz states satisfying these bounds are given and verified using various numerical methods. In rank-2 case it is shown that the states…
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.
