pith. sign in

arxiv: 2604.11059 · v2 · submitted 2026-04-13 · 🪐 quant-ph · math-ph· math.MP

Automorphism-Induced Entanglement Bounds in Many-Body Systems

Saikat Sur This is my paper

Pith reviewed 2026-05-10 16:06 UTC · model grok-4.3

classification 🪐 quant-ph math-phmath.MP
keywords entanglement entropyautomorphism groupmany-body systemsirreducible representationsbipartite entanglementgraph Hamiltoniansground statessymmetry bounds
0
0 comments X

The pith

Ground-state bipartite entanglement entropy is upper-bounded by the logarithm of a weighted sum of irreducible-representation multiplicities from the bipartition-preserving automorphism subgroup.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes a model-independent upper bound on the maximum balanced bipartite entanglement entropy that can appear in the ground states of Hamiltonians defined on graphs with nontrivial automorphism groups. The bound is expressed in terms of the multiplicities of irreducible representations of the subgroup of automorphisms that preserve a chosen bipartition of the vertices. It is shown to complement rather than replace the familiar degeneracy-based bound, with neither one always tighter than the other. For the complete graph the new bound converts the scaling from linear in the number of vertices to logarithmic and agrees with the exact maximum entropy.

Core claim

We show that the entropy is bounded by the logarithm of a weighted sum of multiplicities of irreducible representations of the bipartition-preserving automorphism subgroup. This bound is derived for ground states of Hamiltonians invariant under the graph automorphism group and is shown to complement the known degeneracy-based bound, with neither universally dominating the other. For the complete graph K_n the new bound yields an exponential improvement from linear to logarithmic scaling in the system size, consistent with the exact value of the entropy.

What carries the argument

The bipartition-preserving automorphism subgroup together with the multiplicities of its irreducible representations in the ground-state decomposition.

If this is right

  • The new bound and the degeneracy bound are independent, so the tighter estimate for any given graph is the minimum of the two.
  • On graphs with large automorphism groups, such as the complete graph, the bound forces entanglement entropy to grow only logarithmically with system size.
  • The bound applies to any Hamiltonian that is invariant under the full automorphism group of the underlying graph.
  • The bound is saturated when the ground state occupies the highest-entropy combination of the allowed irreps.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same symmetry decomposition could be used to bound other correlation measures, such as mutual information or operator entanglement, in symmetric many-body systems.
  • Numerical searches for highly entangled ground states can be restricted to the symmetric sectors without loss of generality for the purpose of checking the bound.
  • The method may extend to time-dependent states or open-system dynamics whenever the evolution respects the same automorphism group.

Load-bearing premise

Ground states of the automorphism-invariant Hamiltonians admit a decomposition under the bipartition-preserving subgroup in which entanglement entropy is controlled by the irrep multiplicities.

What would settle it

An explicit ground state of a Hamiltonian on the complete graph K_n whose balanced bipartite entanglement entropy exceeds the logarithmic bound given by the weighted sum of irrep multiplicities.

read the original abstract

We derive an upper bound on the maximum balanced bipartite entanglement entropy of ground states of many-body Hamiltonians defined on a graph, agnostic to any particular model, that possesses a nontrivial automorphism group. We show that the entropy is bounded by the logarithm of a weighted sum of multiplicities of irreducible representations of the bipartition-preserving automorphism subgroup. This bound complements the known degeneracy-based bound, with neither universally dominating the other. For the complete graph $K_n$, the new bound yields an exponential improvement from linear to logarithmic scaling in the system size, consistent with the exact value of the entropy.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript derives an upper bound on the maximum balanced bipartite entanglement entropy of ground states for many-body Hamiltonians defined on graphs with nontrivial automorphism groups. The bound is the logarithm of a weighted sum of multiplicities of irreducible representations of the bipartition-preserving automorphism subgroup. It is shown to complement (rather than dominate) the standard degeneracy-based bound, and for the complete graph K_n it improves the scaling from linear to logarithmic in system size while remaining consistent with the exact entropy value.

Significance. If the central derivation holds under the stated assumptions, the result supplies a symmetry-based tool for entanglement bounds that is model-agnostic and can be tighter than degeneracy counting in highly symmetric cases such as K_n. The explicit scaling improvement and consistency with the exact value constitute a concrete strength, as does the use of representation theory applied to the automorphism group. The work could be useful for analyzing entanglement in symmetric quantum spin systems and for guiding numerical or analytical studies of ground-state properties.

