pith. machine review for the scientific record. sign in

arxiv: 2604.09766 · v1 · submitted 2026-04-10 · 🪐 quant-ph

Recognition: unknown

Sector length distributions of recursively definable graph states through analytic combinatorics

Elo\"ic Vall\'ee , Kenneth Goodenough , Paul E. Gunnells , Tim Coopmans , Jordi Tura
Authors on Pith no claims yet

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

classification 🪐 quant-ph
keywords sector length distributionShor-Laflamme distributiongraph statesgenerating functionsanalytic combinatoricsconcentratable entanglementmultipartite entanglementdepolarizing noise
0
0 comments X

The pith

Closed-form sector length distributions exist for recursively definable graph states via generating functions

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

The paper establishes that sector length distributions of graph states can be encoded as generating functions whose coefficients capture the k-body correlations. For the class of recursively definable graph states, which includes paths, cycles, stars, grids and similar structures, analytic combinatorics yields closed-form expressions for these coefficients. A sympathetic reader would care because the sector length distribution is otherwise computationally hard to obtain for individual states, yet here it directly supplies analytical results for entanglement measures and noise bounds across entire families. This shifts the problem from per-state calculation to extraction from a single generating function.

Core claim

We encode families of graph states' sector length distributions as generating functions and derive closed-form expressions for recursively definable graph states such as path, cycle, star, and grid graphs. As a direct corollary, analytical expressions follow for concentratable entanglement, bounds on depolarizing fidelity, and a multipartite entanglement criterion.

What carries the argument

Generating functions whose coefficients are the sector length distributions of recursively definable graph states, extracted via analytic combinatorics

If this is right

  • Analytical expressions for concentratable entanglement become available for all listed recursively definable graph states.
  • Explicit upper and lower bounds on fidelity under depolarizing noise follow for these states.
  • A criterion for detecting multipartite entanglement applies directly to the same families.
  • Sector length distributions for path, cycle, star, grid, and related graphs are given by closed formulas rather than enumeration.

Where Pith is reading between the lines

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

  • The generating-function technique could extend to other structured quantum states whose correlation patterns admit recursive descriptions.
  • Large-system entanglement calculations for these graph families may become feasible without exponential cost.
  • Similar analytic-combinatorics encodings might apply to other hard-to-compute quantum information quantities such as certain entanglement monotones.

Load-bearing premise

That a family of graph states can be encoded as a generating function whose coefficients are exactly the sector length distributions and whose recursive structure permits closed-form coefficient extraction.

What would settle it

Exact numerical computation of the sector length distribution for a small recursively definable graph state such as the 5-qubit path or 3-by-3 grid, followed by direct comparison to the closed-form expression obtained from the corresponding generating function.

Figures

Figures reproduced from arXiv: 2604.09766 by Elo\"ic Vall\'ee, Jordi Tura, Kenneth Goodenough, Paul E. Gunnells, Tim Coopmans.

