Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0106042 · Physical Review A

Properties of entanglement monotones for three-qubit pure states

Robert M. Gingrich

Published Apr 15, 2002• 29 citations
arXivHTMLPDF

Abstract

Various parametrizations for the orbits under local unitary transformations of three-qubit pure states are analyzed. The interconvertibility, symmetry properties, parameter ranges, calculability, and behavior under measurement are looked at. It is shown that the entanglement monotones of any multipartite pure state uniquely determine the orbit of that state under local unitary transformations. It follows that there must be an entanglement monotone for three-qubit pure states which depends on the Kempe invariant defined in Phys. Rev. A 60, 910 (1999). A form for such an entanglement monotone is proposed. A theorem is proved that significantly reduces the number of entanglement monotones that must be looked at to find the maximal probability of transforming one multipartite state to another.

DOI
10.1103/physreva.65.052302

Related papers

Entanglement of multipartite quantum states and the generalized quantum search

Robert M. Gingrich

In chapter 2 various parameterizations for the orbits under local unitary transformations of three-qubit pure states are analyzed. It is shown that the entanglement monotones of any multipartite pure state uniquely determine the orbit of that state. It follows that there must be an entanglement monotone for three-qubit pure states which depends on the Kempe invariant defined in [1]. A form for such an entanglement monotone is proposed. A theorem is proved that significantly reduces the number of entanglement monotones that must be looked at to find the maximal probability of transforming one multipartite state to another. In chapter 3 Grover's unstructured quantum search algorithm is generalized to use an arbitrary starting superposition and an arbitrary unitary matrix. A formula for the probability of the generalized Grover's algorithm succeeding after n iterations is derived. This formula is used to determine the optimal strategy for using the unstructured quantum search algorithm. The speedup obtained illustrates that a hybrid use of quantum computing and classical computing techniques can yield a performance that is better than either alone. The analysis is extended to the case of a society of k quantum searches acting in parallel. In chapter 4 the positive map Г : p → (Trρ) - ρ is introduced as a separability criterion. Any separable state is mapped by the tensor product of Г and the identity in to a non-negative operator, which provides a necessary condition for separability. If Г acts on a two-dimensional subsystem, then it is equivalent to partial transposition and therefore also sufficient for 2 x 2 and 2 x 3 systems. Finally, a connection between this map for two qubits and complex conjugation in the magic basis [2] is displayed.

•Sep 1, 2002•0 citations

Multi-partite entanglement monotones

Abhijit Gadde, Shraiyance Jain, Harshal Kulkarni

If we want to transform the quantum state of a system to another using local measurement processes, what is the probability of success? This probability is bounded by quantifying entanglement in both the states. In this paper, we construct a family of local unitary invariants of multipartite states that are monotonic under local operations and classical communication on average. These monotones are constructed from local unitary invariant polynomials of the state and its conjugate, and hence are easy to compute for pure states. Using these measures we bound the success probability of transforming a given state into another state using local quantum operations and classical communication.

arXiv:2406.17447•SciPost Physics•Mar 18, 2026•0 citations

Permutation-invariant monotones for multipartite entanglement characterization

Xi-Jun Ren, Wei Jiang, Xingxiang Zhou +2 more

In this work we consider the permutational properties of multipartite entanglement monotones. Based on the fact that genuine multipartite entanglement is a property of the entire multiqubit system, we argue that ideal definitions for its characterizing quantities must be permutation invariant. Using this criterion, we examine the three four-qubit entanglement monotones introduced by Osterloh and Siewert [Phys. Rev. A 72, 012337 (2005)]. By expressing them in terms of quantities whose permutational properties can be easily derived, we find that one of these monotones is not permutation invariant. We propose a permutation-invariant entanglement monotone to replace it, and show that our new monotone properly measures the genuine four-qubit entanglement in four-qubit cluster-class states. Our results provide some useful insights in understanding multipartite entanglement.

arXiv:0804.3461•Physical Review A•Jul 23, 2008•12 citations

Local unitary equivalence and entanglement of multipartite pure states

Barbara Kraus

