Graph Structures for Local Distinguishability of Quantum Product States

• URL: http://arxiv.org/abs/2606.26558v1
• Date: Thu, 25 Jun 2026 03:09:25 GMT
• Title: Graph Structures for Local Distinguishability of Quantum Product States
• Abstract summary: We consider the problem of distinguishing sets of quantum product states with local operations and classical communication (LOCC)<n>Recent work has used graph theory to identify sets of product states distinguishable with one-way LOCC.<n>We extend these efforts to full two-way LOCC, with the first significant analysis of the set of graphs corresponding to bipartite product states.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider the problem of distinguishing sets of quantum product states with local operations and classical communication (LOCC). Recent work has used graph theory to identify sets of product states distinguishable with one-way LOCC. We extend these efforts to full two-way LOCC, with the first significant analysis of the set of graphs corresponding to bipartite product states that can be distinguished with two-way protocols after finitely many steps. We derive basic closure properties of the set of distinguishable graphs and identify some classes of graphs that guarantee local distinguishability and some graphs that do not. We also include several examples and forward-looking comments.

Related papers

• Characterizing and Identifying Separable Graphical Models [3.3065613256340427]
  We introduce separable graphs, in which each missing edge implies the existence of a separating set for its endpoints.<n>We show that these models include many existing graph families used to define graphical models.<n>We develop an algorithm that identifies the equivalence class of any essentially separable graph.
  arXiv  Detail & Related papers  (2026-07-01T15:22:03Z)
• When Do Graph Foundation Models Transfer? A Data-Centric Theory [68.54337055801571]
  Graph foundation models (GFMs) aim to reuse a single backbone across diverse graph domains, yet their transfer is often uneven and can exhibit negative transfer.<n>We show that for both set-based and message-passing tokenizations, any Lipschitz backbone admits an explicit decomposition of cross-domain output shift.<n>A key ingredient is positional-encoding (PE) stability: we establish stability guarantees for spectral PEs and highlight contrasting behaviors of eigenvector- versus subspace-based PEs.
  arXiv  Detail & Related papers  (2026-05-28T12:07:27Z)
• $χ$-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)
• Distinguishing Graph States by the Properties of Their Marginals [0.0]
  We study equivalence relations between graph states under local unitaries (LU)<n>We show that these invariants uniquely identify the entanglement classes of every graph state up to 8 qubits.<n>We generalize tools to test for local Clifford (LC) equivalence of graph states that work by condensing large graphs into smaller graphs.
  arXiv  Detail & Related papers  (2024-06-14T12:03:10Z)
• Multipartite Entanglement Distribution in Quantum Networks using Subgraph Complementations [8.194910516215462]
  We propose a novel approach for distributing graph states across a quantum network.<n>We classify common classes of graph states, along with their optimal distribution time using subgraph complementations.
  arXiv  Detail & Related papers  (2023-08-25T23:03:25Z)
• Discrete Graph Auto-Encoder [52.50288418639075]
  We introduce a new framework named Discrete Graph Auto-Encoder (DGAE) We first use a permutation-equivariant auto-encoder to convert graphs into sets of discrete latent node representations. In the second step, we sort the sets of discrete latent representations and learn their distribution with a specifically designed auto-regressive model.
  arXiv  Detail & Related papers  (2023-06-13T12:40:39Z)
• Chordal Graphs and Distinguishability of Quantum Product States [0.0]
  We identify chordality as the key graph structure that drives distinguishability in one-way LOCC. We derive a one-way LOCC characterization for chordal graphs that establishes a connection with the theory of matrix completions.
  arXiv  Detail & Related papers  (2023-05-17T12:17:47Z)
• Spectral Augmentations for Graph Contrastive Learning [50.149996923976836]
  Contrastive learning has emerged as a premier method for learning representations with or without supervision. Recent studies have shown its utility in graph representation learning for pre-training. We propose a set of well-motivated graph transformation operations to provide a bank of candidates when constructing augmentations for a graph contrastive objective.
  arXiv  Detail & Related papers  (2023-02-06T16:26:29Z)
• GraphDCA -- a Framework for Node Distribution Comparison in Real and Synthetic Graphs [72.51835626235368]
  We argue that when comparing two graphs, the distribution of node structural features is more informative than global graph statistics. We present GraphDCA - a framework for evaluating similarity between graphs based on the alignment of their respective node representation sets.
  arXiv  Detail & Related papers  (2022-02-08T14:19:19Z)
• Group Contrastive Self-Supervised Learning on Graphs [101.45974132613293]
  We study self-supervised learning on graphs using contrastive methods. We argue that contrasting graphs in multiple subspaces enables graph encoders to capture more abundant characteristics.
  arXiv  Detail & Related papers  (2021-07-20T22:09:21Z)
• Spatial-spectral Hyperspectral Image Classification via Multiple Random Anchor Graphs Ensemble Learning [88.60285937702304]
  This paper proposes a novel spatial-spectral HSI classification method via multiple random anchor graphs ensemble learning (RAGE) Firstly, the local binary pattern is adopted to extract the more descriptive features on each selected band, which preserves local structures and subtle changes of a region. Secondly, the adaptive neighbors assignment is introduced in the construction of anchor graph, to reduce the computational complexity.
  arXiv  Detail & Related papers  (2021-03-25T09:31:41Z)

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.