Efficient Polynomial-Scaled Determination of Algebraic Entanglement Entropy Between Collective Degrees of Freedom

This paper presents a polynomial-complexity method for calculating algebraic entanglement entropy in symmetric many-body systems by leveraging Lie group irreducible representations to block-diagonalize reduced density matrices, thereby capturing linearly growing entanglement that typically requires exponential resources to simulate.

The Gist

Imagine you have a massive crowd of people (atoms), and each person has two distinct "hats" they can wear: a Red Hat (representing their internal energy state) and a Blue Hat (representing their momentum or direction of movement).

In the quantum world, these people can get "entangled." This means the state of their Red Hat becomes mysteriously linked to the state of their Blue Hat, or to the hats of other people in the crowd.

Usually, trying to calculate how "linked" (entangled) these hats are for a huge crowd is a nightmare for computers. If you have 20 people, the number of possible hat combinations is so huge ($4^{20}$) that it would take a supercomputer longer than the age of the universe to figure it out. It's like trying to count every possible way to arrange a deck of cards by hand.

This paper presents a magic trick.

The authors, John Drew Wilson, Jarrod T. Reilly, and Murray J. Holland, discovered a way to calculate this "entanglement" for huge crowds using a method that is as easy as counting to 20, rather than counting to infinity. They call this Algebraic Entanglement Entropy.

Here is the simple breakdown of how they did it:

1. The Problem: The "Exponential Explosion"

Normally, to understand the crowd, you have to look at every single person individually. If you have $N$ people, the math explodes exponentially. It's like trying to solve a maze where every time you take a step, the maze doubles in size. For a crowd of 100 people, the maze is so big it doesn't even fit in the universe.

2. The Secret: The "Symmetry" Shortcut

The authors realized that in these specific quantum systems, the people in the crowd are indistinguishable. It doesn't matter which specific person is wearing the Red Hat; it only matters how many people are wearing it.

They used a mathematical concept called Lie Groups (specifically SU(4)) to organize the crowd. Imagine the crowd isn't a chaotic mess, but a perfectly organized pyramid.

• The Layers: The pyramid has layers. The top layer represents the most "ordered" state (everyone acting the same). The bottom layers represent more complex mixtures.
• The Blocks: Instead of looking at every single person, they realized the math breaks down into neat, separate "blocks" (like Lego bricks). You can solve the puzzle for one block, then the next, without ever needing to look at the whole messy pile at once.

3. The Magic Trick: The "Multiplicity"

Here is the most counter-intuitive part. Usually, if you have a simpler way to calculate something, you expect the answer to be "simpler" (less complex).

But in this quantum world, even though the calculation is simple (polynomial scaling), the result is incredibly complex.

• The Analogy: Imagine you have a library with only 100 books (a small, simple space). But inside those 100 books, there are hidden copies of millions of other stories.
• The authors found that because of the way these quantum particles are arranged, the "entanglement" (the complexity of the link between the Red and Blue hats) grows linearly with the number of people.
• If you have 1,000 people, the entanglement is huge. If you have 1,000,000 people, the entanglement is massive.
• The Catch: Usually, to get that much entanglement, you would need a computer with a memory the size of the galaxy. But because of their "pyramid" trick, they can calculate it on a laptop.

4. Why Does This Matter?

This isn't just a math game; it has real-world applications:

• Super-Sensors: By understanding how these "hats" get entangled, we can build sensors (like atomic clocks or gravity detectors) that are far more precise than anything we have today. They can detect things that were previously invisible.
• Quantum Computers: It helps us understand how to move information around inside a quantum computer. They showed that you can essentially "teleport" the state of an atom's internal energy to its movement (momentum) using this entanglement.
• Simulating Nature: It allows scientists to simulate complex quantum systems (like lasers cooling atoms) that were previously impossible to model because the math was too hard.

The Bottom Line

The authors found a way to bypass the "Exponential Wall." They realized that by looking at the symmetry of the crowd (treating everyone as part of a collective whole rather than individuals), they could use a simple, fast algorithm to calculate incredibly complex quantum connections.

