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:1003.4862 · Physical Review A

Invariant-based entanglement monotones as expectation values and their experimental detection

Andreas Osterloh, Jens Siewert

Published Oct 1, 2012• 17 citations
arXivHTMLPDF

Abstract

Characterization and quantification of multipartite entanglement is one of the challenges in state-of-the-art experiments in quantum-information processing. According to theory, this is achieved via entanglement monotones, that is, functions that do not increase under stochastic local operations and classical communication (SLOCC). Typically such monotones include the wave function and its time reversal (antilinear-operator formalism) or they are based on not completely positive maps (e.g., partial transpose). Therefore, they are not directly accessible to experimental observations. We show how entanglement monotones derived from polynomial local SL$(2,\phantom{\rule{2.40005pt}{0ex}}\mathrm{width}.04\mathrm{em}\mathrm{height}1.46\mathrm{ex}\mathrm{depth}\ensuremath{-}.07\mathrm{ex}\mathrm{C})$ invariants can be re-written in terms of expectation values of observables. Consequently, the amount of entanglement---of specific SLOCC classes---in a given state can be extracted from the measurement of correlation functions of local operators.

DOI
10.1103/physreva.86.042302

Related papers

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

INVARIANT POLYNOMIALS WITH APPLICATIONS TO QUANTUM COMPUTING

Alimzhan Amanov

In quantum information theory, understanding the complexity of entangled states within the context of SLOCC (stochastic local operations and classical communications) involving d qubits (or qudits) is essential for advancing our knowledge of quantum systems. This complexity is often analyzed by classifying the states via local symmetry groups. The resulting classes can be distinguished using invariant polynomials, which serve as a measure of entanglement. This paper introduces a novel method for obtaining invariant polynomials of the smallest degrees, which significantly enhances the efficiency of characterizing SLOCC classes of entangled quantum states. Our method not only simplifies the process of identifying these classes but also provides a robust tool for analyzing the entanglement properties of complex quantum systems. As a practical application, we demonstrate the derivation of minimal degree invariants in specific cases, illustrating the effectiveness of our approach in real-world scenarios. This advancement has the potential to streamline various processes in quantum information theory, making it easier to understand, classify, and utilize entangled states effectively.

Herald of Kazakh-British technical university•Jul 1, 2024•1 citation

Monotones and Invariants for Multi-particle Quantum States

Howard Barnum, Noah Linden

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.

•Jan 1, 2001•140 citations

Monotones and invariants for multi-particle quantum states

H Barnum, N Linden

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.

arXiv:quant-ph/0103155•Journal of Physics A Mathematical and General•Aug 24, 2001•244 citations

On the geometry of a class ofN-qubit entanglement monotones

Péter Lévay

A family of N -qubit entanglement monotones invariant under stochastic local operations and classical communication (SLOCC) is defined. This class of entanglement monotones includes the well-known examples of the concurrence, the 3-tangle and some of the four-, five- and N -qubit SLOCC invariants introduced recently. The construction of these invariants is based on bipartite partitions of the Hilbert space in the form with L = 2 N − n ⩾ l = 2 n . Such partitions can be given a nice geometrical interpretation in terms of Grassmannians Gr ( L , l ) of l -planes in C L that can be realized as the zero locus of quadratic polynomials in the complex projective space of suitable dimension via the Plücker embedding. The invariants are neatly expressed in terms of the Plücker coordinates of the Grassmannians.

arXiv:quant-ph/0507070•Journal of Physics A Mathematical and General•Sep 28, 2005•37 citations

Characterization of multipartite entanglement

Nengkun Yu, Youming Qiao, Xiudong Sun

