pith. sign in

arxiv: 2602.15168 · v2 · submitted 2026-02-16 · 🪐 quant-ph

Phases of matrix-product states with symmetries and measurements: Finite nilpotent groups

David Gunn , Georgios Styliaris , Barbara Kraus , Tristan Kraft This is my paper

Pith reviewed 2026-05-15 21:37 UTC · model grok-4.3

classification 🪐 quant-ph
keywords matrix-product statessymmetry-protected topological phasesnilpotent groupssymmetric measurementsfeedforward protocolsquantum phase classificationone-dimensional systems
0
0 comments X

The pith

Symmetric measurements and feedforward collapse all SPT and non-normal MPS phases into one for finite nilpotent group symmetries.

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

The paper classifies phases of one-dimensional matrix-product states protected by finite nilpotent group symmetries when the allowed operations include symmetric local circuits plus symmetric measurements and classical feedforward. It shows that these G-CMF transformations can map any symmetry-protected topological state or non-normal GHZ-type state to the trivial product state, and vice versa, with success probability approaching one in the thermodynamic limit. The classification is complete for all such groups, and the usual multiplicity of distinct phases disappears. This outcome rests on a finite hierarchy in the irreducible representations of nilpotent groups that lets successive measurement rounds systematically reduce non-abelian symmetry components to abelian ones.

Core claim

For any finite nilpotent group G, the G-CMF equivalence class contains every MPS phase that is either symmetry-protected topological or non-normal; explicit symmetry-respecting protocols exist that convert any such state to the trivial phase (or the reverse) with probability that approaches certainty as system size grows. The key technical step is the finite hierarchical structure of the group's irreducible representations, which supplies a finite sequence of symmetric measurements that reduce non-abelian features step by step until only an abelian symmetry remains.

What carries the argument

The finite hierarchical structure of irreducible representations of nilpotent groups, which supplies a finite sequence of symmetric measurements that reduce non-abelian symmetry components to abelian ones with success probability approaching one.

If this is right

  • Every SPT phase for a given nilpotent symmetry becomes interconvertible with the trivial phase under G-CMF.
  • All non-normal GHZ-type phases likewise merge into the same single G-CMF class.
  • The phase diagram for 1D systems with nilpotent symmetries simplifies to one asymptotically equivalent phase.
  • Explicit finite-round measurement protocols achieve the mapping for any chosen pair of states.

Where Pith is reading between the lines

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

  • The result suggests that adding symmetric measurements can erase topological distinctions whenever the symmetry group admits a finite representation hierarchy.
  • Similar simplifications might appear for approximate or noisy symmetries if the hierarchy survives small perturbations.
  • State-preparation overhead for symmetry-protected states could be reduced in practice by using measurement-based protocols instead of purely unitary circuits.

Load-bearing premise

Nilpotent groups possess a finite hierarchy of irreducible representations that successive symmetric measurements can use to reduce non-abelian components to abelian ones with probability approaching one.

What would settle it

An explicit protocol for a concrete nilpotent group, such as the Heisenberg group over a finite field, that fails to reach success probability greater than 1 minus a fixed positive constant independent of system size would falsify the claim.

Figures

Figures reproduced from arXiv: 2602.15168 by Barbara Kraus, David Gunn, Georgios Styliaris, Tristan Kraft.