It's like realizing that instead of counting every grain of sand on a beach to know how much water it holds, you can just measure the shape of the beach and do a quick multiplication to get the exact answer. This opens the door to designing better quantum technologies without needing a supercomputer the size of a city.

Technical Summary

Here is a detailed technical summary of the paper "Efficient Polynomial-Scaled Determination of Algebraic Entanglement Entropy Between Collective Degrees of Freedom" by Wilson, Reilly, and Holland.

1. Problem Statement

Quantum entanglement is a critical resource for quantum sensing, computing, and simulation. While multipartite entanglement (entanglement between distinct particles) is well-studied, there is growing interest in algebraic entanglement: entanglement between different degrees of freedom (DoFs) of constituent particles (e.g., internal electronic states vs. external momentum states) or between DoFs of different particles.

Calculating the algebraic entanglement entropy ($S_E$) for such systems is computationally prohibitive for large particle numbers ($N$).

• The Bottleneck: Standard methods require tracing out one DoF from the full density matrix. For a system of $N$ particles with two DoFs each (e.g., spin and momentum), the Hilbert space dimension scales as $4^N$ (exponential).
• The Paradox: Many physical systems (like atoms in optical cavities) can be simulated efficiently in a polynomially scaled Hilbert space (due to permutation symmetry, scaling as $O(N^3)$). However, these systems can generate algebraic entanglement entropy that grows linearly with $N$ ($S_E \propto N$), a behavior typically associated with exponentially large Hilbert spaces.
• The Challenge: How to calculate this linearly scaling entropy within a polynomially scaled computational framework without losing the ability to distinguish intraparticle entanglement from interparticle correlations.

2. Methodology

The authors propose a method leveraging Lie group representation theory and permutation symmetry to diagonalize reduced density matrices block-by-block.

A. Symmetry and State Space

• System: An ensemble of $N$ permutation-symmetric particles, each possessing two DoFs (labeled $J$ and $K$), both modeled as two-level systems (qubits).
• Group Structure: The system is described by the Lie group SU(4), which contains the subgroup SU(2)$_J$ $\otimes$ SU(2)$_K$.
• Basis Transformation: Instead of using the standard single-particle basis (which scales as $4^N$), the authors utilize the **bosonic subspace** of SU(4). This subspace, due to permutation symmetry, scales as$O(N^3)$.
• Pyramid Structure: The state space is organized into a "pyramid" structure based on the irreducible representations (irreps) of the SU(2) subgroups.
  • States are labeled by quantum numbers $|\ell, m_J, m_K\rangle$.
  • $\ell$ represents the total angular momentum (Casimir eigenvalue) shared by both DoFs.
  • $m_J$ and $m_K$ are the projections of the angular momentum for DoFs $J$ and $K$.
  • The layers of the pyramid correspond to different values of $\ell$ (from $N/2$ down to $0$or$1/2$).

B. The Algorithm

The core innovation is recognizing that tracing out one DoF (e.g., $K$) results in a reduced density matrix ($\hat{\rho}_J$) that is block-diagonal with respect to the $\ell$ layers.

1. Decomposition: The total state is decomposed into coefficients $p_{\ell, m_J, m_K}$ in the $|\ell, m_J, m_K\rangle$ basis.
2. Multiplicity ($d_N^\ell$): A crucial finding is that for a given $\ell$, there are multiple "copies" (multiplicity) of the SU(2) irrep in the full Hilbert space, given by:
   $$d_N^\ell = \frac{N!(2\ell+1)}{(\frac{N}{2} + \ell + 1)! (\frac{N}{2} - \ell)!}$$
   These copies are orthogonal but evolve identically under symmetric Hamiltonians.
