Complex Systems’ Entanglement Limited by Graph Symmetry Alone

Saikat Sur, Indian Institute of Sciences, Pune. Determining the maximum entanglement across a balanced bipartition of many-body systems previously relied on knowing the ground state degeneracy or the number of possible configurations. Physicists have now derived a new upper bound on this entanglement, based on the symmetries within the system’s underlying graph structure. This achievement offers an exponential improvement, and for complete graphs, the scaling of the bound has transitioned from linear to logarithmic in system size, providing a complementary approach to understanding quantum correlations.

A new method to calculate the maximum amount of entanglement, a uniquely quantum connection between particles, within complex materials has been uncovered. This method focuses on the symmetries present in the arrangement of interactions within a system, rather than relying on counting possible configurations. The advance offers a sharply improved calculation for systems exhibiting high symmetry, such as complete graphs, where previous methods were less effective.

A new method for calculating the maximum entanglement within complex quantum systems has been developed, focusing on the symmetries inherent in how particles interact. This approach moves beyond counting possible configurations, instead examining the arrangement of interactions represented as a graph. Understanding this arrangement is key for quantifying how interconnected the parts of a quantum system are, much like assessing how tangled a complex knot is. The new calculation is particularly effective for systems with high symmetry, such as complete graphs, where previous methods struggled. This advancement relies on analysing the ‘automorphism group’, essentially the set of tools for all symmetry operations that leave the system unchanged, similar to how rotations and reflections leave a snowflake looking identical, and breaking down these symmetries into fundamental components.

Logarithmic scaling of entanglement entropy in complete graphs via symmetry group analysis

Entanglement measures now scale logarithmically with system size for complete graphs, marking a substantial improvement over previous methods exhibiting linear scaling. Calculating entanglement in highly symmetrical systems, such as complete graphs, was previously limited by exponential computational complexity, a limitation the new approach circumvents. Analysing the multiplicities of irreducible representations within the system’s automorphism group, a concept describing its symmetry operations, establishes a novel upper bound on balanced bipartite entanglement entropy. This logarithmic scaling is significant because it implies that the computational resources required to estimate the entanglement do not grow as rapidly with increasing system size, making it more tractable for larger systems.

The new bound complements existing methods reliant on degeneracy, broadening the toolkit for understanding quantum correlations in complex materials. Physicists now have an alternative tool for quantifying quantum correlations, particularly relevant for designing symmetry-based quantum devices utilising architectures like superconducting processors and trapped-ion arrays. The ability to accurately bound entanglement is crucial for verifying the performance of these devices and for developing new quantum algorithms. Despite this substantial improvement, the current framework does not yet extend to complex, weighted graphs, nor does it fully address the challenges of applying these findings to large-scale, practical quantum systems.

For a long time, calculating entanglement, a fundamental property of quantum systems where particles become interconnected, has relied on assessing the degeneracy, or the number of distinct ground states a system can possess. A higher degeneracy generally implies a greater capacity for entanglement. Symmetry, specifically the arrangement of interactions within a system described by its ‘automorphism group’, offers a complementary route to understanding these quantum connections. The automorphism group captures all the transformations that leave the Hamiltonian, and therefore the system’s energy spectrum, invariant. This symmetry-based approach provides an exponential improvement for certain arrangements like complete graphs, but it does not automatically eclipse existing methods. The relationship between these two approaches is nuanced; neither universally dominates the other, suggesting that the optimal method depends on the specific system under investigation.

This new approach expands the set of tools for quantifying entanglement, a key quantum phenomenon where particles become linked regardless of distance, and provides physicists with another avenue to explore and understand the behaviour of complex quantum materials and systems. Examining symmetries within a quantum system, rather than counting configurations, introduces a method for bounding entanglement entropy, a measure of quantum connection. Entanglement entropy, in this context, specifically refers to the von Neumann entropy of the reduced density matrix of one of the bipartitions. Exploiting the ‘automorphism group’, the set of symmetry-preserving operations, allows decomposition of complex symmetries into simpler components, termed ‘irreducible representations’, and calculation of an upper limit on entanglement. Irreducible representations are the fundamental building blocks of the symmetry group, and their multiplicities reflect the number of ways each symmetry can be realised within the system. Existing techniques rely on ground state degeneracy, but this approach offers a complementary perspective, particularly advantageous for systems exhibiting high symmetry, such as complete graphs where it demonstrates sharply improved scaling. The bound derived is expressed as the logarithm of a weighted sum of these irreducible representation multiplicities, providing a quantifiable measure of the maximum possible entanglement.

The significance of this work lies in its ability to provide tighter bounds on entanglement entropy without requiring detailed knowledge of the system’s ground state. This is particularly valuable in situations where calculating the ground state is computationally intractable. The upper bound on entanglement entropy is determined by the structure of the automorphism group, specifically the multiplicities of its irreducible representations. For a complete graph with N nodes, the scaling of the bound transitions from linear (proportional to N) with traditional methods to logarithmic (proportional to log N) using this symmetry-based approach. This represents a substantial reduction in computational complexity as the system size increases. While the current derivation focuses on balanced bipartitions, dividing the system into two equal parts, and unweighted graphs, future research could explore extending this framework to more general cases, including imbalanced bipartitions and systems with varying interaction strengths. The potential applications extend to various areas of quantum information science, including quantum error correction and the development of novel quantum materials.

Researchers established an upper bound for the maximum entanglement within the ground state of complex quantum systems. This new bound depends on the symmetries present in the system, quantified by the irreducible representations of its automorphism group, and offers a complementary approach to existing methods based on degeneracy. For complete graphs containing N nodes, this symmetry-based calculation improves the scaling of the bound from linear to logarithmic in system size, reducing computational demands. The authors suggest that extending this framework to imbalanced systems and weighted graphs may be a logical next step.