The necessary and sufficient conditions for the equivalence of arbitrary $n$-qubit pure quantum states under local unitary (LU) operations derived in [B. Kraus, Phys. Rev. Lett. 104, 020504 (2010)] are used to determine the different LU-equivalence classes of up to five-qubit states. Due to this classification new parameters characterizing multipartite entanglement are found and their physical interpretation is given. Moreover, the method is used to derive examples of two $n$-qubit states (with $n>2$ arbitrary) which have the properties that all the entropies of any subsystem coincide; however, the states are neither LU equivalent nor can be mapped into each other by general local operations and classical communication.

arXiv:1005.5295•Physical Review A•Sep 30, 2010•85 citations

Multipartite-entanglement monotones and polynomial invariants

Christopher Eltschka, Thierry Bastin, Andreas Osterloh +1 more

We show that a positive homogeneous function that is invariant under determinant-1 stochastic local operations and classical communication (SLOCC) transformations defines an $N$-qubit entanglement monotone if and only if the homogeneous degree is not larger than 4. We then describe a common basis and formalism for the $N$-tangle and other known invariant polynomials of degree 4. This allows us to elucidate the relation of the four-qubit invariants defined by Luque and Thibon [Phys. Rev. A 67, 042303 (2003)] and the reduced two-qubit density matrices of the states under consideration, thus giving a physical interpretation for those invariants. We demonstrate that this is a special case of a completely general law that holds for any multipartite system with bipartitions of equal dimension, e.g., for an even number of qudits.

arXiv:1105.1556•Physical Review A•Feb 3, 2012•38 citations

Infinitesimal local operations and differential conditions for entanglement monotones

Ognyan Oreshkov, Todd A. Brun

Much of the theory of entanglement concerns the transformations that are possible to a state under local operations with classical communication (LOCC); however, this set of operations is complicated and difficult to describe mathematically. An idea which has proven very useful is that of the entanglement monotone: a function of the state which is invariant under local unitary transformations and always decreases (or increases) on average after any local operation. In this paper we look on LOCC as the set of operations generated by infinitesimal local operations, operations which can be performed locally and which leave the state little changed. We show that a necessary and sufficient condition for a function of the state to be an entanglement monotone under local operations that do not involve information loss is that the function be a monotone under infinitesimal local operations. We then derive necessary and sufficient differential conditions for a function of the state to be an entanglement monotone. We first derive two conditions for local operations without information loss, and then show that they can be extended to more general operations by adding the requirement of convexity. We then demonstrate that a number of known entanglement monotones satisfy these differential criteria. Finally, as an application, we use the differential conditions to construct a new polynomial entanglement monotone for three-qubit pure states. It is our hope that this approach will avoid some of the difficulties in the theory of multipartite and mixed-state entanglement.