Figure 1
Figure 1. Figure 1: FIG. 1: The generating function of the path graph can [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2: “Cut-and-glue” construction. The cycle graph [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3: Examples of recursively defined graphs. (a) [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4: Difference between exact and approximated [PITH_FULL_IMAGE:figures/full_fig_p009_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5: Critical noise parameter [PITH_FULL_IMAGE:figures/full_fig_p010_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6: The path, star, and cycle graph families are [PITH_FULL_IMAGE:figures/full_fig_p013_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: FIG. 7: Each colouring in the third case can be [PITH_FULL_IMAGE:figures/full_fig_p016_7.png] view at source ↗
read the original abstract

The sector length distribution or Shor-Laflamme distribution (SLD) of quantum states is governed by the $k$-body correlations amongst the different systems, and has been used to study entanglement and error correction. A succinct description of a quantum state's SLD can be obtained by representing it through the coefficients of an appropriate weight enumerator polynomial, yielding bounds on fidelity under depolarizing noise and on multipartite entanglement. However, such expressions quickly grow out of hand and are generally difficult to achieve analytically, reflecting the computational hardness of the SLD. We sidestep this problem and, instead of a single state's SLDs, encode a family of quantum state's SLD as a generating function. We then find closed-form expressions for a large class of graph states which we call `recursively definable' and which include many common graphs such as path graphs, cycle graphs, star graphs, grid graphs, and more. As direct corollary, we obtain analytical expressions for such graph states' concentratable entanglement, bounds on their depolarizing fidelity, and a multipartite entanglement criterion. Our work opens up the use of generating functions and more generally analytic combinatorics to solve problems in quantum information theory.

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

0 major / 3 minor

Summary. The paper encodes the sector-length distributions (SLD) of families of graph states as generating functions whose coefficients recover the SLD, then applies analytic combinatorics to extract closed-form expressions for the class of recursively definable graphs (paths, cycles, stars, grids, etc.). Corollaries include closed forms for concentratable entanglement, depolarizing-noise fidelity bounds, and a multipartite entanglement criterion.

Significance. If the derivations hold, the work is significant: it supplies analytical SLD expressions for a broad, practically relevant class of graph states where direct computation is hard, and demonstrates that analytic combinatorics can be imported into quantum information while preserving stabilizer and purity constraints by construction. The parameter-free character of the encoding (no ad-hoc fitting) is a clear strength.

minor comments (3)
  1. [Abstract] Abstract: the phrase 'closed-form expressions' is used without indicating the form of the expressions or the graphs for which they are first derived; a single concrete example (e.g., the path-graph SLD) would make the claim immediately verifiable.
  2. [Main construction] The recursive definition of the graph family and the corresponding kernel equation for the generating function should be stated with explicit initial conditions so that the extraction step can be reproduced without ambiguity.
  3. [Results] Add a short table or paragraph comparing the new closed forms against direct enumeration for small n (e.g., n=4,5) to confirm numerical agreement.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of our manuscript, accurate summary of the contributions, and recommendation for minor revision. We are pleased that the significance of applying analytic combinatorics to sector-length distributions of graph states was recognized.

Circularity Check

0 steps flagged

No significant circularity in the derivation chain

full rationale

The paper defines recursively definable graph states via their recursive graph structure, encodes the family of SLDs as coefficients of a generating function whose equation follows directly from that recursion, and applies standard analytic combinatorics (linear recurrences or kernel methods) to extract explicit closed forms for paths, cycles, stars, grids and similar families. The stabilizer formalism and purity constraints are preserved by the weight-enumerator construction without introducing additional fitted parameters or self-referential conditions. No load-bearing self-citations, uniqueness theorems imported from the authors' prior work, or ansatzes smuggled via citation appear in the central extraction step; the mapping from graph recursion to generating-function equation is independent of the target coefficient values. The derivation is therefore self-contained and does not reduce to its inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review; no explicit free parameters, axioms, or invented entities are stated. The recursive definability of the graph family is treated as given.

pith-pipeline@v0.9.0 · 5521 in / 1050 out tokens · 26649 ms · 2026-05-10T16:31:34.508117+00:00 · methodology

discussion (0)

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

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Detecting entanglement from few partial transpose moments and their decay via weight enumerators

    quant-ph 2026-04 unverdicted novelty 6.0

    Entanglement is certified if any three PT moments satisfy p_l > p_k^x p_m^{1-x} with x=(m-l)/(m-k), and quantum weight enumerators describe moment decay under local noise.

Reference graph

Works this paper leans on

36 extracted references · 12 canonical work pages · cited by 1 Pith paper · 2 internal anchors

  1. [1]

    Horodecki, P

    R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki, Quantum entanglement, Reviews of Mod- ern Physics81, 865 (2009)

    2009

  2. [2]

    Stabilizer Codes and Quantum Error Correction

    D. Gottesman, Stabilizer Codes and Quantum Error Cor- rection (1997), arXiv:quant-ph/9705052

    work page internal anchor Pith review arXiv 1997

  3. [3]

    Shor and R

    P. Shor and R. Laflamme, Quantum Analog of the MacWilliams Identities for Classical Coding Theory, Physical Review Letters78, 1600 (1997)

    1997

  4. [4]

    Goodenough, S

    K. Goodenough, S. de Bone, V. Addala, S. Krastanov, S. Jansen, D. Gijswijt, and D. Elkouss, Near-Term n to k Distillation Protocols Using Graph Codes, IEEE Journal on Selected Areas in Communications42, 1830 (2024)

    2024

  5. [5]

    Learning stabilizer states by Bell sampling

    A. Montanaro, Learning stabilizer states by Bell sam- pling (2017), arXiv:1707.04012 [quant-ph]

    work page Pith review arXiv 2017

  6. [6]

    Milleret al., Experimental measurement and a physi- 11 cal interpretation of quantum shadow enumerators (2024), arXiv:2408.16914

    D. Miller, K. Levi, L. Postler, A. Steiner, L. Bittel, G. A. L. White, Y. Tang, E. J. Kuehnke, A. A. Mele, S. Khatri, L. Leone, J. Carrasco, C. D. Marciniak, I. Pogorelov, M. Guevara-Bertsch, R. Freund, R. Blatt, P. Schindler, T. Monz, M. Ringbauer, and J. Eisert, Ex- perimental measurement and a physical interpretation of quantum shadow enumerators (2024...

    work page arXiv 2024

  7. [7]

    Klöckl and M

    C. Klöckl and M. Huber, Characterizing multipartite en- tanglementwithoutsharedreferenceframes,PhysicalRe- view A91, 042339 (2015), arXiv:1411.5399 [quant-ph]

    work page arXiv 2015

  8. [8]

    Miller, D

    D. Miller, D. Loss, I. Tavernelli, H. Kampermann, D. Bruß, and N. Wyderka, Shor-Laflamme distributions of graph states and noise robustness of entanglement, Journal of Physics A: Mathematical and Theoretical56, 335303 (2023), arXiv:2207.07665 [quant-ph]

    work page arXiv 2023

  9. [9]

    Serrano-Ensástiga, O

    E. Serrano-Ensástiga, O. Giraud, and J. Martin, Mul- tiqubit monogamy relations beyond shadow inequalities (2025), arXiv:2507.12680 [quant-ph]

    work page arXiv 2025

  10. [10]

    Huber, O

    F. Huber, O. Gühne, and J. Siewert, Absolutely Maxi- mally Entangled States of Seven Qubits Do Not Exist, Physical Review Letters118, 200502 (2017)

    2017

  11. [11]

    Wyderka and O

    N. Wyderka and O. Gühne, Characterizing quan- tum states via sector lengths, Journal of Physics A: Mathematical and Theoretical53, 345302 (2020), arXiv:1905.06928 [quant-ph]

    work page arXiv 2020

  12. [12]

    C.Cao, M.J.Gullans, B.Lackey,andZ.Wang,Quantum Lego Expansion Pack: Enumerators from Tensor Net- works, PRX Quantum5, 030313 (2024)

    2024

  13. [13]

    R. P. Stanley,Enumerative Combinatorics, Cambridge Studies in Advanced Mathematics, Vol. 1 (Cambridge University Press, Cambridge, 1997)

    1997

  14. [14]

    Flajolet and R

    P. Flajolet and R. Sedgewick,Analytic Combinatorics (Cambridge Univ. Press, Cambridge, 2009)

    2009

  15. [15]

    Thomas, L

    P. Thomas, L. Ruscio, O. Morin, and G. Rempe, Efficient generation of entangled multiphoton graph states from a single atom, Nature608, 677 (2022)

    2022

  16. [16]

    Thomas, L

    P. Thomas, L. Ruscio, O. Morin, and G. Rempe, Fusion of deterministically generated photonic graph states, Na- ture629, 567 (2024)

    2024

  17. [17]

    Aqua and B

    Z. Aqua and B. Dayan, Atom-Mediated Deterministic GenerationandStitchingofPhotonicGraphStates,PRX Quantum6, 010340 (2025)

    2025

  18. [18]

    M. Hein, J. Eisert, and H. J. Briegel, Multiparty entan- glement in graph states, Physical Review A69, 062311 (2004)

    2004

  19. [19]

    M. Hein, W. Dür, J. Eisert, R. Raussendorf, M. V. den Nest, and H.-J. Briegel, Entanglement in Graph States 12 and its Applications (2006), arXiv:quant-ph/0602096

    work page Pith review arXiv 2006

  20. [20]

    Van den Nest, Measurement-based quantum compu- tation, Nature Physics5, 19 (2009)

    H.J.Briegel, D.E.Browne, W.Dür, R.Raussendorf,and M. Van den Nest, Measurement-based quantum compu- tation, Nature Physics5, 19 (2009)

    2009

  21. [21]

    Meignant, D

    C. Meignant, D. Markham, and F. Grosshans, Distribut- ing graph states over arbitrary quantum networks, Phys- ical Review A100, 052333 (2019)

    2019

  22. [22]

    Aschauer, J

    H. Aschauer, J. Calsamiglia, M. Hein, and H. J. Briegel, Local invariants for multi-partite entangled states al- lowing for a simple entanglement criterion (2004), arXiv:quant-ph/0306048

    work page arXiv 2004

  23. [23]

    Z. J. Wang, J. C. A. Casapao, N. Benchasattabuse, A. G. Maity, J. Tura, A. Soeda, M. Hajdušek, R. V. Meter, and D. Elkouss, Efficient graph-diagonal characterization of noisy states distributed over quantum networks via Bell sampling (2025), arXiv:2512.06650 [quant-ph]

    work page arXiv 2025

  24. [24]

    Goodenough, A

    K. Goodenough, A. Sajjad, E. Kaur, S. Guha, and D. Towsley, Bipartite Entanglement of Noisy Stabilizer States Through the Lens of Stabilizer Codes, in2024 IEEE International Symposium on Information Theory (ISIT)(2024) pp. 545–550

    2024

  25. [25]

    Goodenough, T

    K. Goodenough, T. Coopmans, and D. Towsley, On noise in swap ASAP repeater chains: Exact analytics, distribu- tions and tight approximations, Quantum9, 1744 (2025)

    2025

  26. [26]

    F. E. Hohn,Elementary matrix algebra(Courier Corpo- ration, 2002)

    2002

  27. [27]

    Goodenough and P

    K. Goodenough and P. E. Gunnels, Black-white polyno- mialsofgraphsandgeneratingfunctions(2026),inprepa- ration

    2026

  28. [28]

    Vallee, Supporting code repository,https://gitlab

    E. Vallee, Supporting code repository,https://gitlab. com/elo_val/recursive-graphstates-gf(2026)

    2026

  29. [29]

    X. Liu, J. Knörzer, Z. J. Wang, and J. Tura, Generalized concentratable entanglement via parallelized permuta- tion tests, Physical Review Research7, L032022 (2025)

    2025

  30. [30]

    J. L. Beckey, N. Gigena, P. J. Coles, and M. Cerezo, Computable and Operationally Meaningful Multipartite Entanglement Measures, Physical Review Letters127, 140501 (2021)

    2021

  31. [31]

    Buhrman, R

    H. Buhrman, R. Cleve, J. Watrous, and R. De Wolf, Quantum Fingerprinting, Physical Review Letters87, 167902 (2001)

    2001

  32. [32]

    A. R. Cullen and P. Kok, Calculating concentratable entanglement in graph states, Physical Review A106, 042411 (2022)

    2022

  33. [33]

    Bruss, L

    D. Bruss, L. Faoro, C. Macchiavello, and M. Palma, Quantum entanglement and classical communication through a depolarising channel, Journal of Modern Op- tics47, 325 (2000), arXiv:quant-ph/9903033

    work page arXiv 2000

  34. [34]

    Phase Transitions and Noise Robustness of Quantum Graph States

    T. Numajiri, S. Yamashika, T. Tanizawa, R. Yoshii, Y. Takeuchi, and S. Tsuchiya, Phase Transitions and Noise Robustness of Quantum Graph States (2025), arXiv:2510.00548 [quant-ph]. Appendix A: Transfer matrix formalism for the cycle graph We detail here the derivation of the transfer matrix and the generating function of cycle graphs. Recall that for ann-...

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  35. [35]

    products of the allX- string, and even weight Pauli strings containing onlyI andZ

    Combinatorial description of the star graph GF Up to local rotations, the stabilizers of the star graph are those of the GHZ state, i.e. products of the allX- string, and even weight Pauli strings containing onlyI andZ. Split these stabilizers into two types: those that are even weight Pauli stringsI, Zstrings, and those that are not. Note that those stab...

  36. [36]

    For the first case, we consider the contributions when all the vertices are white, from which we find from Equation (D3) that it is given by 1 1−xz

    Combinatorial description of the cycle graph GF The enumeration of the colourings of the cycle graph family can be divided into three cases. For the first case, we consider the contributions when all the vertices are white, from which we find from Equation (D3) that it is given by 1 1−xz. For the second case, we look at the contribution from colourings wi...