major comments (2)
  1. [Section 3 / main theorem] The central claim applies the bound to general ground states of Hamiltonians invariant under the full automorphism group, yet the derivation appears to rely on the reduced density matrix being block-diagonalized according to the irreps of the bipartition-preserving subgroup (via Schur's lemma or isotypic decomposition). Section 3 (or the proof of the main theorem) does not explicitly rule out the possibility that a maximum-entropy ground state is a coherent superposition across multiple irreps of this subgroup; such a superposition would enlarge the support of the reduced density matrix on A beyond the multiplicity sum and could violate the stated bound. A concrete counter-example or additional assumption (e.g., that the maximizing state can always be chosen within a single isotypic component) is needed to close this gap.
  2. [Equation (main bound) / Section 2] The weighting factors in the sum of multiplicities are introduced without a clear derivation or reference to a prior result; it is unclear whether they arise from the dimension of the ground-space representation or from an optimization over the full automorphism group. Equation (main bound) therefore risks appearing ad hoc unless the weighting is shown to follow directly from the representation theory of the full group acting on the ground space.
minor comments (2)
  1. [Abstract] The abstract and introduction would benefit from a one-sentence statement of the precise assumptions on the ground state (e.g., whether it is required to be an eigenvector of the subgroup or merely to lie in the ground space).
  2. [Section 2] Notation for the bipartition-preserving subgroup and its irreps should be introduced once and used consistently; occasional switches between G_A and the subgroup symbol make the text harder to follow.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We are grateful to the referee for the detailed and insightful report. The comments help us strengthen the presentation of our results. We respond to each major comment below and plan to submit a revised manuscript incorporating the necessary clarifications.

read point-by-point responses

  1. Referee: [Section 3 / main theorem] The central claim applies the bound to general ground states of Hamiltonians invariant under the full automorphism group, yet the derivation appears to rely on the reduced density matrix being block-diagonalized according to the irreps of the bipartition-preserving subgroup (via Schur's lemma or isotypic decomposition). Section 3 (or the proof of the main theorem) does not explicitly rule out the possibility that a maximum-entropy ground state is a coherent superposition across multiple irreps of this subgroup; such a superposition would enlarge the support of the reduced density matrix on A beyond the multiplicity sum and could violate the stated bound. A concrete counter-example or additional assumption (e.g., that the maximizing state can always be chosen within a single isotypic component) is needed to close this gap.

    Authors: We thank the referee for this important remark. The proof in Section 3 relies on the isotypic decomposition of the ground space with respect to the bipartition-preserving subgroup H. We acknowledge that the text does not explicitly address coherent superpositions of states from different isotypic components. However, because the ground space is a representation of the full automorphism group G, and H is a subgroup, the different irreps of H appearing in the decomposition are connected through the action of G. This linkage implies that arbitrary superpositions are not possible without leaving the ground space; only specific combinations consistent with the G-action are allowed. Consequently, the support of rho_A cannot exceed the weighted multiplicity sum. To make this rigorous, we will revise the proof in Section 3 to explicitly state this and show that the bound holds for general states in the G-invariant ground space. We will also consider adding the suggested assumption if it simplifies the presentation. revision: yes

  2. Referee: [Equation (main bound) / Section 2] The weighting factors in the sum of multiplicities are introduced without a clear derivation or reference to a prior result; it is unclear whether they arise from the dimension of the ground-space representation or from an optimization over the full automorphism group. Equation (main bound) therefore risks appearing ad hoc unless the weighting is shown to follow directly from the representation theory of the full group acting on the ground space.

    Authors: We apologize for the insufficient explanation of the weighting factors. These factors are derived from the branching rules of the restriction of the ground-space representation from the full automorphism group G to the bipartition-preserving subgroup H. Specifically, they correspond to the dimensions of the irreducible representations of G that contribute to each irrep of H, weighted by their multiplicities in the ground space. This follows directly from the representation theory of finite groups and the invariance of the Hamiltonian under G. We will revise Section 2 to provide a complete derivation of Equation (main bound), including the relevant steps from the decomposition of the representation and how the weights optimize the bound. Appropriate references to standard results in representation theory will be added. revision: yes

Circularity Check

0 steps flagged

No circularity; bound follows from standard representation theory on automorphism group

full rationale

The derivation applies standard facts from representation theory (Schur's lemma, isotypic decomposition, multiplicity bounds on support of reduced density matrices) to the action of the bipartition-preserving automorphism subgroup on the ground space. No parameter is fitted to data and then relabeled as a prediction, no self-citation supplies a load-bearing uniqueness theorem or ansatz, and the final bound is not definitionally equivalent to the input multiplicities. The central claim therefore remains an independent consequence of the group action rather than a tautology.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on standard facts from finite-group representation theory and the assumption that the Hamiltonian commutes with the automorphism group; no free parameters or new entities are introduced.

axioms (1)
  • standard math Every finite-dimensional representation of a finite group decomposes into a direct sum of irreducible representations with well-defined multiplicities
    This decomposition is invoked to define the weighted sum that appears in the entropy bound.

pith-pipeline@v0.9.0 · 5382 in / 1297 out tokens · 64688 ms · 2026-05-10T16:06:26.194953+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

48 extracted references · 48 canonical work pages

  1. [1]

    Sachbev, Quantum Phase Transitions

    S. Sachbev, Quantum Phase Transitions. Cambridge University Press, 1999

    work page 1999

  2. [2]

    Lindgren and J

    I. Lindgren and J. Morrison, Atomic Many-Body The- ory. Springer-Verlag, Heidelberg, 1982

    work page 1982

  3. [3]

    Quantum compu- tation with quantum dots,

    D. Loss and D. P. DiVincenzo, “Quantum compu- tation with quantum dots,” Phys. Rev. A , vol. 57, pp. 120–126, Jan 1998

    work page 1998

  4. [4]

    Quantum computing with an always-on heisenberg interaction,

    S. C. Benjamin and S. Bose, “Quantum computing with an always-on heisenberg interaction,”Physical review letters, vol. 90, no. 24, p. 247901, 2003

    work page 2003

  5. [5]

    Quantum simulation,

    I. M. Georgescu, S. Ashhab, and F. Nori, “Quantum simulation,”Rev. Mod. Phys., vol. 86, pp. 153–185, Mar 2014

    work page 2014

  6. [6]

    Quantum annealing with manufactured spins,

    M. W. Johnson, M. H. Amin, S. Gildert, T. Lant- ing, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk,et al., “Quantum annealing with manufactured spins,”Nature, vol. 473, no. 7346, pp. 194–198, 2011

    work page 2011

  7. [7]

    Quan- tum communication through anisotropic heisenberg xy spin chains,

    Z.-M. Wang, M. Byrd, B. Shao, and J. Zou, “Quan- tum communication through anisotropic heisenberg xy spin chains,” Physics Letters A, vol. 373, no. 6, pp. 636–643, 2009

    work page 2009

  8. [8]

    The quantum internet,

    H. J. Kimble, “The quantum internet,” Nature, vol. 453, pp. 1023–1030, Jun 2008

    work page 2008

  9. [9]

    Quantum communication through an un- modulated spin chain,

    S. Bose, “Quantum communication through an un- modulated spin chain,” Phys. Rev. Lett. , vol. 91, p. 207901, Nov 2003

    work page 2003

  10. [10]

    Quantum technologies with hybrid systems,

    G. Kurizki, P. Bertet, Y . Kubo, K. Mølmer, D. Pet- rosyan, P. Rabl, and J. Schmiedmayer, “Quantum technologies with hybrid systems,” Proceedings of the National Academy of Sciences, vol. 112, no. 13, pp. 3866–3873, 2015

    work page 2015

  11. [11]

    Colloquium: Area laws for the entanglement entropy,

    J. Eisert, M. Cramer, and M. B. Plenio, “Colloquium: Area laws for the entanglement entropy,”Rev. Mod. Phys., vol. 82, pp. 277–306, Feb 2010

    work page 2010

  12. [12]

    An area law for one-dimensional quantum systems,

    M. B. Hastings, “An area law for one-dimensional quantum systems,”Journal of Statistical Mechanics: Theory and Experiment, vol. 2007, p. P08024, aug 2007

    work page 2007

  13. [13]

    En- tanglement in quantum critical phenomena,

    G. Vidal, J. I. Latorre, E. Rico, and A. Kitaev, “En- tanglement in quantum critical phenomena,” Phys. Rev. Lett., vol. 90, p. 227902, Jun 2003

    work page 2003

  14. [14]

    Thermaliza- tion and its mechanism for generic isolated quantum systems,

    M. Rigol, V . Dunjko, and M. Olshanii, “Thermaliza- tion and its mechanism for generic isolated quantum systems,” Nature, vol. 452, no. 7189, pp. 854–858, 2008

    work page 2008

  15. [15]

    Entanglement in graph states and its applications,

    M. Hein, W. Dür, J. Eisert, R. Raussendorf, M. V . den Nest, and H. J. Briegel, “Entanglement in graph states and its applications,” 2006. 10

    work page 2006

  16. [16]

    Quantum entanglement in heisenberg antiferromagnets,

    V . Subrahmanyam, “Quantum entanglement in heisenberg antiferromagnets,”Phys. Rev. A, vol. 69, p. 022311, Feb 2004

    work page 2004

  17. [17]

    Entanglement of graph states of spin system with ising interaction and its quantifying on ibm’s quantum computer,

    K. Gnatenko and V . Tkachuk, “Entanglement of graph states of spin system with ising interaction and its quantifying on ibm’s quantum computer,”Physics Letters A, vol. 396, p. 127248, 2021

    work page 2021

  18. [18]

    En- tanglement entropy in the ground state of supersym- metric fermion lattice models,

    M. Jafarizadeh, F. Eghbalifam, and S. Nami, “En- tanglement entropy in the ground state of supersym- metric fermion lattice models,” Chinese Journal of Physics, vol. 78, pp. 207–219, 2022

    work page 2022

  19. [19]

    A one-way quan- tum computer,

    R. Raussendorf and H. J. Briegel, “A one-way quan- tum computer,” Phys. Rev. Lett., vol. 86, pp. 5188– 5191, May 2001

    work page 2001

  20. [20]

    Multipartite entanglement and high- precision metrology,

    G. Tóth, “Multipartite entanglement and high- precision metrology,” Phys. Rev. A , vol. 85, p. 022322, Feb 2012

    work page 2012

  21. [21]

    Automorphism-assisted quantum ap- proximate optimization algorithm for efficient graph optimization,

    V . N. Prakash, “Automorphism-assisted quantum ap- proximate optimization algorithm for efficient graph optimization,” 2024

    work page 2024

  22. [22]

    Collective purification of interacting quantum networks beyond symmetry constraints,

    S. Sur, P. Chattopadhyay, A. Chakrabarti, N. E. Palaiodimopoulos, Özgur E. Müstecaplıo˘glu, A. Fin- kler, D. B. R. Dasari, and G. Kurizki, “Collective purification of interacting quantum networks beyond symmetry constraints,” 2026

    work page 2026

  23. [23]

    Bipartite entanglement and entropic boundary law in lattice spin systems,

    A. Hamma, R. Ionicioiu, and P. Zanardi, “Bipartite entanglement and entropic boundary law in lattice spin systems,”Phys. Rev. A, vol. 71, p. 022315, Feb 2005

    work page 2005

  24. [24]

    Entanglement and topological entropy of the toric code at finite temper- ature,

    C. Castelnovo and C. Chamon, “Entanglement and topological entropy of the toric code at finite temper- ature,”Phys. Rev. B, vol. 76, p. 184442, Nov 2007

    work page 2007

  25. [25]

    On the computational complexity of ising spin glass models,

    F. Barahona, “On the computational complexity of ising spin glass models,”Journal of Physics A: Math- ematical and General, vol. 15, p. 3241, oct 1982

    work page 1982

  26. [26]

    Optimiza- tion, approximation, and complexity classes,

    C. H. Papadimitriou and M. Yannakakis, “Optimiza- tion, approximation, and complexity classes,”Jour- nal of Computer and System Sciences, vol. 43, no. 3, pp. 425–440, 1991

    work page 1991

  27. [27]

    Degree of entanglement,

    A. Shimony, “Degree of entanglement,” Annals of the New York Academy of Sciences, vol. 755, no. 1, pp. 675–679, 1995

    work page 1995

  28. [28]

    Monotones and in- variants for multi-particle quantum states,

    H. Barnum and N. Linden, “Monotones and in- variants for multi-particle quantum states,”Journal of Physics A: Mathematical and General , vol. 34, p. 6787, aug 2001

    work page 2001

  29. [29]

    Geometric measure of entanglement and applications to bipartite and multipartite quantum states,

    T.-C. Wei and P. M. Goldbart, “Geometric measure of entanglement and applications to bipartite and multipartite quantum states,” Phys. Rev. A, vol. 68, p. 042307, Oct 2003

    work page 2003

  30. [30]

    Genuine quantum cor- relations in quantum many-body systems: a review of recent progress,

    G. De Chiara and A. Sanpera, “Genuine quantum cor- relations in quantum many-body systems: a review of recent progress,”arXiv:1711.07824, 2017

    work page arXiv 2017

  31. [31]

    Control of multipartite entan- glement through anisotropy against thermal noise,

    S. Sur and S. Sur, “Control of multipartite entan- glement through anisotropy against thermal noise,” 2026

    work page 2026

  32. [32]

    En- tanglement in many-body systems,

    L. Amico, R. Fazio, A. Osterloh, and V . Vedral, “En- tanglement in many-body systems,” Rev. Mod. Phys., vol. 80, pp. 517–576, May 2008

    work page 2008

  33. [33]

    Entanglement entropy and quantum field theory,

    P. Calabrese and J. Cardy, “Entanglement entropy and quantum field theory,”Journal of Statistical Mechan- ics: Theory and Experiment , vol. 2004, p. P06002, jun 2004

    work page 2004

  34. [34]

    Density matrix formulation for quan- tum renormalization groups,

    S. R. White, “Density matrix formulation for quan- tum renormalization groups,”Phys. Rev. Lett., vol. 69, pp. 2863–2866, Nov 1992

    work page 1992

  35. [35]

    Area laws in a many-body localized state and its implications for topological order,

    B. Bauer and C. Nayak, “Area laws in a many-body localized state and its implications for topological order,”Journal of Statistical Mechanics: Theory and Experiment, vol. 2013, p. P09005, sep 2013

    work page 2013

  36. [36]

    From quantum chaos and eigenstate thermalization to statistical mechanics and thermodynamics,

    L. D’Alessio, Y . Kafri, A. Polkovnikov, and M. Rigol, “From quantum chaos and eigenstate thermalization to statistical mechanics and thermodynamics,” Ad- vances in Physics, vol. 65, no. 3, pp. 239–362, 2016

    work page 2016

  37. [37]

    M. A. Nielsen and I. L. Chuang, Quantum Computa- tion and Quantum Information. Cambridge Univer- sity Press, 2000. 11

    work page 2000

  38. [38]

    Entropy and exact matrix-product representation of the laughlin wave function,

    S. Iblisdir, J. I. Latorre, and R. Orús, “Entropy and exact matrix-product representation of the laughlin wave function,”Phys. Rev. Lett., vol. 98, p. 060402, Feb 2007

    work page 2007

  39. [39]

    Spin liquids in frustrated magnets,

    L. Balents, “Spin liquids in frustrated magnets,”Na- ture, vol. 464, pp. 199–208, Mar 2010

    work page 2010

  40. [40]

    Godsil and G

    C. Godsil and G. Royle, Algebraic Graph Theory. Springer, New York, 2001

    work page 2001

  41. [41]

    Canonical labeling of graphs,

    L. Babai and E. M. Luks, “Canonical labeling of graphs,” pp. 171–183, 1983

    work page 1983

  42. [42]

    Burnside,Theory of Groups of Finite Order

    W. Burnside,Theory of Groups of Finite Order. Cam- bridge: Cambridge University Press, 2nd ed., 1911

    work page 1911

  43. [43]

    P. J. Cameron,Permutation Groups, vol. 45 of Lon- don Mathematical Society Student Texts. Cambridge: Cambridge University Press, 1999

    work page 1999

  44. [44]

    Serre, Linear Representations of Finite Groups, vol

    J.-P. Serre, Linear Representations of Finite Groups, vol. 42 of Graduate Texts in Mathematics. New York: Springer-Verlag, 1977

    work page 1977

  45. [45]

    Neue Begründung der Theorie der Gruppencharaktere,

    I. Schur, “Neue Begründung der Theorie der Gruppencharaktere,” Sitzungsberichte der Königlich Preußischen Akademie der Wissenschaften zu Berlin, pp. 406–432, 1905

    work page 1905

  46. [46]

    The On-Line Encyclopedia of Integer Sequences,

    OEIS Foundation Inc., “The On-Line Encyclopedia of Integer Sequences,” 2026. Published electronically at https://oeis.org

    work page 2026

  47. [47]

    R. P. Stanley, Enumerative Combinatorics, vol. 2. Cambridge: Cambridge University Press, 1999

    work page 1999

  48. [48]

    The density-matrix renormalization group in the age of matrix product states,

    U. Schollwöck, “The density-matrix renormalization group in the age of matrix product states,” Annals of Physics, vol. 326, no. 1, pp. 96–192, 2011. January 2011 Special Issue. 12

    work page 2011