Figure 1
Figure 1. Figure 1: (a) We consider transformations between states belonging to different phases. Starting from an initial state (black [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: An example of the SPT protocol for the non-abelian class-3 nilpotent group [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Example of Part 1 of the protocol transforming a state in the trivial phase to the GHZ state for the class- [PITH_FULL_IMAGE:figures/full_fig_p013_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Example of Part 2 of the protocol, which establishes [PITH_FULL_IMAGE:figures/full_fig_p014_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Example of projective measurements on the first substring of sites in round [PITH_FULL_IMAGE:figures/full_fig_p022_5.png] view at source ↗
read the original abstract

We study phases of one-dimensional matrix-product states (MPS) when transformations are restricted to symmetric local circuits supplemented with symmetric measurements and feedforward (G-CMF). Building on the framework introduced in Gunn et al., Phys. Rev. B 111, 115110 (2025), we extend the analysis to all finite nilpotent groups for which we obtain a complete classification of G-CMF phases. We construct explicit symmetry-respecting protocols that map any symmetry-protected topological (SPT) or non-normal (GHZ-type) MPS to the trivial phase-and vice versa-with success probability approaching one in the thermodynamic limit. The key technical ingredient is a finite hierarchical structure of irreducible representations of nilpotent groups, which enables successive rounds of symmetric measurements to systematically reduce non-abelian components to abelian ones. Our results demonstrate that allowing symmetric measurements and feedforward fundamentally simplifies the phase structure of 1D systems with nilpotent symmetries: all SPT and non-normal MPS phases collapse into a single asymptotically equivalent phase under G-CMF transformations.

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 classifies phases of one-dimensional matrix-product states (MPS) with finite nilpotent group symmetries under G-CMF transformations (symmetric local circuits plus symmetric measurements and feedforward). It constructs explicit protocols that map any SPT or non-normal (GHZ-type) MPS to the trivial phase (and vice versa) with success probability approaching one in the thermodynamic limit. The central technical ingredient is the finite hierarchical structure of irreducible representations of nilpotent groups, which permits successive symmetric measurements to reduce non-abelian components to abelian ones.

Significance. If the central claims hold, the work demonstrates that symmetric measurements and feedforward collapse the phase structure for all finite nilpotent symmetries into a single asymptotically equivalent phase. The explicit G-CMF protocols and use of the finite central series of nilpotent groups provide a concrete, parameter-free classification extending the framework of Gunn et al. (2025). The focus on falsifiable measurement success rates and group-representation properties is a strength.

major comments (2)
  1. [Abstract and §4] Abstract and §4: The assertion that overall success probability tends to 1 in the thermodynamic limit requires each measurement round to succeed with probability p ≥ p0 > 0 independent of system size L. The hierarchical irrep structure is invoked to enable reduction, but no explicit uniform lower bound on p0 is derived that holds for arbitrary finite nilpotent groups (including those with arbitrarily long central series). This bound is load-bearing for the claim that all phases collapse with probability approaching 1.
  2. [§3.2, Eq. (12)] §3.2, Eq. (12): The irrep-reduction measurement is defined via projection onto the abelian quotient of the central series, but the success probability is not shown to be bounded away from zero uniformly in the nilpotency class; the argument therefore does not establish that the failure rate decays exponentially in L for every nilpotent G.
minor comments (2)
  1. [§2] The introduction of G-CMF notation in §2 would benefit from an immediate forward reference to the definition in Gunn et al. (2025) for reader convenience.
  2. [Figure 2] Figure 2 caption does not specify the numerical values of the per-round success probabilities used in the plotted curves.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments. We appreciate the recognition of the technical contribution based on the central series of nilpotent groups. We address the two major comments point by point below, clarifying the scope of our claims (which are for each fixed G) and indicating the revisions that will be incorporated.

read point-by-point responses

  1. Referee: [Abstract and §4] Abstract and §4: The assertion that overall success probability tends to 1 in the thermodynamic limit requires each measurement round to succeed with probability p ≥ p0 > 0 independent of system size L. The hierarchical irrep structure is invoked to enable reduction, but no explicit uniform lower bound on p0 is derived that holds for arbitrary finite nilpotent groups (including those with arbitrarily long central series). This bound is load-bearing for the claim that all phases collapse with probability approaching 1.

    Authors: We agree that a uniform lower bound independent of the nilpotency class is not derived. Our statements are for each fixed finite nilpotent group G, for which the central series has finite length. For any such fixed G the protocol consists of a finite number of rounds; each round employs a symmetric measurement whose success probability p_i is bounded below by a positive constant that depends only on the dimensions of the irreps appearing in the central series of that G and is independent of L. The measurements are performed on a number of sites linear in L, so that the failure probability per round is exponentially small in L. The product over the finite number of rounds therefore yields an overall success probability that approaches 1 as L → ∞ for that fixed G. We will revise the abstract and §4 to state explicitly that p0 is G-dependent but positive and fixed for each G, and to sketch the exponential decay argument. revision: partial

  2. Referee: [§3.2, Eq. (12)] §3.2, Eq. (12): The irrep-reduction measurement is defined via projection onto the abelian quotient of the central series, but the success probability is not shown to be bounded away from zero uniformly in the nilpotency class; the argument therefore does not establish that the failure rate decays exponentially in L for every nilpotent G.

    Authors: For a fixed G the success probability of the measurement in Eq. (12) is bounded below by a positive constant determined by the representation theory of G (the squared overlap of the projected state with the abelian quotient). Because the nilpotency class is fixed, this constant is independent of L. The exponential decay of the failure probability with L follows from applying the local measurement to Θ(L) sites; the probability that every site fails is exponentially small in L. We will add to §3.2 an explicit lower bound on this success probability expressed in terms of the order of G and the dimensions of the relevant irreps, making the L-independent positivity and the exponential decay fully rigorous for each fixed G. revision: yes

Circularity Check

0 steps flagged

Minor self-citation to prior G-CMF framework; classification uses independent group representation properties

full rationale

The derivation extends the G-CMF framework from the cited Gunn et al. (2025) paper to nilpotent groups via the finite hierarchical structure of irreducible representations, a standard mathematical fact about nilpotent groups' central series. No equations or protocols reduce by construction to fitted parameters, self-definitions, or unverified self-citations. The success-probability claim is derived from the finite length of the central series enabling successive measurements, without statistical fitting or renaming of known results. The central classification of phases collapsing under G-CMF is self-contained against external group-theoretic benchmarks and does not rely on load-bearing self-referential steps.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on standard facts from finite-group representation theory plus the domain-specific assumption that nilpotent groups admit a finite hierarchy of irreps allowing stepwise reduction.

axioms (1)
  • domain assumption Finite nilpotent groups possess a finite hierarchical structure of irreducible representations that permits successive reduction of non-abelian components to abelian ones via symmetric measurements.
    Invoked to justify the explicit protocols that achieve probability approaching one.

pith-pipeline@v0.9.0 · 5481 in / 1150 out tokens · 54824 ms · 2026-05-15T21:37:00.771009+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

47 extracted references · 47 canonical work pages

  1. [1]

    J. I. Cirac, D. P´ erez-Garc´ ıa, N. Schuch, and F. Verstraete, Rev. Mod. Phys.93, 045003 (2021)

    work page 2021

  2. [2]

    Chen, Z.-C

    X. Chen, Z.-C. Gu, and X.-G. Wen, Phys. Rev. B83, 035107 (2011)

    work page 2011

  3. [3]

    Schuch, D

    N. Schuch, D. P´ erez-Garc´ ıa, and I. Cirac, Phys. Rev. B84, 165139 (2011)

    work page 2011

  4. [4]

    Chen, Z.-C

    X. Chen, Z.-C. Gu, and X.-G. Wen, Phys. Rev. B82, 155138 (2010)

    work page 2010

  5. [5]

    M. B. Hastings and X.-G. Wen, Phys. Rev. B72, 045141 (2005)

    work page 2005

  6. [6]

    Nachtergaele, R

    B. Nachtergaele, R. Sims, and A. Young, J. Math. Phys.60, 061101 (2019)

    work page 2019

  7. [7]

    Coser and D

    A. Coser and D. P´ erez-Garc´ ıa, Quantum3, 174 (2019)

    work page 2019

  8. [8]

    Raussendorf and H

    R. Raussendorf and H. J. Briegel, Phys. Rev. Lett.86, 5188 (2001)

    work page 2001

  9. [9]

    Raussendorf, S

    R. Raussendorf, S. Bravyi, and J. Harrington, Phys. Rev. A71, 062313 (2005)

    work page 2005

  10. [10]

    Aguado, G

    M. Aguado, G. Brennen, F. Verstraete, and J. I. Cirac, Phys. Rev. Lett.101, 260501 (2008)

    work page 2008

  11. [11]

    Meignant, D

    C. Meignant, D. Markham, and F. Grosshans, Phys. Rev. A100, 052333 (2019)

    work page 2019

  12. [12]

    A. B. Watts, R. Kothari, L. Schaeffer, and A. Tal, inProc. Annu. ACM Symp. Theory Comput., STOC ’19 (ACM, 2019) p. 515–526

    work page 2019

  13. [13]

    Piroli, G

    L. Piroli, G. Styliaris, and J. I. Cirac, Phys. Rev. Lett.127, 220503 (2021)

    work page 2021

  14. [14]

    Chitambar, D

    E. Chitambar, D. Leung, L. Manˇ cinska, M. Ozols, and A. Winter, Commun. Math. Phys. 328, 303 (2014)

    work page 2014

  15. [15]

    Lootens and C

    L. Lootens and C. Delcamp and D. Williamson and F. Verstraete, Phys. Rev. Lett.134, 130403 (2025)

    work page 2025

  16. [16]

    D. T. Stephen and O. Hart, Phys. Rev. B112, 235127 (2025)

    work page 2025

  17. [17]

    K. C. Smith, A. Khan, B. K. Clark, S. M. Girvin, and T.-C. Wei, PRX Quantum5, 030344 (2024)

    work page 2024

  18. [18]

    Sahay and R

    R. Sahay and R. Verresen, PRX Quantum6, 010329 (2025)

    work page 2025

  19. [19]

    D. Malz, G. Styliaris, Z.-Y. Wei, and J. I. Cirac, Phys. Rev. Lett.132, 040404 (2024)

    work page 2024

  20. [20]

    Tantivasadakarn, R

    N. Tantivasadakarn, R. Thorngren, A. Vish- wanath, and R. Verresen, Phys. Rev. X14, 021040 (2024)

    work page 2024

  21. [21]

    Bravyi, I

    S. Bravyi, I. Kim, A. Kliesch, and R. Koenig, arXiv:2205.01933 (2022)

    work page arXiv 2022

  22. [22]

    T.-C. Lu, L. A. Lessa, I. H. Kim, and T. H. Hsieh, PRX Quantum3, 040337 (2022)

    work page 2022

  23. [23]

    Tantivasadakarn, A

    N. Tantivasadakarn, A. Vishwanath, and R. Ver- resen, PRX Quantum4, 020339 (2023)

    work page 2023

  24. [24]

    Y. Li, H. Sukeno, A. P. Mana, H. P. Nautrup, and T.-C. Wei, Phys. Rev. B108, 115144 (2023)

    work page 2023

  25. [25]

    Zhang, S

    Y. Zhang, S. Gopalakrishnan, and G. Styliaris, PRX Quantum5, 040304 (2024)

    work page 2024

  26. [26]

    Y. Ren, N. Tantivasadakarn, and D. J. Williamson, Phys. Rev. X15, 031060 (2025)

    work page 2025

  27. [27]

    Foss-Feig, A

    M. Foss-Feig, A. Tikku, T.-C. Lu, K. Mayer, M. Iqbal, T. M. Gatterman, J. A. Gerber, K. Gilmore, D. Gresh, A. Hankin,et al., arXiv:2302.03029 (2023)

    work page arXiv 2023

  28. [28]

    Iqbal, N

    M. Iqbal, N. Tantivasadakarn, R. Verresen, S. L. Campbell, J. M. Dreiling, C. Figgatt, J. P. Gae- bler, J. Johansen, M. Mills, S. A. Moses,et al., Nature626, 505 (2024)

    work page 2024

  29. [29]

    E. H. Chen, G.-Y. Zhu, R. Verresen, A. Seif, E. B¨ aumer, D. Layden, N. Tantivasadakarn, G. Zhu, S. Sheldon, A. Vishwanath,et al., Nat. Phys.21, 161 (2025)

    work page 2025

  30. [30]

    D. Gunn, G. Styliaris, T. Kraft, and B. Kraus, Phys. Rev. B111(2025)

    work page 2025

  31. [31]

    Gelaki and D

    S. Gelaki and D. Nikshych, Adv. Math.217, 1053 (2008)

    work page 2008

  32. [32]

    J. I. Cirac, D. P´ erez-Garc´ ıa, N. Schuch, and F. Verstraete, Ann. Phys.378, 100 (2017)

    work page 2017

  33. [33]

    Fannes, B

    M. Fannes, B. Nachtergaele, and R. F. Werner, Commun. Math. Phys.144, 443 (1992)

    work page 1992

  34. [34]

    Perez-Garcia, F

    D. Perez-Garcia, F. Verstraete, M. M. Wolf, and J. I. Cirac, Quantum Info. Comput.7, 401 (2007)

    work page 2007

  35. [35]

    Pollmann, A

    F. Pollmann, A. M. Turner, E. Berg, and M. Os- hikawa, Phys. Rev. B81, 064439 (2010)

    work page 2010

  36. [36]

    M. Sanz, M. M. Wolf, D. P´ erez-Garc´ ıa, and J. I. Cirac, Phys. Rev. A79, 042308 (2009)

    work page 2009

  37. [37]

    The second cohomology group of a given sub- group,H≤G, is a group property ofH

    work page

  38. [38]

    Combination here is achieved by introducing an auxiliary site and using a low-depth circuit con- sisting of SWAP gates to exchange the auxiliary system with one of the measured sites

    work page

  39. [39]

    I. M. Isaacs,Character theory of finite groups, AMS Chelsea Publishing (American Mathemat- ical Society, Providence, RI, 2006)

    work page 2006

  40. [40]

    D. S. Dummit and R. M. Foote,Abstract Algebra (John Wiley & Sons, 2003)

    work page 2003

  41. [41]

    Serre,Linear Representations of Finite Groups(Springer New York, 1977)

    J.-P. Serre,Linear Representations of Finite Groups(Springer New York, 1977)

    work page 1977

  42. [42]

    Karpilovsky,Group Representations, Group Representations No

    G. Karpilovsky,Group Representations, Group Representations No. Bd. 3 (Elsevier Science, 1994)

    work page 1994

  43. [43]

    Hence, the outcomes on the firstN−1 sites determine the outcome of the last measure- ment

    The reason for that is that if the outcomes would multiply to any other equivalence class, then the projector onto it would be orthogonal to the in- put state. Hence, the outcomes on the firstN−1 sites determine the outcome of the last measure- ment. Note that a simple example of such a parity constraint is given in [30]

    work page

  44. [44]

    Bereg, A

    S. Bereg, A. E. Holroyd, L. Nachmanson, and S. Pupyrev, SIAM J. Discrete Math.30, 1950 (2016)

    work page 1950

  45. [45]

    As an example, consider the string(1,0,...,0,1). If sufficiently large, this outcome contains anL(1) substring, but due to periodicity the first and last 16 site are nearest neighbors, and thus can be paired using a single SWAP gate

    work page

  46. [46]

    M. F. Schilling, Coll. Math. J.21, 196 (1990)

    work page 1990

  47. [47]

    Each conjugacy class is a set of elements

    We use italics label to indicate conjugacy classes. Each conjugacy class is a set of elements. The number of the label indicates the order of the elements in the class and the letter labels the different conjugacy classes with the same order. A Group structure of irreps of nilpotent groups In this appendix, we show that the groups defined in the main text...

    work page