Correlation hypergraph: a new representation of a quantum marginal independence pattern

• URL: http://arxiv.org/abs/2412.18018v2
• Date: Mon, 10 Feb 2025 13:40:04 GMT
• Title: Correlation hypergraph: a new representation of a quantum marginal independence pattern
• Authors: Veronika E. Hubeny, Massimiliano Rota,
• Abstract summary: We introduce a new representation of the patterns of marginal independence based on certain correlation hypergraphs. We show that these correlation hypergraphs generalize to arbitrary quantum systems. In the context of holography, we apply these techniques to derive a necessary condition for the realizability of entropy vectors.
• Score: 0.0
• License:
• Abstract: We continue the study of the quantum marginal independence problem, namely the question of which faces of the subadditivity cone are achievable by quantum states. We introduce a new representation of the patterns of marginal independence (PMIs, corresponding to faces of the subadditivity cone) based on certain correlation hypergraphs, and demonstrate that this representation provides a more efficient description of a PMI, and consequently of the set of PMIs which are compatible with strong subadditivity. We then show that these correlation hypergraphs generalize to arbitrary quantum systems the well known relation between positivity of mutual information and connectivity of entanglement wedges in holography, and further use this representation to derive new results about the combinatorial structure of collections of simultaneously decorrelated subsystems specifying SSA-compatible PMIs. In the context of holography, we apply these techniques to derive a necessary condition for the realizability of entropy vectors by simple tree graph models, which were conjectured in arXiv:2204.00075 to provide the building blocks of the holographic entropy cone. Since this necessary condition is formulated in terms of chordality of a certain graph, it can be tested efficiently.

Related papers

• Entanglement, quantum correlators and connectivity in graph states [0.0]
  This work contributes to a deeper understanding of the entanglement and connectivity properties of graph states. It offers valuable insights for quantum information processing and quantum computing applications.
  arXiv  Detail & Related papers  (2023-08-15T10:42:07Z)
• A statistical approach to topological entanglement: Boltzmann machine representation of high-order irreducible correlation [6.430262211852815]
  A quantum analog of high-order correlations is the topological entanglement in topologically ordered states of matter at zero temperature. In this work, we propose a statistical interpretation that unifies the two under the same information-theoretic framework.
  arXiv  Detail & Related papers  (2023-02-07T02:49:21Z)
• Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations [57.15855198512551]
  We propose a novel score-based generative model for graphs with a continuous-time framework. We show that our method is able to generate molecules that lie close to the training distribution yet do not violate the chemical valency rule.
  arXiv  Detail & Related papers  (2022-02-05T08:21:04Z)
• A Probabilistic Graph Coupling View of Dimension Reduction [5.35952718937799]
  We introduce a unifying statistical framework based on the coupling of hidden graphs using cross entropy. We show that existing pairwise similarity DR methods can be retrieved from our framework with particular choices of priors for the graphs. Our model is leveraged and extended to address the issue while new links are drawn with Laplacian eigenmaps and PCA.
  arXiv  Detail & Related papers  (2022-01-31T08:21:55Z)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)
• Out-of-time-order correlations and the fine structure of eigenstate thermalisation [58.720142291102135]
  Out-of-time-orderors (OTOCs) have become established as a tool to characterise quantum information dynamics and thermalisation. We show explicitly that the OTOC is indeed a precise tool to explore the fine details of the Eigenstate Thermalisation Hypothesis (ETH) We provide an estimation of the finite-size scaling of $omega_textrmGOE$ for the general class of observables composed of sums of local operators in the infinite-temperature regime.
  arXiv  Detail & Related papers  (2021-03-01T17:51:46Z)
• Hyperbolic Graph Embedding with Enhanced Semi-Implicit Variational Inference [48.63194907060615]
  We build off of semi-implicit graph variational auto-encoders to capture higher-order statistics in a low-dimensional graph latent representation. We incorporate hyperbolic geometry in the latent space through a Poincare embedding to efficiently represent graphs exhibiting hierarchical structure.
  arXiv  Detail & Related papers  (2020-10-31T05:48:34Z)
• Structural Landmarking and Interaction Modelling: on Resolution Dilemmas in Graph Classification [50.83222170524406]
  We study the intrinsic difficulty in graph classification under the unified concept of resolution dilemmas'' We propose SLIM'', an inductive neural network model for Structural Landmarking and Interaction Modelling.
  arXiv  Detail & Related papers  (2020-06-29T01:01:42Z)
• Block-Approximated Exponential Random Graphs [77.4792558024487]
  An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. We propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions. Our methods are scalable to sparse graphs consisting of millions of nodes.
  arXiv  Detail & Related papers  (2020-02-14T11:42:16Z)
• The Quantum Entropy Cone of Hypergraphs [0.20999222360659606]
  We study hypergraphs and their analogously-defined entropy cones. We find a class of quantum entropy vectors which reach beyond those of holographic states. We show that the hypergraph framework is broadly applicable to the study of entanglement entropy.
  arXiv  Detail & Related papers  (2020-02-13T02:45:28Z)

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.