arxiv: 2601.19857 · v2 · submitted 2026-01-27 · 🪐 quant-ph

Recognition: no theorem link

Symmetric and Antisymmetric Quantum States from Graph Structure and Orientation

Matheus R. de Jesus , Eduardo O. C. Hoefel , Renato M. Angelo

Authors on Pith no claims yet

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

classification 🪐 quant-ph

keywords graph statesexchange symmetrymultipartite entanglementbosonic statesfermionic statesdirected graphsquantum gatesqudit systems

0 comments

The pith

Graph states are fully symmetric under particle permutations if and only if the underlying graph is complete, and complete directed graphs produce fully antisymmetric states with appropriate orientations.

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

The paper proves that graph states built from controlled-Z interactions are invariant under arbitrary particle swaps exactly when the graph connects every pair of vertices. It introduces a non-commutative two-qudit gate called GR placed on directed edges with an explicit vertex ordering, showing that complete directed graphs then generate states that change sign under any swap. This construction supplies a single graph language for both bosonic and fermionic multipartite entanglement. A sympathetic reader cares because the symmetry type is now read directly from topology and edge direction instead of being imposed by separate projectors after the state is prepared.

Core claim

Graph states are fully symmetric under particle permutations if and only if the underlying graph is complete. Complete directed graphs generate fully antisymmetric multipartite states when endowed with appropriate orientations using a generalized construction with the non-commutative two-qudit gate GR that requires directed edges and an explicit vertex ordering. These results provide a unified graph-theoretic description of bosonic and fermionic exchange symmetry based on graph completeness and edge orientation.

What carries the argument

The GR gate, a non-commutative two-qudit interaction placed on directed edges according to a fixed vertex ordering, which enforces the sign change under particle exchange for complete directed graphs.

If this is right

Only complete undirected graphs produce graph states that remain unchanged under any particle permutation.
Complete directed graphs with consistent orientations produce states that acquire a minus sign under any particle swap.
The construction works for qudits of any local dimension.
Bosonic and fermionic statistics are encoded directly in graph structure and orientation rather than added afterward.

Where Pith is reading between the lines

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

Graphs that are complete only on subsets of vertices may yield states symmetric under permutations within those subsets.
The same directed-graph rules could be used to design network states that automatically respect particle statistics in quantum communication protocols.
Extension to anyonic statistics might be possible by assigning phases to directed cycles instead of simple orientations.

Load-bearing premise

The GR gate together with explicit vertex ordering on directed edges fully enforces the required antisymmetric exchange properties for arbitrary numbers of qudits without further hidden constraints on the state space.

What would settle it

Explicitly compute the three-qubit graph state on a triangle (complete graph) and verify invariance under all transpositions, then repeat for a path graph (incomplete) and observe that at least one transposition changes the state.

Figures

Figures reproduced from arXiv: 2601.19857 by Eduardo O. C. Hoefel, Matheus R. de Jesus, Renato M. Angelo.

