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:2610.12271

Multipartite entanglement spreads

Sylvain Carrozza, Johann Chevrier, Luca Lionni

math-phhep-thquant-phSubmitted Oct 8, 2026• Announced Oct 9, 2026• 0 citations
arXivHTMLPDF

Abstract

The entanglement structure of a bipartite pure state is characterized by its entanglement spectrum, or equivalently, by the family of Rényi-$k$ entanglement entropies with integer $k$. Taking the difference of two such entropies defines a quantity known as an entanglement spread, that is monotonous under local operations, and that vanishes if and only if the entanglement spectrum of the state is flat. We introduce a multipartite generalization of this notion which, for a fixed number $D\geq 3$ of parties, results in a collection of maps indexed by pairs of $D$-edge-colored graphs (obeying some condition). Each member of this collection takes the form of a difference of two multipartite Rényi entanglement entropies, each associated to a local unitary polynomial invariant (known in this context as a trace-invariant), and is shown to be monotonous under local operations. We then argue that a previously introduced family of so-called hypergraph-tensor (HT) states can be understood as a multipartite counterpart to the family of flat bipartite states. Indeed, we first prove that, when $D=3$, a tripartite pure state is HT if and only if it minimizes a particular (infinite) family of entanglement spreads. Second, we embed the set of HT states into the much larger family of spectral hypergraph-tensor (SHT) states, defined by a new Ansatz we introduce. We then prove that HT states can be uniquely characterized as the minimizers of some fixed entanglement spread among SHT states, for arbitrary $D\geq 3$. We also investigate SHT states in their own right: in particular, we characterize their orbits under local unitary transformations. Finally, along the way, the asymptotic large-$N$ expectation values of a number of entanglement spreads are computed in the Haar-random state of local dimension $N$.

AI Summary

The paper asks whether bipartite entanglement spread—differences of Rényi entropies that detect non-flat Schmidt spectra—has a multipartite analogue, and which states generalize flat bipartite states. It uses local-unitary polynomial invariants $\operatorname{tr}_G$, indexed by edge-colored graphs. Whenever $|\operatorname{tr}_G|\leq|\operatorname{tr}_H|$ holds universally, the logarithmic ratio $R_{G,H}=\ln|\operatorname{tr}_H|-\ln|\operatorname{tr}_G|$ defines a nonnegative monotone under deterministic local operations between pure states. Monotonicity follows from multiplicativity and a tensor-factor characterization of these transformations; Cauchy–Schwarz and Hölder inequalities supply explicit graph families. For three parties, simultaneous minimization of two specified infinite families characterizes hypergraph-tensor (HT) states: tensor products of maximally entangled GHZ states shared among subsets of parties, up to local unitaries. The proof translates equality conditions into graph-reduction moves. For arbitrary $D\geq3$, the paper introduces spectral hypergraph-tensor (SHT) states, replacing GHZ factors with nonuniformly weighted versions. Their subset spectra completely classify local-unitary orbits. Within this restricted class, vanishing of one suitable spread is equivalent to being HT. Haar-random-state calculations show that multipartite spreads need not remain $O(1)$: one tripartite family has expectation $\ln N+o(1)$ for every index $n\geq2$, while its $n=1$ member is $o(1)$. These calculations combine graph-based moment asymptotics with conditions justifying interchange of logarithms and expectations. Limitations include possible discontinuities at invariant zeros, an infinite-family tripartite characterization, and an SHT ansatz that excludes states such as $W$. LOCC behavior is deferred.

No sign of AI-generated text

Error found: The partial-transpose example incorrectly characterizes vanishing of its spread by flatness of (rho_12^{T_2})² alone: tripartite GHZ states have a flat nonzero squared spectrum but strictly positive spread. The remark claiming an equivalent power-law bound using the minimum local dimension is false, as shown by a product first party tensored with an arbitrarily large maximally entangled pair.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
52 pages, 16 figures

Related papers

Tensor invariants for multipartite entanglement classification

Sylvain Carrozza, Johann Chevrier, Luca Lionni

