Symmetric hypergraph states: Entanglement quantification and robust Bell nonlocality

• URL: http://arxiv.org/abs/2302.01695v1
• Date: Fri, 3 Feb 2023 12:49:32 GMT
• Title: Symmetric hypergraph states: Entanglement quantification and robust Bell nonlocality
• Authors: Jan N\"oller, Otfried G\"uhne, Mariami Gachechiladze
• Abstract summary: We quantify entanglement and nonlocality for large classes of quantum hypergraph states. We recognize the resemblance between symmetric graph states and symmetric hypergraph states.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum hypergraph states are the natural generalization of graph states. Here we investigate and analytically quantify entanglement and nonlocality for large classes of quantum hypergraph states. More specifically, we connect the geometric measure of entanglement of symmetric hypergraphs to their local Pauli stabilizers. As a result we recognize the resemblance between symmetric graph states and symmetric hypergraph states, which explains both, exponentially increasing violation of local realism for infinitely many classes of hypergraph states and its robustness towards particle loss.

Related papers

• Nonclassical Nullifiers for Quantum Hypergraph States [0.0]
  Quantum hypergraph states form a generalisation of the graph state formalism. Networks of such states are able to achieve universality for continuous variable measurement based quantum computation.
  arXiv  Detail & Related papers  (2025-02-04T11:06:19Z)
• Calibrated hypergraph states: II calibrated hypergraph state construction and applications [0.0]
  We introduce and investigate calibrated hypergraph states, an extension of weighted hypergraph states codified by hypergraphs equipped with calibrations. We build upon the graded $varOmega$ monadic framework worked out in the companion paper, focusing on qudits over a generic Galois ring.
  arXiv  Detail & Related papers  (2025-01-31T08:57:56Z)
• Provably Extending PageRank-based Local Clustering Algorithm to Weighted Directed Graphs with Self-Loops and to Hypergraphs [40.215737469808026]
  This work focuses on graph local clustering, which has broad applications beyond graphs because of the internal connectivities within various modalities. We extend the non-approximating Andersen-Chung-Lang ("ACL") algorithm beyond discrete graphs and generalize its quadratic optimality to a wider range of graphs. We theoretically prove that, under two mild conditions, both algorithms can identify a quadratically optimal local cluster in terms of conductance with at least 1/2 probability.
  arXiv  Detail & Related papers  (2024-12-04T03:56:14Z)
• Hypergraphs as Weighted Directed Self-Looped Graphs: Spectral Properties, Clustering, Cheeger Inequality [40.215737469808026]
  Hypergraphs arise when studying group relations and have been widely used in the field of machine learning. There has not been a unified formulation of hypergraphs, yet the recently proposed edge-dependent Rayleigh weights (EDVW) modeling is one of the most generalized modeling methods of hypergraphs. We propose our definitions of hypergraph Quotient, NCut, boundary/cut, volume, and conductance, which are consistent with the corresponding definitions on graphs. Then, we prove that the normalized hypergraph Laplacian is associated with the NCut value, which inspires our HyperClus-G algorithm for spectral clustering
  arXiv  Detail & Related papers  (2024-10-23T05:16:48Z)
• Non-symmetric GHZ states; weighted hypergraph and controlled-unitary graph representations [0.0]
  Non-symmetric GHZ states are multipartite entangled states with potential applications in quantum information. We introduce two novel graph formalisms and stabilizers for non-symmetric GHZ states. Our findings enhance the understanding of non-symmetric GHZ states and their potential applications in quantum information science.
  arXiv  Detail & Related papers  (2024-08-05T18:00:18Z)
• Magic of quantum hypergraph states [6.3109948645563465]
  We analytically investigate the magic resource of archetypal multipartite quantum states -- quantum hypergraph states. Our study advances the understanding of multipartite quantum magic and could lead to applications in quantum computing and quantum many-body physics.
  arXiv  Detail & Related papers  (2023-08-03T17:21:55Z)
• Boundary theories of critical matchgate tensor networks [59.433172590351234]
  Key aspects of the AdS/CFT correspondence can be captured in terms of tensor network models on hyperbolic lattices. For tensors fulfilling the matchgate constraint, these have previously been shown to produce disordered boundary states. We show that these Hamiltonians exhibit multi-scale quasiperiodic symmetries captured by an analytical toy model.
  arXiv  Detail & Related papers  (2021-10-06T18:00:03Z)
• Graph-Theoretic Framework for Self-Testing in Bell Scenarios [37.067444579637076]
  Quantum self-testing is the task of certifying quantum states and measurements using the output statistics solely. We present a new approach for quantum self-testing in Bell non-locality scenarios.
  arXiv  Detail & Related papers  (2021-04-27T08:15:01Z)
• A Thorough View of Exact Inference in Graphs from the Degree-4 Sum-of-Squares Hierarchy [37.34153902687548]
  We tackle the problem of exactly recovering an unknown ground-truth binary labeling of the nodes from a single corrupted observation of each edge. We apply a hierarchy of relaxations known as the sum-of-squares hierarchy, to the problem. We show that the solution of the dual of the relaxed problem is related to finding edge weights of the Johnson and Kneser graphs.
  arXiv  Detail & Related papers  (2021-02-16T08:36:19Z)
• 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)
• 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.