3. Block Diagonalization: When tracing out $K$, the reduced density matrix $\hat{\rho}_J$ becomes a direct sum of matrices $\mathbf{M}^{(\ell)}$ for each layer $\ell$.
   • $\mathbf{M}^{(\ell)}$ is a $(2\ell+1) \times (2\ell+1)$ matrix constructed from the state coefficients.
   • The eigenvalues of $\mathbf{M}^{(\ell)}$ are scaled by the multiplicity $d_N^\ell$ in the full spectrum.
4. Entropy Calculation: The algebraic entanglement entropy is calculated by summing the von Neumann entropy of these blocks, properly weighted by their multiplicities:
   $$S_E = -\sum_{\ell} \sum_{i} \lambda_i^{(\ell)} \ln\left(\frac{\lambda_i^{(\ell)}}{d_N^\ell}\right)$$
   where $\lambda_i^{(\ell)}$ are the eigenvalues of $\mathbf{M}^{(\ell)}$.

This approach reduces the computational complexity from exponential ($O(4^N)$) to polynomial ($O(N^3)$ for pure states, $O(N^6)$ for mixed states), while accurately capturing the linear growth of entropy.

3. Key Contributions

1. Efficient Algorithm: Developed a polynomial-time algorithm to calculate algebraic entanglement entropy for permutation-symmetric systems with multiple DoFs, utilizing the direct sum structure of SU(2) irreps within SU(4).
2. Resolution of Scaling Paradox: Demonstrated theoretically and numerically that algebraic entanglement entropy can scale linearly with $N$ ($S_E \sim N$) even when the underlying Hilbert space dimension scales polynomially ($\dim \sim N^3$). This is achieved through the multiplicity of irreps, which acts as a resource for entanglement.
3. Block-Diagonalization Technique: Showed that tracing out a DoF in these symmetric systems yields a block-diagonal reduced density matrix, allowing for efficient diagonalization of small blocks ($O(N^2)$) rather than the full matrix.
4. Extension to Mixed States: Generalized the method to open quantum systems (mixed states) and introduced the use of coherent information ($I(J|K)$) to distinguish true algebraic entanglement from entanglement with an external environment.

4. Results

The authors validated their algorithm through four physical examples:

• Analytical Benchmark: Applied to a non-interacting spin-momentum model, the algorithm perfectly matched analytical solutions, confirming the linear scaling of $S_E$ up to $N \ln 2$.
• BOAT Model (Beyond One-Axis Twisting): Simulated a system generating both interparticle and algebraic entanglement. The algorithm successfully calculated $S_E$ for $N=20$ (requiring a $4^{20} \approx 10^{12}$ dimensional space in standard methods) using only polynomial resources.
• Leaky BOAT Model (Open System): Introduced cavity decay. The study showed that while total entropy increases due to environmental entanglement, coherent information remains positive, indicating robust algebraic entanglement between the internal and momentum DoFs even in the presence of noise.
• Spin-Momentum Superradiance: Analyzed a fully dissipative system. Results showed that higher incoherent pump rates could drive the system into steady states with higher coherent information, corresponding to states with massive algebraic entanglement (many singlet pairs).

5. Significance

• Quantum Simulation: Enables the exact simulation of large ensembles ($N \gg 1$) of atoms with multiple internal and external degrees of freedom, a task previously intractable for standard methods.
• Quantum Metrology & Sensing: Provides tools to quantify the utility of algebraic entanglement for multi-parameter sensing and quantum teleportation between different DoFs (e.g., mapping internal states to momentum states).
• Fundamental Physics: Offers a new perspective on information scrambling and thermalization. The ability to generate linearly scaling entropy in polynomial spaces suggests that complex correlations can arise efficiently in collective systems, potentially linking to black hole physics and quantum chaos.
• Generalizability: The methodology is not limited to SU(4) but can be extended to $SU(m) \otimes SU(n) \subset SU(m \times n)$ systems, making it applicable to a wide range of many-body quantum systems with permutation symmetry.

In summary, the paper bridges the gap between the computational efficiency of symmetric bosonic simulations and the complex entanglement structures they support, providing a powerful tool for analyzing and harnessing algebraic entanglement in quantum technologies.