Organising the space of entanglement structures of a multipartite quantum system is a much more challenging task than its bipartite version: while the local unitary (LU) orbit of a bipartite pure state can be conveniently characterized by its entanglement spectrum, invariants of multipartite entanglement structures are comparatively difficult to define and work with. The root cause of this difference is that the bipartite problem can be reduced to the analysis of matrix invariants, while its multipartite version is governed by a much richer space of tensor invariants. The present work explores the latter through the lens of so-called trace-invariants, which are in one-to-one correspondence with combinatorial objects known as colored graphs. We first explain why trace-invariant evaluations can serve as labels of LU-orbits of multipartite pure states, how this strategy extends to random states, and how the effect of local operations (LO) can be analyzed through such data. We then focus on entanglement classification within an (infinite-dimensional) subspace of reference states, whose basic building blocks are GHZ states of various dimensions. We show that relatively simple subclasses of trace-invariants are sufficient to separate the LU-orbits of reference states, and enable a complete (resp. an incomplete) characterization of their relations in the LO (resp. LOCC) resource theory of entanglement. Finally, we investigate how a (still infinite) subclass of reference states of local dimension N can be efficiently distinguished at leading and subleading orders in an asymptotic large-N expansion (among themselves, or from Haar-random states). This analysis relies crucially on combinatorial quantities associated to colored graphs, some of which have already played instrumental roles in the recent literature on random tensors. Results of broader relevance are reported along the way.

math-phCross-listedarXiv:2604.02269•Apr 3, 2026•6 citations

Statistical mechanics of multipartite entanglement in hypergraph states

Paolo Scarafile, Giorgia Trotta, Paolo Facchi +4 more

We investigate multipartite entanglement in a particular family of pure $n$-qubit hypergraph states through a statistical-mechanics framework, where the average bipartite purity maps onto an effective Hamiltonian of $2^n$ classical binary spins. In this correspondence, each hypergraph state uniquely corresponds to a classical spin configuration, while temperature serves as a control parameter that continuously interpolates between a uniform ensemble of random hypergraph states at high temperature and maximally multipartite entangled states (MMES) at zero temperature. Remarkably, the exponential of the zero-temperature entropy directly gives the number of MMES within the set of hypergraph states. For small system sizes ($n \leq 5$), we perform an exact enumeration, fully characterizing the energy landscape and associated thermodynamic observables, and validating known MMES counts. For larger systems ($n = 6$ and $7$), where exact methods become computationally infeasible, we employ simulated annealing and parallel tempering algorithms to efficiently sample the exponentially large state space. Our analysis yields quantitative predictions of the number of MMES and reveals how entanglement is statistically distributed across the sets of hypergraph states. These results establish hypergraph states as an ideal platform for investigating multipartite entanglement through thermodynamic methods, offering both computational advances and physical insights into the structure of quantum entanglement in restricted families of quantum states.

quant-pharXiv:2609.24508•Sep 22, 2026•1 citation

Exact and asymptotic measures of multipartite pure-state entanglement

Charles H. Bennett, Sandu Popescu, Daniel Rohrlich +2 more

Hoping to simplify the classification of pure entangled states of multi $(m)\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ quantum systems, we study exactly and asymptotically (in $n)$ reversible transformations among $n\mathrm{th}$ tensor powers of such states (i.e., $n$ copies of the state shared among the same $m$ parties) under local quantum operations and classical communication (LOCC). For exact transformations, we show that two states whose marginal one-party entropies agree are either locally unitarily equivalent or else LOCC incomparable. In particular we show that two tripartite Greenberger-Horne-Zeilinger states are LOCC incomparable to three bipartite Einstein-Podolsky-Rosen (EPR) states symmetrically shared among the three parties. Asymptotic transformations yield a simpler classification than exact transformations; for example, they allow all pure bipartite states to be characterized by a single parameter---their partial entropy---which may be interpreted as the number of EPR pairs asymptotically interconvertible to the state in question by LOCC transformations. We show that $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states having an $m\ensuremath{-}\mathrm{w}\mathrm{a}\mathrm{y}$ Schmidt decomposition are similarly parametrizable, with the partial entropy across any nontrivial partition representing the number of standard quantum superposition or ``cat'' states $|{0}^{\ensuremath{\bigotimes}m}〉+|{1}^{\ensuremath{\bigotimes}m}〉$ asymptotically interconvertible to the state in question. For general $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ states, partial entropies across different partitions need not be equal, and since partial entropies are conserved by asymptotically reversible LOCC operations, a multicomponent entanglement measure is needed, with each scalar component representing a different kind of entanglement, not asymptotically interconvertible to the other kinds. In particular we show that the $m=4$ cat state is not isentropic to, and therefore not asymptotically interconvertible to, any combination of bipartite and tripartite states shared among the four parties. Thus, although the $m=4$ cat state can be prepared from bipartite EPR states, the preparation process is necessarily irreversible, and remains so even asymptotically. For each number of parties $m$ we define a minimal reversible entanglement generating set (MREGS) as a set of states of minimal cardinality sufficient to generate all $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states by asymptotically reversible LOCC transformations. Partial entropy arguments provide lower bounds on the size of the MREGS, but for $m>2$ we know no upper bounds. We briefly consider several generalizations of LOCC transformations, including transformations with some probability of failure, transformations with the catalytic assistance of states other than the states we are trying to transform, and asymptotic LOCC transformations supplemented by a negligible $[o(n)]$ amount of quantum communication.

