Entanglement in Quantum Systems Based on Directed Graphs

• URL: http://arxiv.org/abs/2509.05214v1
• Date: Fri, 05 Sep 2025 16:17:03 GMT
• Title: Entanglement in Quantum Systems Based on Directed Graphs
• Authors: Lucio De Simone, Roberto Franzosi,
• Abstract summary: We investigate entanglement properties of quantum states associated with directed graphs.<n>Using a measure derived from the Fubini-Study metric, we quantitatively relate multipartite entanglement to the local connectivity of the graph.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate the entanglement properties of quantum states associated with directed graphs. Using a measure derived from the Fubini-Study metric, we quantitatively relate multipartite entanglement to the local connectivity of the graph. In \emph{Entanglement in Directed Graph States}, (2025), arXiv:2505.10716, it is demonstrated that the vertex degree distribution fully determines this entanglement measure and remains invariant under vertex relabeling, highlighting its topological character. As a consequence, the measure depends only on the total degree of each vertex, making it independent of the distinction between incoming and outgoing edges. We apply our framework to several specific graph structures, including hierarchical networks, neural network-inspired graphs, full binary tree and linear bridged cycle graphs, demonstrating how their combinatorial properties influence entanglement distribution. These results provide a geometric perspective on quantum correlations in complex systems, offering potential applications in the design and analysis of quantum networks.

Related papers

• Symmetric and Antisymmetric Quantum States from Graph Structure and Orientation [0.0]
  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.
  arXiv  Detail & Related papers  (2026-01-27T18:12:52Z)
• Entanglement in Directed Graph States [0.0]
  We investigate a family of quantum states defined by directed graphs, where the oriented edges represent interactions between ordered qubits.<n>As a measure of entanglement, we adopt the Entanglement Distance - a quantity derived from the Fubini - Study metric on the system's projective Hilbert space.
  arXiv  Detail & Related papers  (2025-05-15T21:39:11Z)
• Exact Computation of Any-Order Shapley Interactions for Graph Neural Networks [53.10674067060148]
  Shapley Interactions (SIs) quantify node contributions and interactions among multiple nodes.<n>By exploiting the GNN architecture, we show that the structure of interactions in node embeddings are preserved for graph prediction.<n>We introduce GraphSHAP-IQ, an efficient approach to compute any-order SIs exactly.
  arXiv  Detail & Related papers  (2025-01-28T13:37:44Z)
• 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)
• Entanglement of multi-qubit states representing directed networks and its detection with quantum computing [0.0]
  We consider quantum graph states that can be mapped to directed weighted graphs, also known as directed networks. The geometric measure of entanglement of the states is calculated for the quantum graph states corresponding to arbitrary graphs.
  arXiv  Detail & Related papers  (2024-07-13T19:36:11Z)
• A Spectral Framework for Evaluating Geodesic Distances Between Graphs [4.110108749051657]
  We introduce a novel metric named Graph Geodesic Distance (GGD) to quantify the differentiation between graph data samples.<n>The proposed GGD metric can effectively quantify dissimilarities between two graphs by encapsulating their differences in key structural (spectral) properties.<n>We extend the application of GGD beyond graph classification to stability analysis of GNNs and the quantification of distances between datasets.
  arXiv  Detail & Related papers  (2024-06-15T04:47:40Z)
• Signed graphs in data sciences via communicability geometry [49.1574468325115]
  We propose the concept of communicability for signed graphs and explore its mathematical properties.<n>We derive metrics that satisfy the axioms of a distance even in the presence of negative edges.<n>We then apply these metrics to solve several problems in the data analysis of signed graphs within a unified framework.
  arXiv  Detail & Related papers  (2024-03-12T10:32:35Z)
• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• Joint inference of multiple graphs with hidden variables from stationary graph signals [19.586429684209843]
  We introduce a joint graph topology inference method that models the influence of the hidden variables. Under the assumptions that the observed signals are stationary on the sought graphs, the joint estimation of multiple networks allows us to exploit such relationships.
  arXiv  Detail & Related papers  (2021-10-05T21:31:36Z)
• Geometric properties of evolutionary graph states and their detection on a quantum computer [0.0]
  Geometric characteristics of graph states corresponding to a chain, a triangle, and a square are detected on the basis of calculations on IBM's quantum computer ibmq-manila.
  arXiv  Detail & Related papers  (2021-08-29T20:31:37Z)
• Spectral-Spatial Global Graph Reasoning for Hyperspectral Image Classification [50.899576891296235]
  Convolutional neural networks have been widely applied to hyperspectral image classification. Recent methods attempt to address this issue by performing graph convolutions on spatial topologies.
  arXiv  Detail & Related papers  (2021-06-26T06:24:51Z)
• Spectral Embedding of Graph Networks [76.27138343125985]
  We introduce an unsupervised graph embedding that trades off local node similarity and connectivity, and global structure. The embedding is based on a generalized graph Laplacian, whose eigenvectors compactly capture both network structure and neighborhood proximity in a single representation.
  arXiv  Detail & Related papers  (2020-09-30T04:59:10Z)

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.