We construct a class of algebraic invariants for N -qubit pure states based on bipartite decompositions of the system. We show that they are entanglement monotones, and that they differ from the well-known linear entropies of the sub-systems. They therefore capture new information on the non-local properties of multipartite systems.
The concept of negativity font, a basic unit of multipartite entanglement, is introduced. Transformation properties of determinants of negativity fonts under local unitary (LU) transformations are exploited to obtain relevant N-qubit polynomial invariants and construct entanglement monotones from first principles. It is shown that entanglement monotones that detect the entanglement of specific parts of the composite system may be constructed to distinguish between states with distinct types of entanglement. The structural difference between entanglement monotones for an odd and even number of qubits is brought out.
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 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.
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.
We introduce new entanglement monotones which generalize, to the case of many parties, those which give rise to the majorization-based partial ordering of bipartite states' entanglement. We give some examples of restrictions they impose on deterministic and probabilistic conversion between multipartite states via local actions and classical communication. These include restrictions which do not follow from any bipartite considerations. We derive supermultiplicativity relations between each state's monotones and the monotones for collective processing when the parties share several states. We also investigate polynomial invariants under local unitary transformations, and show that a large class of these are invariant under collective unitary processing and also multiplicative, putting restrictions, for example, on the exact conversion of multiple copies of one state to multiple copies of another.
We introduce new entanglement monotones which generalize, to the case of many parties, those which give rise to the majorization-based partial ordering of bipartite states' entanglement. We give some examples of restrictions they impose on deterministic and probabilistic conversion between multipartite states via local actions and classical communication. These include restrictions which do not follow from any bipartite considerations. We derive supermultiplicativity relations between each state's monotones and the monotones for collective processing when the parties share several states. We also investigate polynomial invariants under local unitary transformations, and show that a large class of these are invariant under collective unitary processing and also multiplicative, putting restrictions, for example, on the exact conversion of multiple copies of one state to multiple copies of another.