arXiv:quant-ph/9908073•Physical Review A•Dec 12, 2000•482 citations

Entanglement quantification by local unitary operations

Alex Monràs, Gerardo Adesso, S. M. Giampaolo +3 more

Invariance under local unitary operations is a fundamental property that must be obeyed by every proper measure of quantum entanglement. However, this is not the only aspect of entanglement theory where local unitary operations play a relevant role. In the present work we show that the application of suitable local unitary operations defines a family of bipartite entanglement monotones, collectively referred to as ``mirror entanglement.'' They are constructed by first considering the (squared) Hilbert-Schmidt distance of the state from the set of states obtained by applying to it a given local unitary operator. To the action of each different local unitary operator there corresponds a different distance. We then minimize these distances over the sets of local unitary operations with different spectra, obtaining an entire family of different entanglement monotones. We show that these mirror-entanglement monotones are organized in a hierarchical structure, and we establish the conditions that need to be imposed on the spectrum of a local unitary operator for the associated mirror entanglement to be faithful, i.e., to vanish in and only in separable pure states. We analyze in detail the properties of one particularly relevant member of the family, the ``stellar mirror entanglement'' associated with the traceless local unitary operations with nondegenerate spectra and equispaced eigenvalues in the complex plane. This particular measure generalizes the original analysis of S. M. Giampaolo and F. Illuminati [Phys. Rev. A 76, 042301 (2007)], valid for qubits and qutrits. We prove that the stellar entanglement is a faithful bipartite entanglement monotone in any dimension and that it is bounded from below by a function proportional to the linear entropy and from above by the linear entropy itself, coinciding with it in two- and three-dimensional spaces.

arXiv:1104.0941•Physical Review A•Jul 1, 2011•35 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•3 citations

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.

