Graph theoretic quantum contextuality and unextendible Product Bases

• URL: http://arxiv.org/abs/2510.26719v1
• Date: Thu, 30 Oct 2025 17:21:01 GMT
• Title: Graph theoretic quantum contextuality and unextendible Product Bases
• Authors: Gurvir Singh, Arvind,
• Abstract summary: We establish a graph theoretic connection between contextuality and UPBs.<n>A new class of minimal UPBs in $mathbbC3 otimes mathbbCn$ is constructed.<n>The structural properties of these graphs make them suitable candidates for constructing noncontextuality inequalities.
• Score: 0.8324413576411747
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Unextendible product bases(UPBs) are central to the study of local distinguishability of orthogonal product states. While their connection to quantum nonlocality via Bell inequalities is well established, their link to quantum contextuality remains largely unexplored. We establish a graph theoretic connection between contextuality and UPBs. First, an equivalence between Klyachko-Can-Binicio\u{g}lu-Shumovsky (KCBS) vectors and the Pyramid UPB is shown and then by constructing a one parameter family of UPB vectors, a quantitative connection between `contextuality strength' and bound entanglement of states associated with the corresponding UPB is demonstrated. This equivalence is extended to generalized KCBS vectors and the GenPyramid UPB. A new class of minimal UPBs in $\mathbb{C}^3 \otimes \mathbb{C}^n$ is constructed using Lov\'asz-optimal orthogonal representations (LOORs) of cycle graphs and their complements which we term the GenContextual UPB. Any minimal UPB in this dimension is shown to be graph-equivalent to the GenContextual UPB. We briefly discuss the distinguishability properties of GenContextual UPB. In the reverse direction, we observe that the constituent vectors of the QuadRes UPB are LOORs of Paley graphs. The structural properties of these graphs make them suitable candidates for constructing noncontextuality inequalities, thereby establishing a bidirectional connection between quantum contextuality and UPBs.

Related papers

• Imperfect Graphs from Unitary Matrices -- I [0.8149698201875037]
  Matrix representations of quantum operators are computationally complete but often obscure the structural topology of information flow within a quantum circuit.<n>We introduce a generalized graph-theoretic framework for analyzing quantum operators by mapping unitary matrices to directed graphs.<n>This framework provides a novel perspective for viewing quantum circuits as discrete dynamical systems.
  arXiv  Detail & Related papers  (2026-02-25T11:34:47Z)
• 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)
• 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)
• A Signed Graph Approach to Understanding and Mitigating Oversmoothing in GNNs [54.62268052283014]
  We present a unified theoretical perspective based on the framework of signed graphs.<n>We show that many existing strategies implicitly introduce negative edges that alter message-passing to resist oversmoothing.<n>We propose Structural Balanced Propagation (SBP), a plug-and-play method that assigns signed edges based on either labels or feature similarity.
  arXiv  Detail & Related papers  (2025-02-17T03:25:36Z)
• $χ$-Colorable Graph States: Closed-Form Expressions and Quantum Orthogonal Arrays [0.0]
  Graph states are a fundamental class of multipartite entangled quantum states with wide-ranging applications in quantum information and computation.<n>We develop a framework for constructing and analyzing $chi$-colorable graph states, deriving explicit closed-form expressions for arbitrary $chi$.<n>Our results offer an efficient and practical method for systematically constructing graph states, optimizing their representation in quantum circuits, and identifying structured forms of multipartite entanglement.
  arXiv  Detail & Related papers  (2024-08-18T15:41:37Z)
• A Pure Transformer Pretraining Framework on Text-attributed Graphs [50.833130854272774]
  We introduce a feature-centric pretraining perspective by treating graph structure as a prior. Our framework, Graph Sequence Pretraining with Transformer (GSPT), samples node contexts through random walks. GSPT can be easily adapted to both node classification and link prediction, demonstrating promising empirical success on various datasets.
  arXiv  Detail & Related papers  (2024-06-19T22:30:08Z)
• Unextendible product bases from orthogonality graphs [24.740502616119606]
  Unextendible product bases play a key role in the study of quantum entanglement and nonlocality. We show that every minimal GUPB saturating our bound must be associated to regular graphs. We discuss a possible path towards the construction of a minimal GUPB in a tripartite system of minimal local dimension.
  arXiv  Detail & Related papers  (2023-03-05T02:33:22Z)
• Graph Contrastive Learning for Skeleton-based Action Recognition [85.86820157810213]
  We propose a graph contrastive learning framework for skeleton-based action recognition. SkeletonGCL associates graph learning across sequences by enforcing graphs to be class-discriminative. SkeletonGCL establishes a new training paradigm, and it can be seamlessly incorporated into current graph convolutional networks.
  arXiv  Detail & Related papers  (2023-01-26T02:09:16Z)
• 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)
• The construction and local distinguishability of multiqubit unextendible product bases [7.238541917115604]
  An important problem in quantum information is to construct multiqubit unextendible product bases (UPBs) We show that the UPB is locally indistinguishable in the bipartite systems of two qubits and five qubits, respectively. Taking the graphs as product vectors, we show that they are in three different orbits up to local unitary equivalence.
  arXiv  Detail & Related papers  (2021-02-23T08:50:19Z)
• Interpretable Signed Link Prediction with Signed Infomax Hyperbolic Graph [54.03786611989613]
  signed link prediction in social networks aims to reveal the underlying relationships (i.e. links) among users (i.e. nodes) We develop a unified framework, termed as Signed Infomax Hyperbolic Graph (textbfSIHG) In order to model high-order user relations and complex hierarchies, the node embeddings are projected and measured in a hyperbolic space with a lower distortion.
  arXiv  Detail & Related papers  (2020-11-25T05:09:03Z)
• Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting [63.04999833264299]
  "Graph Substructure Networks" (GSN) is a topologically-aware message passing scheme based on substructure encoding. We show that it is strictly more expressive than the Weisfeiler-Leman (WL) graph isomorphism test. We perform an extensive evaluation on graph classification and regression tasks and obtain state-of-the-art results in diverse real-world settings.
  arXiv  Detail & Related papers  (2020-06-16T15:30:31Z)
• Unextendible product bases, bound entangled states, and the range criterion [0.0]
  We consider reducible and irreducible UPBs of maximum size, which can produce bound entangled (BE) states. We provide different UPBs corresponding to the present BE states of minimum rank and discuss important properties of the UPBs.
  arXiv  Detail & Related papers  (2020-05-05T12:46:35Z)

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.