LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Relations among k-ME concurrence, negativity, polynomial invariants, and tangle

Photo by toxilicity from unsplash

The k-ME concurrence as a measure of multipartite entanglement (ME) unambiguously detects all k-nonseparable states in arbitrary dimensions and satisfies many important properties of an entanglement measure. Negativity is a… Click to show full abstract

The k-ME concurrence as a measure of multipartite entanglement (ME) unambiguously detects all k-nonseparable states in arbitrary dimensions and satisfies many important properties of an entanglement measure. Negativity is a simple computable bipartite entanglement measure. Invariant and tangle are useful tools to study the properties of the quantum states. In this paper, we mainly investigate the internal relations among the k-ME concurrence, negativity, polynomial invariants, and tangle. Strong links between k-ME concurrence and negativity as well as between k-ME concurrence and polynomial invariants are derived. We obtain the quantitative relation between k-ME $$(k=n)$$(k=n) concurrence and negativity for all n-qubit states, give an exact value of the n-ME concurrence for the mixture of n-qubit GHZ states and white noise, and derive an connection between k-ME concurrence and tangle for n-qubit W state. Moreover, we find that for any 3-qubit pure state the k-ME concurrence $$(k=2, 3)$$(k=2,3) is related to negativity, tangle, and polynomial invariants, while for 4-qubit states the relations between k-ME concurrence (for $$k = 2, 4)$$k=2,4) and negativity, and between k-ME concurrence and polynomial invariants also exist. Our work provides clear quantitative connections between k-ME concurrence and negativity, and between k-ME concurrence and polynomial invariants.

Keywords: concurrence negativity; among concurrence; relations among; concurrence; polynomial invariants; negativity

Journal Title: Quantum Information Processing
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.