**Figure 2.** Figure 2: FIG. 2. Initial two-vertex directed subgraph [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗

**Figure 3.** Figure 3: FIG. 3. Directed complete graph on three vertices whose orientation generates the fully antisymmetric state of three [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗

read the original abstract

Graph states provide a powerful framework for describing multipartite entanglement in quantum information science. In their standard formulation, graph states are generated by controlled-$Z$ interactions and naturally encode symmetric exchange properties. Here we establish a precise correspondence between graph topology and exchange symmetry by proving that a graph state is fully symmetric under particle permutations if and only if the underlying graph is complete. We then introduce a generalized graph-based construction using a non-commutative two-qudit gate, denoted $GR$, which requires directed edges and an explicit vertex ordering. We show that complete directed graphs generate fully antisymmetric multipartite states when endowed with appropriate orientations. Together, these results provide a unified graph-theoretic description of bosonic and fermionic exchange symmetry based on graph completeness and edge orientation.

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.

Desk Editor's Note private letter to a colleague

The paper gives a clean iff link between complete graphs and fully symmetric graph states, plus a directed-graph construction with a new GR gate for antisymmetry, but the antisym part needs explicit checks on phase consistency for d>2.

read the letter

The main thing to know is that the authors prove a graph state is fully symmetric under particle permutations exactly when the underlying graph is complete, and they build fully antisymmetric states from oriented complete directed graphs using a non-commutative two-qudit GR gate plus vertex ordering. This supplies a unified graphical language for bosonic and fermionic exchange symmetry in multipartite systems. The symmetric direction follows directly from the standard controlled-Z construction of graph states, since only a complete graph makes the state invariant under all transpositions. That part looks reliable and is a useful observation even if not revolutionary. The antisymmetric construction is the newer element. It requires the GR gate to produce a consistent global minus sign under every exchange, independent of ordering path. The abstract claims this works with appropriate orientations, but the stress-test concern about cocycle consistency for dimensions above 2 is worth checking in the full proofs. If the paper shows the gate satisfies the necessary commutation relations across overlapping triples without extra constraints, the result holds; otherwise there is a gap in the argument for general qudits. No free parameters or circular fitting appear. The work is for quantum information people who already use graph states to model entanglement. A reader focused on graphical representations of symmetry or multipartite states would get concrete value from the constructions. It deserves peer review because the claims are specific enough for referees to verify the derivations and gate definitions directly.

Referee Report

1 major / 2 minor

Summary. The paper claims that a graph state is fully symmetric under particle permutations if and only if the underlying graph is complete. It introduces a non-commutative two-qudit GR gate that requires directed edges and an explicit vertex ordering, and shows that complete directed graphs with appropriate orientations generate fully antisymmetric multipartite states, thereby providing a unified graph-theoretic description of bosonic and fermionic exchange symmetries.

Significance. If the central claims hold with rigorous proofs, the work establishes a precise link between graph completeness/orientation and exchange symmetry in quantum states. This could offer a systematic way to construct symmetric and antisymmetric entangled states for qudits, with potential applications in quantum information tasks involving indistinguishable particles. The iff characterization for symmetry and the orientation-based antisymmetry construction are the main contributions, though their broader impact depends on validation of the GR gate for general dimensions.

major comments (1)

[GR gate construction and application to complete directed graphs] The antisymmetric result (complete directed graphs yield fully antisymmetric states) rests on the GR gate plus vertex ordering producing consistent global sign changes under every transposition for arbitrary qudit dimension d>2. The construction must satisfy cocycle-like consistency conditions across overlapping triples so that the accumulated phase is independent of path through the ordering; no explicit verification or proof of these conditions appears in the provided derivations, which is load-bearing for the claim.

minor comments (2)

The abstract and construction refer to an 'explicit vertex ordering' on directed edges; the precise manner in which this ordering is encoded into the state preparation circuit or wavefunction should be stated more formally to remove potential ambiguity.
Consider adding a short comparison table or paragraph relating the GR gate to existing entangling gates (e.g., controlled-phase or SWAP-based constructions) to clarify its novelty.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and for highlighting the need for explicit verification of the consistency conditions underlying the antisymmetric construction. We address the major comment below and will incorporate the requested proof in the revised manuscript.

read point-by-point responses

Referee: [GR gate construction and application to complete directed graphs] The antisymmetric result (complete directed graphs yield fully antisymmetric states) rests on the GR gate plus vertex ordering producing consistent global sign changes under every transposition for arbitrary qudit dimension d>2. The construction must satisfy cocycle-like consistency conditions across overlapping triples so that the accumulated phase is independent of path through the ordering; no explicit verification or proof of these conditions appears in the provided derivations, which is load-bearing for the claim.

Authors: We agree that an explicit verification of the cocycle-like consistency conditions for the GR gate is necessary to rigorously establish path-independence of the accumulated phase for arbitrary d>2. In the revised manuscript we will add a dedicated lemma and proof showing that, for any triple of vertices, the phase factors obtained by traversing the directed edges in either order coincide, ensuring that the global sign change under an arbitrary transposition is well-defined and independent of the chosen ordering. This will directly support the claim that complete directed graphs with consistent orientations generate fully antisymmetric states. revision: yes

Circularity Check

0 steps flagged

No significant circularity; symmetry claims follow from graph definitions and new gate construction

full rationale

The paper's central results are direct proofs: a graph state is fully symmetric under permutations iff the graph is complete, and antisymmetric states are generated from oriented complete digraphs via the introduced GR gate. These rest on explicit definitions of graph states, the non-commutative GR gate, vertex ordering, and edge orientations, without any reduction to fitted parameters, self-referential equations, or load-bearing self-citations. The derivation chain is self-contained and does not rename known results or smuggle ansatzes via prior work.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The work relies on the standard definition of graph states and the quantum-mechanical notion of exchange symmetry; it introduces one new gate and the concept of oriented directed graphs.

axioms (2)

standard math Standard definition of graph states generated by controlled-Z interactions on qubits
Invoked in the opening paragraph to establish the symmetric case.
domain assumption Multipartite quantum states transform under particle permutations according to bosonic or fermionic statistics
Fundamental premise for linking graph structure to exchange symmetry.

invented entities (1)

GR gate no independent evidence
purpose: Non-commutative two-qudit gate that incorporates direction and ordering for antisymmetric state construction
New operator introduced to extend the graph-state formalism to directed graphs.

pith-pipeline@v0.9.0 · 5428 in / 1297 out tokens · 21825 ms · 2026-05-16T10:21:13.173804+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

22 extracted references · 22 canonical work pages · 1 internal anchor

[1]

Among all such paths, consider one of minimal length

Structureh 1: Connected Graphs By definition, in a connected graph there exists a path between any two vertices. Among all such paths, consider one of minimal length. To show that the structureh 1 appears in every non-complete connected graph, we choose two non-adjacent verticesuandvofΓ. Such a choice is always possible since the graph is not complete. Le...

work page
[2]

For a discon- nected graph to be nontrivial, it must contain at least one edge

Structureh 2: Disconnected Graphs In a disconnected graph, there exists no path between vertices belonging to different connected components. For a discon- nected graph to be nontrivial, it must contain at least one edge. Therefore, one can always choose two non-adjacent vertices such that one of them is adjacent to a third vertex, yielding a subgraph iso...

work page
[3]

Symmetry Breaking in the Minimal Substructures Consider first the connected caseh 1. For vertices1,2,3, the corresponding graph state is |G⟩h1 =CZ (1,2) CZ (2,3) |+⟩⊗3 = 1√ 8 |000⟩+|100⟩+|010⟩+|001⟩ − |110⟩+|101⟩ − |011⟩+|111⟩ .(4) Applying the permutationP 12, we obtain P12 |G⟩h1 = 1√ 8 |000⟩+|010⟩+|100⟩+|001⟩ − |110⟩+|011⟩ − |101⟩+|111⟩ ,(5) which is cl...

work page
[4]

(16) coincides, up to a global phase, with the totally antisymmetric state onnqudits whenevernis odd

Full antisymmetry of the state for an odd number of qudits The goal of this subsection is to show that the state|A n⟩defined in Eq. (16) coincides, up to a global phase, with the totally antisymmetric state onnqudits whenevernis odd. The proof proceeds by rewriting|A n⟩as a uniform superposition of computational-basis states labeled by permutations, with ...

work page
[5]

Illustrative Example To illustrate the construction, we consider the directed graph shown in Fig. 1. The corresponding initial two-vertex subgraph Γ2, depicted in Fig. 2, serves as the base case of the recursive procedure. FIG. 1. Directed graph illustrating the intermediate step of the recursive construction of|Γ 3⟩. The state|Γ 2⟩associated with vertice...

work page 2023
[6]

Raussendorf, D

R. Raussendorf, D. E. Browne, and H. J. Briegel, Phys. Rev. A68, 022312 (2003)

work page 2003
[7]

Raussendorf and H

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

work page 2001
[8]

Walther, K

P. Walther, K. J. Resch, T. Rudolph, E. Schenck, H. Weinfurter, V . Vedral, M. Aspelmeyer, and A. Zeilinger, Nature434, 169 (2005)

work page 2005
[9]

Salem, A

V . Salem, A. A. Silva, and F. M. Andrade, Phys. Rev. A109, 012416 (2024)

work page 2024
[10]

G ¨uhne, G

O. G ¨uhne, G. T´oth, P. Hyllus, and H. J. Briegel, Phys. Rev. Lett.95, 120405 (2005)

work page 2005
[11]

Gachechiladze, C

M. Gachechiladze, C. Budroni, and O. G ¨uhne, Phys. Rev. Lett.116, 070401 (2016)

work page 2016
[12]

Houdayer, H

J. Houdayer, H. Landa, and G. Misguich, SciPost Physics Core7, 009 (2024)

work page 2024
[13]

M. Hein, W. D ¨ur, J. Eisert, R. Raussendorf, M. Van den Nest, and H. J. Briegel, inQuantum Computers, Algorithms and Chaos, edited by A. Buchleitner, C. Viviescas, and M. Tiersch (IOS Press, Amsterdam, 2006) pp. 115–218, arXiv:quant-ph/0602096

work page internal anchor Pith review Pith/arXiv arXiv 2006
[14]

Thomas, L

P. Thomas, L. Ruscio, O. Morin, and G. Rempe, Nature629, 567 (2024)

work page 2024
[15]

E. S. Cooper, P. Kunkel, A. Periwal, and M. Schleier-Smith, Nature Physics20, 770 (2024)

work page 2024
[16]

Thomas, L

P. Thomas, L. Ruscio, O. Morin, and G. Rempe, Nature608, 677 (2022)

work page 2022
[17]

L. A. Pettersson, A. S. Sørensen, and S. Paesani, PRX Quantum6, 010305 (2025)

work page 2025
[18]

Lee and H

S.-H. Lee and H. Jeong, Quantum7, 1212 (2023)

work page 2023
[19]

X. Fan, C. Zhan, H. Gupta, and C. R. Ramakrishnan, IEEE Transactions on Quantum Engineering6, 1 (2025)

work page 2025
[20]

Mazza, M

F. Mazza, M. Caleffi, and A. S. Cacciapuoti, IEEE Transactions on Network Science and Engineering12, 870 (2025)

work page 2025
[21]

Jexet al., Fortschritte der Physik51, 172 (2003)

I. Jexet al., Fortschritte der Physik51, 172 (2003)

work page 2003
[22]

Sagan,The symmetric group: representations, combinatorial algorithms, and symmetric functions, V ol

B. Sagan,The symmetric group: representations, combinatorial algorithms, and symmetric functions, V ol. 203 (Springer Science, 2001)

work page 2001