Combinatorial structures in quantum correlation: A new perspective

• URL: http://arxiv.org/abs/2512.15686v2
• Date: Thu, 18 Dec 2025 05:59:48 GMT
• Title: Combinatorial structures in quantum correlation: A new perspective
• Authors: Rohit kumar, Satyabrata Adhikari,
• Abstract summary: 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.
• Score: 1.2078273498134855
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph-theoretic structures play a central role in the description and analysis of quantum systems. In this work, we introduce a new class of quantum states, called $A_α$-graph states, which are constructed from either unweighted or weighted graphs by taking the normalised convex combination of the degree matrix $D$ and the adjacency matrix $A_G$ of a graph $G$. The constructed states are different from the standard graph states arising from stabiliser formalism. Our approach is also different from the approach used by Braunstein et al. This class of states depend on a tunable mixing parameter $α\in (0,1]$. We first establish the conditions under which the associated operator $ρ_α^{A_G}$ is positive semidefinite and hence represents a valid quantum state. We then derive a positive partial transposition (PPT) condition for $A_α$-graph states in terms of graph parameters. This PPT condition involves only the Frobenius norm of the adjacency matrix of the graph, the degrees of the vertices and the total number of vertices. For simple graphs, we obtain the range of the parameter $α$ for which the $A_α$-graph states represent a class of entangled states. We then develop a graph-theoretic formulation of a moments-based entanglement detection criterion, focusing on the recently proposed $p_3$-PPT criterion, which relies on the second and third moments of the partial transposition. Since the estimation of these moments is experimentally accessible via randomised measurements, swap operations, and machine-learning-based protocols, our approach provides a physically relevant framework for detecting entanglement in structured quantum states derived from graphs. This work bridges graph theory and moments-based entanglement detection, offering a new perspective on the role of combinatorial structures in quantum correlations.

Related papers

• Quantum Algorithms for Approximate Graph Isomorphism Testing [0.0]
  We study the quantum query complexity of approximate graph isomorphism testing.<n>We present a quantum algorithm based on MNRS quantum walk search over the product graph $(G,H)$ of the two input graphs.
  arXiv  Detail & Related papers  (2026-03-03T06:43:41Z)
• 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)
• Studies of properties of bipartite graphs with quantum programming [0.0]
  Multi-qubit quantum states corresponding to bipartite graphs $G(U,V,E)$ are examined.<n>The entanglement distance of the resulting states is derived analytically for an arbitrary bipartite graph structure.
  arXiv  Detail & Related papers  (2025-07-22T14:49:57Z)
• Spectro-Riemannian Graph Neural Networks [39.901731107377095]
  Cusp Laplacian is an extension of the traditional graph Laplacian based on Ollivier-Ricci curvature.<n>Cusp Pooling is a hierarchical attention mechanism combined with a curvature-based positional encoding.
  arXiv  Detail & Related papers  (2025-02-01T11:31:01Z)
• Random regular graph states are complex at almost any depth [0.0]
  Graph states are fundamental objects in the theory of quantum information due to their simple classical description and rich entanglement structure.<n>For us, they are a toy model to understand the relation between circuit connectivity, entanglement structure and computational complexity.<n>We study the average-case complexity of simulating random graph states of varying degree when measured in random product bases.
  arXiv  Detail & Related papers  (2024-12-09T23:44:09Z)
• Generating Graphs via Spectral Diffusion [48.70458395826864]
  We present GGSD, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process.<n>An extensive set of experiments on both synthetic and real-world graphs demonstrates the strengths of our model against state-of-the-art alternatives.
  arXiv  Detail & Related papers  (2024-02-29T09:26:46Z)
• 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)
• Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution [112.3443939502313]
  We propose a unified graph signal sampling framework which enjoys the benefits of graph signal analysis and processing. The key idea is to transform each user's ratings on the items to a function (signal) on the vertices of an item-item graph. For the online setting, we develop a Bayesian extension, i.e., BGS-IMC which considers continuous random Gaussian noise in the graph Fourier domain.
  arXiv  Detail & Related papers  (2023-02-08T08:17:43Z)
• Detection of $d_{1}\otimes d_{2}$ Dimensional Bipartite Entangled State: A Graph Theoretical Approach [1.5762281194023464]
  We show that the constructed unital map $phi$ characterize the quantum state with respect to its purity. We derive the inequality between the minimum eigenvalue of the density matrix and the weight of the edges of the connected subgraph to detect the entanglement of $d_1 otimes d_2$ dimensional bipartite quantum states.
  arXiv  Detail & Related papers  (2022-02-28T17:13:27Z)
• SIGMA: A Structural Inconsistency Reducing Graph Matching Algorithm [21.1095092767297]
  We propose a novel criterion to measure the graph matching accuracy, structural inconsistency (SI) Specifically, SI incorporates the heat diffusion wavelet to accommodate the multi-hop structure of the graphs. We show that SIGMA can be derived by using a mirror descent method to solve the Gromov-Wasserstein distance with a novel K-hop-structure-based matching costs.
  arXiv  Detail & Related papers  (2022-02-06T15:18:37Z)
• Learning Sparse Graph with Minimax Concave Penalty under Gaussian Markov Random Fields [51.07460861448716]
  This paper presents a convex-analytic framework to learn from data. We show that a triangular convexity decomposition is guaranteed by a transform of the corresponding to its upper part.
  arXiv  Detail & Related papers  (2021-09-17T17:46:12Z)
• Graph-Theoretic Framework for Self-Testing in Bell Scenarios [37.067444579637076]
  Quantum self-testing is the task of certifying quantum states and measurements using the output statistics solely. We present a new approach for quantum self-testing in Bell non-locality scenarios.
  arXiv  Detail & Related papers  (2021-04-27T08:15:01Z)

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.