Symmetric and Antisymmetric Quantum States from Graph Structure and Orientation

• URL: http://arxiv.org/abs/2601.19857v1
• Date: Tue, 27 Jan 2026 18:12:52 GMT
• Title: Symmetric and Antisymmetric Quantum States from Graph Structure and Orientation
• Authors: Matheus R. de Jesus, Eduardo O. C. Hoefel, Renato M. Angelo,
• Abstract summary: We prove that a graph state is fully symmetric under particle permutations if and only if the underlying graph is complete.<n>We show that complete directed graphs endowed with appropriate orientations, for an odd number of qudits generate fully antisymmetric multipartite states.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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 endowed with appropriate orientations, for an odd number of qudits generate fully antisymmetric multipartite states. Together, these results provide a unified graph-theoretic description of bosonic and fermionic exchange symmetry based on graph completeness and edge orientation.

Related papers

• Combinatorial structures in quantum correlation: A new perspective [1.2078273498134855]
  We introduce a new class of quantum states, called $A_$-graph states.<n>The constructed states are different from the standard graph states arising from stabiliser formalism.<n>We develop a graph-theoretic formulation of a moments-based entanglement detection criterion.
  arXiv  Detail & Related papers  (2025-12-17T18:44:07Z)
• A Graph-Theoretic Approach to Quantum Measurement Incompatibility [0.0]
  We develop a graph-theoretic framework for quantifying measurement incompatibility.<n>We show that the Lovsz number yields the correct scaling for $k$-body Majorana observables.<n>We identify structural conditions under which the robustness is determined.
  arXiv  Detail & Related papers  (2025-11-20T01:06:46Z)
• Families of isospectral and isoscattering quantum graphs [0.0]
  A concept of germ graphs and the M-function formalism are employed to construct large families of isospectral and isoscattering graphs.<n>We demonstrate that the introduced formalism can also be extended to graphs with dissipation.
  arXiv  Detail & Related papers  (2025-05-22T12:54:52Z)
• Real state transfer on edge perturbed graphs with generalized clusters [0.0]
  We study the existence of real state transfer in edge-perturbed graphs containing generalized clusters.<n>A central observation is that the evolution of certain quantum states depends solely on the local structure of the underlying graph.
  arXiv  Detail & Related papers  (2025-05-12T18:26:59Z)
• Generalization, Expressivity, and Universality of Graph Neural Networks on Attributed Graphs [53.27010448621372]
  We analyze the universality and generalization of graph neural networks (GNNs) on attributed graphs with node attributes.<n>We prove a universal approximation theorem for GNNs and bounds generalization for GNNs on any data distribution of attributed graphs.<n>Our work extends and unites previous approaches which either derived theory only for graphs with no attributes, derived compact metrics under which GNNs are continuous but without separation power, or derived metrics under which GNNs are continuous and separate points.
  arXiv  Detail & Related papers  (2024-11-08T10:34:24Z)
• HeNCler: Node Clustering in Heterophilous Graphs via Learned Asymmetric Similarity [48.62389920549271]
  HeNCler learns a similarity graph by optimizing a clustering-specific objective based on weighted kernel singular value decomposition.<n>Our approach enables spectral clustering on an asymmetric similarity graph, providing flexibility for both directed and undirected graphs.
  arXiv  Detail & Related papers  (2024-05-27T11:04:05Z)
• Finding the Missing-half: Graph Complementary Learning for Homophily-prone and Heterophily-prone Graphs [48.79929516665371]
  Graphs with homophily-prone edges tend to connect nodes with the same class. Heterophily-prone edges tend to build relationships between nodes with different classes. Existing GNNs only take the original graph during training.
  arXiv  Detail & Related papers  (2023-06-13T08:06:10Z)
• Graph Spectral Embedding using the Geodesic Betweeness Centrality [76.27138343125985]
  We introduce the Graph Sylvester Embedding (GSE), an unsupervised graph representation of local similarity, connectivity, and global structure. GSE uses the solution of the Sylvester equation to capture both network structure and neighborhood proximity in a single representation.
  arXiv  Detail & Related papers  (2022-05-07T04:11:23Z)
• Hamiltonian systems, Toda lattices, Solitons, Lax Pairs on weighted Z-graded graphs [62.997667081978825]
  We identify conditions which allow one to lift one dimensional solutions to solutions on graphs. We show that even for a simple example of a topologically interesting graph the corresponding non-trivial Lax pairs and associated unitary transformations do not lift to a Lax pair on the Z-graded graph.
  arXiv  Detail & Related papers  (2020-08-11T17:58:13Z)
• Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices [0.0]
  Cospectrality is a powerful generalization of exchange symmetry and can be applied to all real-valued symmetric matrices. We show that the powers of a matrix with cospectral vertices induce further local relations on its eigenvectors. Our work paves the way for flexibly exploiting hidden structural symmetries in the design of generic complex network-like systems.
  arXiv  Detail & Related papers  (2020-07-15T10:54:31Z)
• Wasserstein-based Graph Alignment [56.84964475441094]
  We cast a new formulation for the one-to-many graph alignment problem, which aims at matching a node in the smaller graph with one or more nodes in the larger graph. We show that our method leads to significant improvements with respect to the state-of-the-art algorithms for each of these tasks.
  arXiv  Detail & Related papers  (2020-03-12T22:31:59Z)
• Gauge Equivariant Mesh CNNs: Anisotropic convolutions on geometric graphs [81.12344211998635]
  A common approach to define convolutions on meshes is to interpret them as a graph and apply graph convolutional networks (GCNs) We propose Gauge Equivariant Mesh CNNs which generalize GCNs to apply anisotropic gauge equivariant kernels. Our experiments validate the significantly improved expressivity of the proposed model over conventional GCNs and other methods.
  arXiv  Detail & Related papers  (2020-03-11T17:21:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.