Abstract
This paper addresses a long-standing problem in invariant theory: determining the maximum degree of polynomials required to generate the invariant ring of a reductive group. By focusing on local unitary (LU) and local general linear (GL) groups acting on multipartite Hilbert spaces, we establish explicit upper bounds for these degrees. This work provides a complete characterization of the invariant polynomial rings that define multipartite entanglement, proving that entanglement equivalence is decidable and demonstrating that multipartite entanglement is additive under tensor products. Specifically, we show that two multipartite states are local unitary equivalent if and only if $r$-copies of them are local unitary equivalent for some $r$.
Introduction
In quantum information science, entanglement is the fundamental resource powering quantum computation and secure communication. For systems involving more than two parties—multipartite systems—characterizing entanglement is notoriously difficult. A central question is whether two quantum states are equivalent under Local Unitary (LU) transformations. If two states are LU-equivalent, they can be transformed into one another using only local operations performed by each party, meaning they possess the same "type" and "amount" of entanglement.
Mathematically, these entanglement properties are captured by invariant polynomials—functions of the state's coefficients that remain unchanged even when the local parts of the state are rotated. The challenge, dating back to 19th-century invariant theory, has been determining the complexity of these polynomials. While it was known that a finite set of "generator" polynomials exists, the maximum degree $d$ required to form a complete set remained unknown. Without this bound, it was impossible to ensure a complete "fingerprint" of a state's entanglement.
Methodological Framework
The research treats the Local Unitary group as a reductive algebraic group acting on a vector space. To derive explicit bounds, the authors employ several sophisticated mathematical strategies:
- Complexification: Because unitary groups are compact, the authors utilize complexification to map them to General Linear groups (associated with SLOCC, or Stochastic Local Operations and Classical Communication). This allows the application of powerful tools from modern algebraic geometry.
- Intersection of Rings: A pivotal insight in this work is that the total invariant ring of a multipartite system can be viewed as the intersection of the invariant rings of each individual party. This "divide and conquer" approach makes the calculation of the total system's invariants significantly more tractable.
- Derksen’s Bounds: The authors adapt Derksen’s bounds—a high-level result in invariant theory—to the specific structure of multipartite Hilbert spaces to derive the first explicit polynomial upper bounds for the generators.
Key Results and Insights
Explicit Degree Bounds
The paper provides a concrete formula for the maximum degree $N$ of the generators. For a multipartite system with dimensions $d_1, d_2, \dots, d_n$, the bound is established as:
$$N(d_1, \dots, d_n) = \frac{3}{8}(\prod_i d_i^2) \cdot \max(d_i)^{2n} \cdot (\sum_i d_i)^{2(\sum_i d_i^2 - n)}$$
While these bounds are large, they provide a theoretical guarantee that the problem of checking LU-equivalence is decidable. There is now a finite, known recipe to determine if two states are equivalent.
The Additivity of Entanglement
One of the most significant physical applications of this work is the proof that multipartite entanglement is additive. The authors demonstrate that two states $|\Psi\rangle$ and $|\Phi\rangle$ are LU-equivalent if and only if $r$ copies of them ($|\Psi\rangle^{\otimes r}$ and $|\Phi\rangle^{\otimes r}$) are LU-equivalent for some $r$. This confirms that the fundamental nature of entanglement remains consistent when scaling quantum systems.
Systematic Construction
Beyond establishing bounds, the paper provides a systematic method to construct all homogeneous invariant polynomials for any fixed degree. This effectively offers a complete characterization of the invariant rings for both LU and SLOCC equivalence.
Discussion and Future Work
The primary limitation of the current results is that the established bounds are not optimal. The formula produces extremely large numbers even for relatively small systems (such as multiple qubits), which limits immediate practical computation for large-scale quantum processors.
Future research will likely focus on tightening these bounds for specific classes of quantum states and developing more computationally efficient algorithms. Additionally, while this work provides a foundation for pure states, the full characterization of mixed-state entanglement invariants remains an open and more complex challenge in the field.
Summary updated