pith. sign in

arxiv: 2606.06582 · v2 · pith:3CHKWZWRnew · submitted 2026-06-04 · 🪐 quant-ph · hep-th

Fun with Graph States: Nonlocal Bell Pairs and the Arf Invariant

Bartlomiej Czech , Yichen Feng , Xianlai Wu , Minjun Xie This is my paper

Pith reviewed 2026-06-28 00:38 UTC · model grok-4.3

classification 🪐 quant-ph hep-th
keywords graph statesArf invariantBell pairsadjacency matrixquadratic refinementmeasurement-based quantum computationtensor factorization
0
0 comments X

The pith

Graph states factor nonlocally into Bell pairs, with magnitudes set by the rank of the adjacency matrix over F_2 and phases by the Arf invariant.

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

The paper shows that inner products and partial amplitudes of graph states have magnitudes determined by the rank of their adjacency matrix over the field with two elements. The phase of these inner products is fixed by the Arf invariant of a quadratic refinement of the graph. This structure implies that the Hilbert space can be factored in a nonlocal way so that every graph state appears as a product of Bell pairs plus some unentangled qubits. Such a factorization could clarify how graph states enable measurement-based quantum computation and support a topological view of these states.

Core claim

Inner products and partial amplitudes of graph states have magnitudes given by the rank of the adjacency matrix over F_2 and phases given by the Arf invariant of its quadratic refinement. This leads to a nonlocal tensor factorization of the Hilbert space in which all graph states are products of Bell pairs with unentangled ancillae.

What carries the argument

The Arf invariant of the quadratic refinement of the graph's adjacency matrix over F_2, which sets the phase and enables the Bell-pair factorization of graph states.

If this is right

  • All graph states appear as products of Bell pairs and unentangled ancillae in the nonlocal factorization.
  • The factorization may clarify the source of quantum advantage in measurement-based quantum computation.
  • A specialized technique allows computation of expectation values for qubit-wise permutations in graph states.
  • Graph states admit a visualization in the language of algebraic topology.

Where Pith is reading between the lines

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

  • The same rank and Arf-invariant structure might extend to other families of entangled states.
  • The factorization could suggest efficient preparation or simulation protocols for graph states.
  • Links between quantum states and quadratic forms over finite fields may produce additional multipartite invariants.

Load-bearing premise

Every graph admits a quadratic refinement whose Arf invariant directly controls the phase of the inner product.

What would settle it

Compute the inner product of two small graph states and verify whether its magnitude equals the rank of the adjacency matrix over F_2 and its phase equals the Arf invariant of the quadratic refinement.

read the original abstract

We study inner products and partial amplitudes of graph states--a commonly employed class of quantum states, which are specified by graphs. We find that the magnitudes of these quantities are simply related to the rank of the adjacency matrix of the graph over F_2 while the phase is determined by the Arf invariant of its quadratic refinement. These facts motivate a nonlocal tensor factorization of the Hilbert space, with respect to which all graph states are products of Bell pairs with unentangled ancillae. These results may illuminate the quantum advantage in the framework of Measurement-Based Quantum Computation and suggest that graph states can be usefully visualized in the language of algebraic topology. In addition, we develop a specialized technique for computing expectation values of qubit-wise permutations in graph states, which is useful for calculating multi-invariants.

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

1 major / 2 minor

Summary. The paper claims that the magnitudes of inner products and partial amplitudes of graph states are determined by the rank of the adjacency matrix over F_2, while the phase is given by the Arf invariant of a quadratic refinement of the associated bilinear form. This leads to a nonlocal tensor factorization of the Hilbert space in which all graph states appear as products of Bell pairs with unentangled ancillae. The work also introduces a technique for computing expectation values of qubit-wise permutations in graph states.

Significance. If the relations hold with a canonically defined quadratic refinement that reproduces the phases from the standard graph-state construction, the results would provide a novel algebraic-topological perspective on graph-state entanglement. The Bell-pair factorization could illuminate the structure underlying measurement-based quantum computation. The permutation technique is a practical contribution for calculating multi-invariants.

