A Gap Between the Hypergraph and Stabilizer Entropy Cones

• URL: http://arxiv.org/abs/2006.16292v2
• Date: Fri, 17 Dec 2021 19:57:08 GMT
• Title: A Gap Between the Hypergraph and Stabilizer Entropy Cones
• Authors: Ning Bao, Newton Cheng, Sergio Hern\'andez-Cuenca, Vincent Paul Su
• Abstract summary: 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.
• Score: 0.20999222360659606
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: It was recently found that the stabilizer and hypergraph entropy cones coincide for four parties, leading to a conjecture of their equivalence at higher party numbers. In this note, we show this conjecture to be false by proving new inequalities obeyed by all hypergraph entropy vectors that exclude particular stabilizer states on six qubits. By further leveraging this connection, 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. Additionally, by studying minimum cuts on hypergraphs, we prove some structural properties of hypergraph representations of entanglement and generalize the notion of entanglement wedge nesting in holography.

Related papers

• Critical spin models from holographic disorder [49.1574468325115]
  We study the behavior of XXZ spin chains with a quasiperiodic disorder not present in continuum holography. Our results suggest the existence of a class of critical phases whose symmetries are derived from models of discrete holography.
  arXiv  Detail & Related papers  (2024-09-25T18:00:02Z)
• 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)
• An Entropic Lens on Stabilizer States [0.0]
  We show how the two subgraphs already present at two qubits are embedded into more complicated subgraphs at three and four qubits. We argue that no additional types of subgraph appear beyond four qubits, but that the entropic structures within the subgraphs can grow progressively more complicated as the qubit number increases.
  arXiv  Detail & Related papers  (2022-04-15T18:00:12Z)
• Information Limits for Detecting a Subhypergraph [6.903929927172917]
  We consider the problem of recovering a subhypergraph based on an observed adjacency tensor corresponding to a uniform hypergraph. We consider both weak recovery and exact recovery of the subhypergraph, and establish information-theoretic limits in each case.
  arXiv  Detail & Related papers  (2021-05-05T18:08:42Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)
• 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)
• Hamiltonian systems, Toda lattices, Solitons, Lax Pairs on weighted Z-graded graphs [62.997667081978825]
  We identify conditions which allow one to lift one dimensional solutions to solutions on graphs. We show that even for a simple example of a topologically interesting graph the corresponding non-trivial Lax pairs and associated unitary transformations do not lift to a Lax pair on the Z-graded graph.
  arXiv  Detail & Related papers  (2020-08-11T17:58:13Z)
• Debiased Sinkhorn barycenters [110.79706180350507]
  Entropy regularization in optimal transport (OT) has been the driver of many recent interests for Wasserstein metrics and barycenters in machine learning. We show how this bias is tightly linked to the reference measure that defines the entropy regularizer. We propose debiased Wasserstein barycenters that preserve the best of both worlds: fast Sinkhorn-like iterations without entropy smoothing.
  arXiv  Detail & Related papers  (2020-06-03T23:06:02Z)
• Semi-supervised Hypergraph Node Classification on Hypergraph Line Expansion [7.933465724913661]
  We propose a new hypergraph formulation named the emphline expansion (LE) for hypergraphs learning. The proposed emphline expansion makes existing graph learning algorithms compatible with the higher-order structure. We evaluate the proposed line expansion on five hypergraph datasets, the results show that our method beats SOTA baselines by a significant margin.
  arXiv  Detail & Related papers  (2020-05-11T03:02:21Z)
• 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)
• 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.