Quantum hypergraph states: a review

• URL: http://arxiv.org/abs/2512.02955v2
• Date: Wed, 10 Dec 2025 00:46:26 GMT
• Title: Quantum hypergraph states: a review
• Authors: Vinícius Salem,
• Abstract summary: Quantum hypergraph states emerged in the literature as a generalization of graph states, and since then, considerable progress has been made toward implementing this class of genuine multipartite entangled states for quantum information and computation.<n>Here, we review the definition of hypergraph states and their main applications so far, both in discrete-variable and continuous-variable quantum information.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum hypergraph states emerged in the literature as a generalization of graph states, and since then, considerable progress has been made toward implementing this class of genuine multipartite entangled states for quantum information and computation. Here, we review the definition of hypergraph states and their main applications so far, both in discrete-variable and continuous-variable quantum information.

Related papers

• 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.<n>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)
• Learning quantum states of continuous variable systems [4.05533173496439]
  Quantum state tomography is aimed at deriving a classical description of an unknown state from measurement data. We prove that tomography of continuous-variable systems is extremely inefficient in terms of time resources. We also prove that tomography of Gaussian states is efficient.
  arXiv  Detail & Related papers  (2024-05-02T16:19:55Z)
• Quantum multigraph states and multihypergraph states [1.3124312213244904]
  We propose two classes of multiparticle entangled states, the multigraph states and multihypergraph states. A key discovery is the one-to-one correspondence between the proposed multihypergraph states and the generalized real equally weighted states when d is prime.
  arXiv  Detail & Related papers  (2023-12-22T03:01:34Z)
• Multipartite Entanglement Distribution in Quantum Networks using Subgraph Complementations [8.194910516215462]
  We propose a novel approach for distributing graph states across a quantum network.<n>We classify common classes of graph states, along with their optimal distribution time using subgraph complementations.
  arXiv  Detail & Related papers  (2023-08-25T23:03:25Z)
• 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)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Quantum-Memory-Enhanced Preparation of Nonlocal Graph States [10.086067943202416]
  Graph states are an important class of multipartite entangled states. We show an efficient scheme to prepare graph states with only two atomic excitations in quantum networks. Our work demonstrates the prospect of efficient generation of multipartite entangled states in large-scale distributed systems.
  arXiv  Detail & Related papers  (2022-02-27T15:42:09Z)
• From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
  We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions. For its practicability and wide-applicability, we give a brief review of typical graph learning techniques. We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
  arXiv  Detail & Related papers  (2022-02-19T02:56:47Z)
• Facial Expression Recognition on a Quantum Computer [68.8204255655161]
  We show a possible solution to facial expression recognition using a quantum machine learning approach. We define a quantum circuit that manipulates the graphs adjacency matrices encoded into the amplitudes of some appropriately defined quantum states.
  arXiv  Detail & Related papers  (2021-02-09T13:48:00Z)
• Holographic tensor network models and quantum error correction: A topical review [78.28647825246472]
  Recent progress in studies of holographic dualities has led to a confluence with concepts and techniques from quantum information theory. A particularly successful approach has involved capturing holographic properties by means of tensor networks.
  arXiv  Detail & Related papers  (2021-02-04T14:09:21Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Quantum information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)
• 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)
• 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.