major comments (1)
  1. [Abstract, paragraph 2] Abstract, paragraph 2: The central claim relies on the phase being determined by the Arf invariant of 'its' quadratic refinement. However, over F_2, symmetric bilinear forms admit multiple quadratic refinements with potentially different Arf invariants. The manuscript must specify the canonical choice of q from the graph (or pair of graphs) that guarantees agreement with the phase arising from |G> = ∏ CZ |+>^n. Without this explicit rule, the claimed factorization into Bell pairs does not necessarily follow.
minor comments (2)
  1. The abstract mentions 'partial amplitudes' without defining them; clarify this term early in the manuscript.
  2. Consider adding a small example graph with explicit computation of the inner product, rank, and Arf to illustrate the main result.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading and valuable comments on our manuscript. We address the major comment below.

read point-by-point responses

  1. Referee: [Abstract, paragraph 2] Abstract, paragraph 2: The central claim relies on the phase being determined by the Arf invariant of 'its' quadratic refinement. However, over F_2, symmetric bilinear forms admit multiple quadratic refinements with potentially different Arf invariants. The manuscript must specify the canonical choice of q from the graph (or pair of graphs) that guarantees agreement with the phase arising from |G> = ∏ CZ |+>^n. Without this explicit rule, the claimed factorization into Bell pairs does not necessarily follow.

    Authors: We agree that an explicit canonical rule for selecting the quadratic refinement q is required for rigor. In the graph-state construction |G⟩ = ∏_{(i,j)∈E} CZ_{ij} |+⟩^{\otimes n}, the quadratic form q is the one canonically induced by the adjacency matrix A over F_2 together with the standard choice of diagonal (zero) that reproduces the CZ phases; this is the unique refinement whose associated Arf invariant matches the inner-product phases computed directly from the state vector. We will revise the manuscript (both abstract and main text) to state this rule explicitly, including a short derivation showing agreement with the standard construction. This addition will also clarify the link to the Bell-pair factorization. revision: yes

Circularity Check

0 steps flagged

No circularity; derivation self-contained from graph-state definition

full rationale

The paper derives the claimed relations between inner-product magnitudes/phases and rank/Arf invariants directly from the standard definition |G> = ∏ CZ |+>^n and the algebraic properties of the adjacency matrix over F_2. No load-bearing step reduces to a fitted parameter renamed as prediction, a self-citation chain, or an ansatz smuggled via prior work by the same authors. The nonlocal factorization is presented as a consequence of these derived facts rather than an input. The provided abstract and context contain no self-citations that justify the central claims, and the results are not equivalent to the inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

Abstract-only review; no free parameters, invented entities, or non-standard axioms are visible. The central relations rest on the standard definition of graph states and the existence of a quadratic refinement.

axioms (2)
  • domain assumption Graph states are defined by the adjacency matrix of an undirected graph in the standard stabilizer formalism.
    Invoked implicitly when the paper states that graph states are specified by graphs.
  • domain assumption Every graph admits a quadratic refinement whose Arf invariant controls the phase of inner products.
    Stated in the second sentence of the abstract as the source of the phase.

pith-pipeline@v0.9.1-grok · 5668 in / 1352 out tokens · 27985 ms · 2026-06-28T00:38:24.623820+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

