Chordal Graphs and Distinguishability of Quantum Product States

• URL: http://arxiv.org/abs/2305.10153v1
• Date: Wed, 17 May 2023 12:17:47 GMT
• Title: Chordal Graphs and Distinguishability of Quantum Product States
• Authors: Comfort Mintah, David W. Kribs, Michael Nathanson, Rajesh Pereira
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We investigate a graph-theoretic approach to the problem of distinguishing quantum product states in the fundamental quantum communication framework called local operations and classical communication (LOCC). We identify chordality as the key graph structure that drives distinguishability in one-way LOCC, and we derive a one-way LOCC characterization for chordal graphs that establishes a connection with the theory of matrix completions. We also derive minimality conditions on graph parameters that allow for the determination of indistinguishability of states. We present a number of applications and examples built on these results.

Related papers

• The multi-state geometry of shift current and polarization [44.99833362998488]
  We employ quantum state projectors to develop an explicitly gauge-invariant formalism. We provide a simple expression for the shift current that resolves its precise relation to the moments of electronic polarization. We reveal its decomposition into the sum of the skewness of the occupied states and intrinsic multi-state geometry.
  arXiv  Detail & Related papers  (2024-09-24T18:00:02Z)
• What Improves the Generalization of Graph Transformers? A Theoretical Dive into the Self-attention and Positional Encoding [67.59552859593985]
  Graph Transformers, which incorporate self-attention and positional encoding, have emerged as a powerful architecture for various graph learning tasks. This paper introduces first theoretical investigation of a shallow Graph Transformer for semi-supervised classification.
  arXiv  Detail & Related papers  (2024-06-04T05:30:16Z)
• Characterizing Hybrid Causal Structures with the Exclusivity Graph Approach [0.41942958779358674]
  We extend a graph theoretical technique to explore classical, quantum, and no-signaling distributions in hybrid scenarios. We show how with our method we can construct minimal Bell-like inequalities capable of simultaneously distinguishing classical, quantum, and no-signaling behaviors. The demonstrated method will represent a powerful tool to study quantum networks and for applications in quantum information tasks.
  arXiv  Detail & Related papers  (2023-12-29T19:44:38Z)
• Multipartite Entanglement Distribution in Quantum Networks using Subgraph Complementations [9.32782060570252]
  We propose a novel approach for distributing graph states across a quantum network. We show that the distribution of graph states can be characterized by a system of subgraph complementations. We find a close to optimal sequence of subgraph complementation operations to distribute an arbitrary graph state.
  arXiv  Detail & Related papers  (2023-08-25T23:03:25Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• OrphicX: A Causality-Inspired Latent Variable Model for Interpreting Graph Neural Networks [42.539085765796976]
  This paper proposes a new eXplanation framework, called OrphicX, for generating causal explanations for graph neural networks (GNNs) We construct a distinct generative model and design an objective function that encourages the generative model to produce causal, compact, and faithful explanations. We show that OrphicX can effectively identify the causal semantics for generating causal explanations, significantly outperforming its alternatives.
  arXiv  Detail & Related papers  (2022-03-29T03:08:33Z)
• Equivariant Quantum Graph Circuits [10.312968200748116]
  We propose equivariant quantum graph circuits (EQGCs) as a class of parameterized quantum circuits with strong inductive bias for learning over graph-structured data. Our theoretical perspective on quantum graph machine learning methods opens many directions for further work, and could lead to models with capabilities beyond those of classical approaches.
  arXiv  Detail & Related papers  (2021-12-10T00:14:12Z)
• Topological graph states and quantum error correction codes [0.0]
  We derive necessary and sufficient conditions for a family of graph states to be in TQO-1. TQO-1 is a class of quantum error correction code states whose code distance scales macroscopically with the number of physical qubits.
  arXiv  Detail & Related papers  (2021-12-05T07:43:24Z)
• Operator and Graph Theoretic Techniques for Distinguishing Quantum States via One-Way LOCC [0.0]
  We bring together some of the main results and applications from our recent works in quantum information theory. We investigate the topic of distinguishability of sets of quantum states in quantum communication. We derive a new graph-theoretic description of distinguishability in the case of a single qubit sender.
  arXiv  Detail & Related papers  (2021-10-14T18:26:40Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)
• Spectra of Perfect State Transfer Hamiltonians on Fractal-Like Graphs [62.997667081978825]
  We study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer. The essential goal is to develop the theoretical framework for understanding the interplay between perfect quantum state transfer, spectral properties, and the geometry of the underlying graph.
  arXiv  Detail & Related papers  (2020-03-25T02:46:14Z)

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.