arXiv:quant-ph/0506181•Physical Review A•Apr 13, 2006•6 citations
Various parametrizations for the orbits under local unitary transformations of three-qubit pure states are analyzed. The interconvertibility, symmetry properties, parameter ranges, calculability, and behavior under measurement are looked at. It is shown that the entanglement monotones of any multipartite pure state uniquely determine the orbit of that state under local unitary transformations. It follows that there must be an entanglement monotone for three-qubit pure states which depends on the Kempe invariant defined in Phys. Rev. A 60, 910 (1999). A form for such an entanglement monotone is proposed. A theorem is proved that significantly reduces the number of entanglement monotones that must be looked at to find the maximal probability of transforming one multipartite state to another.
In chapter 2 various parameterizations for the orbits under local unitary transformations of three-qubit pure states are analyzed. It is shown that the entanglement monotones of any multipartite pure state uniquely determine the orbit of that state. It follows that there must be an entanglement monotone for three-qubit pure states which depends on the Kempe invariant defined in [1]. A form for such an entanglement monotone is proposed. A theorem is proved that significantly reduces the number of entanglement monotones that must be looked at to find the maximal probability of transforming one multipartite state to another. In chapter 3 Grover's unstructured quantum search algorithm is generalized to use an arbitrary starting superposition and an arbitrary unitary matrix. A formula for the probability of the generalized Grover's algorithm succeeding after n iterations is derived. This formula is used to determine the optimal strategy for using the unstructured quantum search algorithm. The speedup obtained illustrates that a hybrid use of quantum computing and classical computing techniques can yield a performance that is better than either alone. The analysis is extended to the case of a society of k quantum searches acting in parallel. In chapter 4 the positive map Г : p → (Trρ) - ρ is introduced as a separability criterion. Any separable state is mapped by the tensor product of Г and the identity in to a non-negative operator, which provides a necessary condition for separability. If Г acts on a two-dimensional subsystem, then it is equivalent to partial transposition and therefore also sufficient for 2 x 2 and 2 x 3 systems. Finally, a connection between this map for two qubits and complex conjugation in the magic basis [2] is displayed.
If we want to transform the quantum state of a system to another using local measurement processes, what is the probability of success? This probability is bounded by quantifying entanglement in both the states. In this paper, we construct a family of local unitary invariants of multipartite states that are monotonic under local operations and classical communication on average. These monotones are constructed from local unitary invariant polynomials of the state and its conjugate, and hence are easy to compute for pure states. Using these measures we bound the success probability of transforming a given state into another state using local quantum operations and classical communication.
In this work we consider the permutational properties of multipartite entanglement monotones. Based on the fact that genuine multipartite entanglement is a property of the entire multiqubit system, we argue that ideal definitions for its characterizing quantities must be permutation invariant. Using this criterion, we examine the three four-qubit entanglement monotones introduced by Osterloh and Siewert [Phys. Rev. A 72, 012337 (2005)]. By expressing them in terms of quantities whose permutational properties can be easily derived, we find that one of these monotones is not permutation invariant. We propose a permutation-invariant entanglement monotone to replace it, and show that our new monotone properly measures the genuine four-qubit entanglement in four-qubit cluster-class states. Our results provide some useful insights in understanding multipartite entanglement.
The necessary and sufficient conditions for the equivalence of arbitrary nnn-qubit pure quantum states under local unitary (LU) operations derived in [B. Kraus, Phys. Rev. Lett. 104, 020504 (2010)] are used to determine the different LU-equivalence classes of up to five-qubit states. Due to this classification new parameters characterizing multipartite entanglement are found and their physical interpretation is given. Moreover, the method is used to derive examples of two nnn-qubit states (with n>2n>2n>2 arbitrary) which have the properties that all the entropies of any subsystem coincide; however, the states are neither LU equivalent nor can be mapped into each other by general local operations and classical communication.
We show that a positive homogeneous function that is invariant under determinant-1 stochastic local operations and classical communication (SLOCC) transformations defines an NNN-qubit entanglement monotone if and only if the homogeneous degree is not larger than 4. We then describe a common basis and formalism for the NNN-tangle and other known invariant polynomials of degree 4. This allows us to elucidate the relation of the four-qubit invariants defined by Luque and Thibon [Phys. Rev. A 67, 042303 (2003)] and the reduced two-qubit density matrices of the states under consideration, thus giving a physical interpretation for those invariants. We demonstrate that this is a special case of a completely general law that holds for any multipartite system with bipartitions of equal dimension, e.g., for an even number of qudits.
Much of the theory of entanglement concerns the transformations that are possible to a state under local operations with classical communication (LOCC); however, this set of operations is complicated and difficult to describe mathematically. An idea which has proven very useful is that of the entanglement monotone: a function of the state which is invariant under local unitary transformations and always decreases (or increases) on average after any local operation. In this paper we look on LOCC as the set of operations generated by infinitesimal local operations, operations which can be performed locally and which leave the state little changed. We show that a necessary and sufficient condition for a function of the state to be an entanglement monotone under local operations that do not involve information loss is that the function be a monotone under infinitesimal local operations. We then derive necessary and sufficient differential conditions for a function of the state to be an entanglement monotone. We first derive two conditions for local operations without information loss, and then show that they can be extended to more general operations by adding the requirement of convexity. We then demonstrate that a number of known entanglement monotones satisfy these differential criteria. Finally, as an application, we use the differential conditions to construct a new polynomial entanglement monotone for three-qubit pure states. It is our hope that this approach will avoid some of the difficulties in the theory of multipartite and mixed-state entanglement.