37 extracted references · 12 linked inside Pith

  1. [1]

    Schlingemann and R.F

    D. Schlingemann and R.F. Werner,Quantum error-correcting codes associated with graphs, Phys. Rev. A65(2001) 012308 [quant-ph/0012111]

    Pith/arXiv arXiv 2001

  2. [2]

    Schlingemann,Stabilizer codes can be realized as graph codes,quant-ph/0111080

    D. Schlingemann,Stabilizer codes can be realized as graph codes,quant-ph/0111080

    Pith/arXiv arXiv

  3. [3]

    Raussendorf and H.J

    R. Raussendorf and H.J. Briegel,A one-way quantum computer,Phys. Rev. Lett.86(2001) 5188

    2001

  4. [4]

    Raussendorf, D.E

    R. Raussendorf, D.E. Browne and H.J. Briegel,Measurement-based quantum computation on cluster states,Phys. Rev. A68(2003) 022312 [quant-ph/0301052]

    Pith/arXiv arXiv 2003

  5. [5]

    Baccari, R

    F. Baccari, R. Augusiak, I. Šupić, J. Tura and A. Acín,Scalable Bell inequalities for qubit graph states and robust self-testing,Phys. Rev. Lett.124(2020) 020402 [1812.10428]

    arXiv 2020

  6. [6]

    Zhao and Y

    Q. Zhao and Y. Zhou,Constructing multipartite Bell inequalities from stabilizers,Phys. Rev. Res.4(2022) 043215 [2002.01843]

    arXiv 2022

  7. [7]

    Hayden and J

    P. Hayden and J. Preskill,Black holes as mirrors: Quantum information in random subsystems,JHEP09(2007) 120 [0708.4025]

    Pith/arXiv arXiv 2007

  8. [8]

    Yoshida,Recovery algorithms for Clifford Hayden-Preskill problem,2106.15628

    B. Yoshida,Recovery algorithms for Clifford Hayden-Preskill problem,2106.15628

    arXiv

  9. [9]

    Raza, A.N

    M.A. Raza, A.N. Alahmadi, W. Basaffar, D.G. Glynn, M.K. Gupta, J.W.P. Hirschfeld et al., The quantum states of a graph,Mathematics11(2023)

    2023

  10. [10]

    Akella, A

    S. Akella, A. Gadde and J. Pandey,Multi-invariants in stabilizer states,2601.16258

    arXiv

  11. [11]

    Arf,Untersuchungen über quadratische formen in körpern der charakteristik 2

    C. Arf,Untersuchungen über quadratische formen in körpern der charakteristik 2. (teil i.)., Journal für die reine und angewandte Mathematik183(1941) 148

    1941

  12. [12]

    Dye,On the Arf invariant,Journal of Algebra53(1978) 36–39

    R. Dye,On the Arf invariant,Journal of Algebra53(1978) 36–39

    1978

  13. [13]

    Gadde, V

    A. Gadde, V. Krishna and T. Sharma,New multipartite entanglement measure and its holographic dual,Phys. Rev. D106(2022) 126001 [2206.09723]

    arXiv 2022

  14. [14]

    Penington, M

    G. Penington, M. Walter and F. Witteveen,Fun with replicas: Tripartitions in tensor networks and gravity,JHEP05(2023) 008 [2211.16045]

    arXiv 2023

  15. [15]

    Gadde, J

    A. Gadde, J. Harper and V. Krishna,Multi-invariants and bulk replica symmetry,JHEP06 (2025) 116 [2411.00935]

    arXiv 2025

  16. [16]

    Nielsen and I.L

    M.A. Nielsen and I.L. Chuang,Quantum Computation and Quantum Information: 10th Anniversary Edition, Cambridge University Press, Cambridge (2010). – 40 –

    2010

  17. [17]

    M.V.d. Nest, J. Dehaene and B.D. Moor,Graphical description of the action of local Clifford transformations on graph states,Phys. Rev. A69(2004) 022316 [quant-ph/0308151]

    Pith/arXiv arXiv 2004

  18. [18]

    M. Hein, W. Dür, J. Eisert, R. Raussendorf, M. Van den Nest and H.J. Briegel, Entanglement in graph states and its applications, [quant-ph/0602096]

    Pith/arXiv arXiv

  19. [19]

    Diestel,Graph Theory, Electronic library of mathematics, Springer (2005)

    R. Diestel,Graph Theory, Electronic library of mathematics, Springer (2005)

    2005

  20. [20]

    Atiyah,Riemann surfaces and spin structures,Annales scientifiques de l’École Normale SupérieureSer

    M.F. Atiyah,Riemann surfaces and spin structures,Annales scientifiques de l’École Normale SupérieureSer. 4, 4(1971) 47

    1971

  21. [21]

    Cimasoni and N

    D. Cimasoni and N. Reshetikhin,Dimers on surface graphs and spin structures. I,Commun. Math. Phys.275(2007) 187 [math-ph/0608070]

    Pith/arXiv arXiv 2007

  22. [22]

    Kapustin, R

    A. Kapustin, R. Thorngren, A. Turzillo and Z. Wang,Fermionic symmetry protected topological phases and cobordisms,JHEP12(2015) 052 [1406.7329]

    Pith/arXiv arXiv 2015

  23. [23]

    Karch, D

    A. Karch, D. Tong and C. Turner,A web of 2d dualities:Z2 gauge fields and Arf invariants, SciPost Phys.7(2019) 007 [1902.05550]

    arXiv 2019

  24. [24]

    Shiozaki, H

    K. Shiozaki, H. Shapourian and S. Ryu,Many-body topological invariants in fermionic symmetry-protected topological phases: Cases of point group symmetries,Phys. Rev. B95 (2017) 205139 [1609.05970]

    Pith/arXiv arXiv 2017

  25. [25]

    D.V. Else, I. Schwarz, S.D. Bartlett and A.C. Doherty,Symmetry-protected phases for measurement-based quantum computation,Phys. Rev. Lett.108(2012) 240505 [1201.4877]

    Pith/arXiv arXiv 2012

  26. [26]

    G. Wong, R. Raussendorf and B. Czech,The gauge theory of measurement-based quantum computation,Quantum8(2024) 1397 [2207.10098]

    arXiv 2024

  27. [27]

    Harper, T

    J. Harper, T. Takayanagi and T. Tsuda,Multi-entropy at low Rényi index in 2d CFTs, SciPost Phys.16(2024) 125 [2401.04236]

    arXiv 2024

  28. [28]

    Harper, A

    J. Harper, A. Mollabashi, T. Takayanagi and K. Tasuki,Multientropy and the dihedral measures at quantum critical points,Phys. Rev. Res.7(2025) 043194 [2506.10396]

    arXiv 2025

  29. [29]

    M.V.d. Nest, W. Dür, G. Vidal and H.J. Briegel,Classical simulation versus universality in measurement based quantum computation,Phys. Rev. A75(2007) 012337 [quant-ph/0608060]

    Pith/arXiv arXiv 2007

  30. [30]

    Raussendorf, J

    R. Raussendorf, J. Harrington and K. Goyal,A fault-tolerant one-way quantum computer, Annals Phys.321(2006) 2242 [quant-ph/0510135]

    Pith/arXiv arXiv 2006

  31. [31]

    The topology of quantum computations: Insights from measurement-based quantum computation

    B. Czech and Y. Feng, “The topology of quantum computations: Insights from measurement-based quantum computation.”In progress

  32. [32]

    Farb and D

    B. Farb and D. Margalit,A Primer on Mapping Class Groups, Princeton University Press, Princeton (2012)

    2012

  33. [33]

    Wong,Edge modes, extended TQFT, and measurement-based quantum computation, JHEP06(2025) 205 [2312.00605]

    G. Wong,Edge modes, extended TQFT, and measurement-based quantum computation, JHEP06(2025) 205 [2312.00605]

    arXiv 2025

  34. [34]

    Multi-entropy of tree graph states

    B. Czech, Y. Feng, J. Harper and X.-X. Ju, “Multi-entropy of tree graph states.”In progress

  35. [35]

    Gadde, S

    A. Gadde, S. Jain, V. Krishna, H. Kulkarni and T. Sharma,Monotonicity conjecture for multi-party entanglement. Part I,JHEP02(2024) 025 [2308.16247]

    arXiv 2024

  36. [36]

    Gadde and S

    A. Gadde and S. Jain,Monotones from multi-invariants: A classification,2509.06348

    arXiv

  37. [37]

    Gadde, S

    A. Gadde, S. Jain and H. Kulkarni,Multi-partite entanglement monotones,2406.17447. – 41 –

    arXiv