The Quantum Entropy Cone of Hypergraphs

• URL: http://arxiv.org/abs/2002.05317v1
• Date: Thu, 13 Feb 2020 02:45:28 GMT
• Title: The Quantum Entropy Cone of Hypergraphs
• Authors: Ning Bao, Newton Cheng, Sergio Hern\'andez-Cuenca, Vincent P. Su
• Abstract summary: 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.
• Score: 0.20999222360659606
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we generalize the graph-theoretic techniques used for the holographic entropy cone to study hypergraphs and their analogously-defined entropy cone. This allows us to develop a framework to efficiently compute entropies and prove inequalities satisfied by hypergraphs. In doing so, we discover a class of quantum entropy vectors which reach beyond those of holographic states and obey constraints intimately related to the ones obeyed by stabilizer states and linear ranks. We show that, at least up to 4 parties, the hypergraph cone is identical to the stabilizer entropy cone, thus demonstrating that the hypergraph framework is broadly applicable to the study of entanglement entropy. We conjecture that this equality continues to hold for higher party numbers and report on partial progress on this direction. To physically motivate this conjectured equivalence, we also propose a plausible method inspired by tensor networks to construct a quantum state from a given hypergraph such that their entropy vectors match.

Related papers

• Graphical Calculus for Non-Gaussian Quantum States [1.653052113976862]
  We provide a graphical method to describe and analyze non-Gaussian quantum states using a hypergraph framework. We present illustrative examples on the preparation of non-Gaussian states rooted in these graph-based formalisms.
  arXiv  Detail & Related papers  (2024-09-11T14:32:26Z)
• Beyond the Holographic Entropy Cone via Cycle Flows [0.0]
  We introduce a new prescription for computing entropy vectors outside the holographic entropy cone. We prove that the maximum cycle flow obeys both subadditivity and strong subadditivity. We conjecture that our model similarly generalizes the entropy vectors arising from hypergraphs.
  arXiv  Detail & Related papers  (2023-12-15T19:00:00Z)
• Alignment and Outer Shell Isotropy for Hyperbolic Graph Contrastive Learning [69.6810940330906]
  We propose a novel contrastive learning framework to learn high-quality graph embedding. Specifically, we design the alignment metric that effectively captures the hierarchical data-invariant information. We show that in the hyperbolic space one has to address the leaf- and height-level uniformity which are related to properties of trees.
  arXiv  Detail & Related papers  (2023-10-27T15:31:42Z)
• Hypergraph Structure Inference From Data Under Smoothness Prior [46.568839316694515]
  We propose a method to infer the probability for each potential hyperedge without labelled data as supervision. We use this prior to derive the relation between the hypergraph structure and the node features via probabilistic modelling. Experiments on both synthetic and real-world data demonstrate that our method can learn meaningful hypergraph structures from data more efficiently than existing hypergraph structure inference methods.
  arXiv  Detail & Related papers  (2023-08-27T18:28:58Z)
• From Hypergraph Energy Functions to Hypergraph Neural Networks [94.88564151540459]
  We present an expressive family of parameterized, hypergraph-regularized energy functions. We then demonstrate how minimizers of these energies effectively serve as node embeddings. We draw parallels between the proposed bilevel hypergraph optimization, and existing GNN architectures in common use.
  arXiv  Detail & Related papers  (2023-06-16T04:40:59Z)
• Symmetric hypergraph states: Entanglement quantification and robust Bell nonlocality [0.0]
  We quantify entanglement and nonlocality for large classes of quantum hypergraph states. We recognize the resemblance between symmetric graph states and symmetric hypergraph states.
  arXiv  Detail & Related papers  (2023-02-03T12:49:32Z)
• Collaborative likelihood-ratio estimation over graphs [55.98760097296213]
  Graph-based Relative Unconstrained Least-squares Importance Fitting (GRULSIF) We develop this idea in a concrete non-parametric method that we call Graph-based Relative Unconstrained Least-squares Importance Fitting (GRULSIF) We derive convergence rates for our collaborative approach that highlights the role played by variables such as the number of available observations per node, the size of the graph, and how accurately the graph structure encodes the similarity between tasks.
  arXiv  Detail & Related papers  (2022-05-28T15:37:03Z)
• Hypergraph Convolutional Networks via Equivalency between Hypergraphs and Undirected Graphs [59.71134113268709]
  We present General Hypergraph Spectral Convolution(GHSC), a general learning framework that can handle EDVW and EIVW hypergraphs. In this paper, we show that the proposed framework can achieve state-of-the-art performance. Experiments from various domains including social network analysis, visual objective classification, protein learning demonstrate that the proposed framework can achieve state-of-the-art performance.
  arXiv  Detail & Related papers  (2022-03-31T10:46:47Z)
• 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)
• A Gap Between the Hypergraph and Stabilizer Entropy Cones [0.20999222360659606]
  We show that the stabilizer and hypergraph entropy cones coincide for four parties, leading to a conjecture of their equivalence at higher party numbers. We improve the characterization of stabilizer entropies and show that all linear rank inequalities at five parties, except for classical monotonicity, form facets of the stabilizer cone.
  arXiv  Detail & Related papers  (2020-06-29T18:08:37Z)
• Hypergraph min-cuts from quantum entropies [1.6312226592634047]
  We prove that the min-cut function of any weighted hypergraph can be approximated by the entropies of quantum states known as stabilizer states. It shows that the recently defined hypergraph cones are contained in the quantum stabilizer entropy cones.
  arXiv  Detail & Related papers  (2020-02-27T19:19:10Z)

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.