•Jan 23, 2012•0 citations
The entanglement structure of a bipartite pure state is characterized by its entanglement spectrum, or equivalently, by the family of Rényi-kkk entanglement entropies with integer kkk. Taking the difference of two such entropies defines a quantity known as an entanglement spread, that is monotonous under local operations, and that vanishes if and only if the entanglement spectrum of the state is flat. We introduce a multipartite generalization of this notion which, for a fixed number D≥3D\geq 3D≥3 of parties, results in a collection of maps indexed by pairs of DDD-edge-colored graphs (obeying some condition). Each member of this collection takes the form of a difference of two multipartite Rényi entanglement entropies, each associated to a local unitary polynomial invariant (known in this context as a trace-invariant), and is shown to be monotonous under local operations. We then argue that a previously introduced family of so-called hypergraph-tensor (HT) states can be understood as a multipartite counterpart to the family of flat bipartite states. Indeed, we first prove that, when D=3D=3D=3, a tripartite pure state is HT if and only if it minimizes a particular (infinite) family of entanglement spreads. Second, we embed the set of HT states into the much larger family of spectral hypergraph-tensor (SHT) states, defined by a new Ansatz we introduce. We then prove that HT states can be uniquely characterized as the minimizers of some fixed entanglement spread among SHT states, for arbitrary D≥3D\geq 3D≥3. We also investigate SHT states in their own right: in particular, we characterize their orbits under local unitary transformations. Finally, along the way, the asymptotic large-NNN expectation values of a number of entanglement spreads are computed in the Haar-random state of local dimension NNN.
The paper asks whether bipartite entanglement spread—differences of Rényi entropies that detect non-flat Schmidt spectra—has a multipartite analogue, and which states generalize flat bipartite states. It uses local-unitary polynomial invariants tr⁡G\operatorname{tr}_GtrG​, indexed by edge-colored graphs. Whenever ∣tr⁡G∣≤∣tr⁡H∣|\operatorname{tr}_G|\leq|\operatorname{tr}_H|∣trG​∣≤∣trH​∣ holds universally, the logarithmic ratio RG,H=ln⁡∣tr⁡H∣−ln⁡∣tr⁡G∣R_{G,H}=\ln|\operatorname{tr}_H|-\ln|\operatorname{tr}_G|RG,H​=ln∣trH​∣−ln∣trG​∣ defines a nonnegative monotone under deterministic local operations between pure states. Monotonicity follows from multiplicativity and a tensor-factor characterization of these transformations; Cauchy–Schwarz and Hölder inequalities supply explicit graph families.
For three parties, simultaneous minimization of two specified infinite families characterizes hypergraph-tensor (HT) states: tensor products of maximally entangled GHZ states shared among subsets of parties, up to local unitaries. The proof translates equality conditions into graph-reduction moves. For arbitrary D≥3D\geq3D≥3, the paper introduces spectral hypergraph-tensor (SHT) states, replacing GHZ factors with nonuniformly weighted versions. Their subset spectra completely classify local-unitary orbits. Within this restricted class, vanishing of one suitable spread is equivalent to being HT.
Haar-random-state calculations show that multipartite spreads need not remain O(1)O(1)O(1): one tripartite family has expectation ln⁡N+o(1)\ln N+o(1)lnN+o(1) for every index n≥2n\geq2n≥2, while its n=1n=1n=1 member is o(1)o(1)o(1). These calculations combine graph-based moment asymptotics with conditions justifying interchange of logarithms and expectations. Limitations include possible discontinuities at invariant zeros, an infinite-family tripartite characterization, and an SHT ansatz that excludes states such as WWW. LOCC behavior is deferred.
Organising the space of entanglement structures of a multipartite quantum system is a much more challenging task than its bipartite version: while the local unitary (LU) orbit of a bipartite pure state can be conveniently characterized by its entanglement spectrum, invariants of multipartite entanglement structures are comparatively difficult to define and work with. The root cause of this difference is that the bipartite problem can be reduced to the analysis of matrix invariants, while its multipartite version is governed by a much richer space of tensor invariants. The present work explores the latter through the lens of so-called trace-invariants, which are in one-to-one correspondence with combinatorial objects known as colored graphs. We first explain why trace-invariant evaluations can serve as labels of LU-orbits of multipartite pure states, how this strategy extends to random states, and how the effect of local operations (LO) can be analyzed through such data. We then focus on entanglement classification within an (infinite-dimensional) subspace of reference states, whose basic building blocks are GHZ states of various dimensions. We show that relatively simple subclasses of trace-invariants are sufficient to separate the LU-orbits of reference states, and enable a complete (resp. an incomplete) characterization of their relations in the LO (resp. LOCC) resource theory of entanglement. Finally, we investigate how a (still infinite) subclass of reference states of local dimension N can be efficiently distinguished at leading and subleading orders in an asymptotic large-N expansion (among themselves, or from Haar-random states). This analysis relies crucially on combinatorial quantities associated to colored graphs, some of which have already played instrumental roles in the recent literature on random tensors. Results of broader relevance are reported along the way.
We investigate multipartite entanglement in a particular family of pure nnn-qubit hypergraph states through a statistical-mechanics framework, where the average bipartite purity maps onto an effective Hamiltonian of 2n2^n2n classical binary spins. In this correspondence, each hypergraph state uniquely corresponds to a classical spin configuration, while temperature serves as a control parameter that continuously interpolates between a uniform ensemble of random hypergraph states at high temperature and maximally multipartite entangled states (MMES) at zero temperature. Remarkably, the exponential of the zero-temperature entropy directly gives the number of MMES within the set of hypergraph states. For small system sizes (n≤5n \leq 5n≤5), we perform an exact enumeration, fully characterizing the energy landscape and associated thermodynamic observables, and validating known MMES counts. For larger systems (n=6n = 6n=6 and 777), where exact methods become computationally infeasible, we employ simulated annealing and parallel tempering algorithms to efficiently sample the exponentially large state space. Our analysis yields quantitative predictions of the number of MMES and reveals how entanglement is statistically distributed across the sets of hypergraph states. These results establish hypergraph states as an ideal platform for investigating multipartite entanglement through thermodynamic methods, offering both computational advances and physical insights into the structure of quantum entanglement in restricted families of quantum states.
Hoping to simplify the classification of pure entangled states of multi $(m)\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ quantum systems, we study exactly and asymptotically (in n)n)n) reversible transformations among nthn\mathrm{th}nth tensor powers of such states (i.e., nnn copies of the state shared among the same mmm parties) under local quantum operations and classical communication (LOCC). For exact transformations, we show that two states whose marginal one-party entropies agree are either locally unitarily equivalent or else LOCC incomparable. In particular we show that two tripartite Greenberger-Horne-Zeilinger states are LOCC incomparable to three bipartite Einstein-Podolsky-Rosen (EPR) states symmetrically shared among the three parties. Asymptotic transformations yield a simpler classification than exact transformations; for example, they allow all pure bipartite states to be characterized by a single parameter---their partial entropy---which may be interpreted as the number of EPR pairs asymptotically interconvertible to the state in question by LOCC transformations. We show that $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states having an $m\ensuremath{-}\mathrm{w}\mathrm{a}\mathrm{y}$ Schmidt decomposition are similarly parametrizable, with the partial entropy across any nontrivial partition representing the number of standard quantum superposition or ``cat'' states $|{0}^{\ensuremath{\bigotimes}m}〉+|{1}^{\ensuremath{\bigotimes}m}〉$ asymptotically interconvertible to the state in question. For general $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ states, partial entropies across different partitions need not be equal, and since partial entropies are conserved by asymptotically reversible LOCC operations, a multicomponent entanglement measure is needed, with each scalar component representing a different kind of entanglement, not asymptotically interconvertible to the other kinds. In particular we show that the m=4m=4m=4 cat state is not isentropic to, and therefore not asymptotically interconvertible to, any combination of bipartite and tripartite states shared among the four parties. Thus, although the m=4m=4m=4 cat state can be prepared from bipartite EPR states, the preparation process is necessarily irreversible, and remains so even asymptotically. For each number of parties mmm we define a minimal reversible entanglement generating set (MREGS) as a set of states of minimal cardinality sufficient to generate all $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states by asymptotically reversible LOCC transformations. Partial entropy arguments provide lower bounds on the size of the MREGS, but for m>2m>2m>2 we know no upper bounds. We briefly consider several generalizations of LOCC transformations, including transformations with some probability of failure, transformations with the catalytic assistance of states other than the states we are trying to transform, and asymptotic LOCC transformations supplemented by a negligible [o(n)][o(n)][o(n)] amount of quantum communication.
Invariance under local unitary operations is a fundamental property that must be obeyed by every proper measure of quantum entanglement. However, this is not the only aspect of entanglement theory where local unitary operations play a relevant role. In the present work we show that the application of suitable local unitary operations defines a family of bipartite entanglement monotones, collectively referred to as ``mirror entanglement.'' They are constructed by first considering the (squared) Hilbert-Schmidt distance of the state from the set of states obtained by applying to it a given local unitary operator. To the action of each different local unitary operator there corresponds a different distance. We then minimize these distances over the sets of local unitary operations with different spectra, obtaining an entire family of different entanglement monotones. We show that these mirror-entanglement monotones are organized in a hierarchical structure, and we establish the conditions that need to be imposed on the spectrum of a local unitary operator for the associated mirror entanglement to be faithful, i.e., to vanish in and only in separable pure states. We analyze in detail the properties of one particularly relevant member of the family, the ``stellar mirror entanglement'' associated with the traceless local unitary operations with nondegenerate spectra and equispaced eigenvalues in the complex plane. This particular measure generalizes the original analysis of S. M. Giampaolo and F. Illuminati [Phys. Rev. A 76, 042301 (2007)], valid for qubits and qutrits. We prove that the stellar entanglement is a faithful bipartite entanglement monotone in any dimension and that it is bounded from below by a function proportional to the linear entropy and from above by the linear entropy itself, coinciding with it in two- and three-dimensional spaces.
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.
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.