In this paper, we provide a characterization of multipartite entanglement in terms of equivalence classes of states under local unitary transformation (LU) by demonstrating a simple method to construct all homogenous polynomials that are invariant under local unitary group(LUIPs) for any fixed degree. We give an upper bound on the degree of the LUIP such that the ring of LUIPs can be generated by LUIPs with degree lower than the bound. Our characterization can directly generate an algorithm whose output is a generating set of LUIPs. By employing the concept of LUIPs, we prove that multipartite entanglement is additive in the sense that two multipartite states are LU equivalent if and only if $n$-copies of these two states are LU equivalent for some $n$. The method for studying LU equivalence is also used to classify the different types of multipartite mixed entanglement according to equivalence classes of states under stochastic local operations and classical communication (SLOCC), where the pure states case was previously studied by Gour and Wallach using another approach.

•Jan 12, 2014•2 citations
Characterization and quantification of multipartite entanglement is one of the challenges in state-of-the-art experiments in quantum-information processing. According to theory, this is achieved via entanglement monotones, that is, functions that do not increase under stochastic local operations and classical communication (SLOCC). Typically such monotones include the wave function and its time reversal (antilinear-operator formalism) or they are based on not completely positive maps (e.g., partial transpose). Therefore, they are not directly accessible to experimental observations. We show how entanglement monotones derived from polynomial local SL(2,width.04emheight1.46exdepth\ensuremath−.07exC)(2,\phantom{\rule{2.40005pt}{0ex}}\mathrm{width}.04\mathrm{em}\mathrm{height}1.46\mathrm{ex}\mathrm{depth}\ensuremath{-}.07\mathrm{ex}\mathrm{C})(2,width.04emheight1.46exdepth\ensuremath−.07exC) invariants can be re-written in terms of expectation values of observables. Consequently, the amount of entanglement---of specific SLOCC classes---in a given state can be extracted from the measurement of correlation functions of local operators.
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.
In quantum information theory, understanding the complexity of entangled states within the context of SLOCC (stochastic local operations and classical communications) involving d qubits (or qudits) is essential for advancing our knowledge of quantum systems. This complexity is often analyzed by classifying the states via local symmetry groups. The resulting classes can be distinguished using invariant polynomials, which serve as a measure of entanglement. This paper introduces a novel method for obtaining invariant polynomials of the smallest degrees, which significantly enhances the efficiency of characterizing SLOCC classes of entangled quantum states. Our method not only simplifies the process of identifying these classes but also provides a robust tool for analyzing the entanglement properties of complex quantum systems. As a practical application, we demonstrate the derivation of minimal degree invariants in specific cases, illustrating the effectiveness of our approach in real-world scenarios. This advancement has the potential to streamline various processes in quantum information theory, making it easier to understand, classify, and utilize entangled states effectively.
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.
A family of N -qubit entanglement monotones invariant under stochastic local operations and classical communication (SLOCC) is defined. This class of entanglement monotones includes the well-known examples of the concurrence, the 3-tangle and some of the four-, five- and N -qubit SLOCC invariants introduced recently. The construction of these invariants is based on bipartite partitions of the Hilbert space in the form with L = 2 N − n ⩾ l = 2 n . Such partitions can be given a nice geometrical interpretation in terms of Grassmannians Gr ( L , l ) of l -planes in C L that can be realized as the zero locus of quadratic polynomials in the complex projective space of suitable dimension via the Plücker embedding. The invariants are neatly expressed in terms of the Plücker coordinates of the Grassmannians.
In this paper, we provide a characterization of multipartite entanglement in terms of equivalence classes of states under local unitary transformation (LU) by demonstrating a simple method to construct all homogenous polynomials that are invariant under local unitary group(LUIPs) for any fixed degree. We give an upper bound on the degree of the LUIP such that the ring of LUIPs can be generated by LUIPs with degree lower than the bound. Our characterization can directly generate an algorithm whose output is a generating set of LUIPs. By employing the concept of LUIPs, we prove that multipartite entanglement is additive in the sense that two multipartite states are LU equivalent if and only if nnn-copies of these two states are LU equivalent for some nnn. The method for studying LU equivalence is also used to classify the different types of multipartite mixed entanglement according to equivalence classes of states under stochastic local operations and classical communication (SLOCC), where the pure states case was previously studied by Gour and Wallach using another approach.