Quantum hypergraph states form a generalisation of the graph state formalism that goes beyond the pairwise (dyadic) interactions imposed by remaining inside the Gaussian approximation. Networks of such states are able to achieve universality for continuous variable measurement based quantum computation with only Gaussian measurements. For normalised states, the simplest hypergraph states are formed from k -adic interactions among a collection of k harmonic oscillator ground states. However such powerful resources have not yet been observed in experiments and their robustness and scalability have not been tested. Here we develop and analyse necessary criteria for hypergraph nonclassicality based on simultaneous nonlinear squeezing in the nullifiers of hypergraph states. We put forward an essential analysis of their robustness to realistic scenarios involving thermalisation or loss and suggest several basic proof-of-principle options for experiments to observe nonclassicality in hypergraph states.
Quantum hypergraph states form a generalisation of the graph state formalism that goes beyond the pairwise (dyadic) interactions imposed by remaining inside the Gaussian approximation. Networks of such states are able to achieve universality for continuous variable measurement based quantum computation with only Gaussian measurements. For normalised states, the simplest hypergraph states are formed from k -adic interactions among a collection of k harmonic oscillator ground states. However such powerful resources have not yet been observed in experiments and their robustness and scalability have not been tested. Here we develop and analyse necessary criteria for hypergraph nonclassicality based on simultaneous nonlinear squeezing in the nullifiers of hypergraph states. We put forward an essential analysis of their robustness to realistic scenarios involving thermalisation or loss and suggest several basic proof-of-principle options for experiments to observe nonclassicality in hypergraph states.
Quantum hypergraph states extend the well-studied class of graph states by taking into account multi-qubit interactions through hyperedges. They provide a powerful framework to represent a family of quantum states with genuine multipartite entanglement. In this review, we provide a compact overview of the formal structure, entanglement characteristics, and operational relevance of hypergraph states in quantum information theory. We begin by introducing their mathematical foundations and generalizations of the stabilizer formalism. A central focus is placed on their entanglement properties, including the classification under local unitary (LU) and stochastic local operations with classical communication (SLOCC), the quantification of multipartite entanglement, and detection techniques via entanglement witnesses. We also explore other nonclassical features of hypergraph states, such as contextuality and genuine multipartite nonlocality, derived from stabilizer-based Bell-type inequalities. Additional attention is given to the role of hypergraph states in error correction, and as a computational resource in measurement-based quantum computation (MBQC), and to their non-stabilizer character - quantified via resource-theoretic measures of quantum magic. Finally we review their generalization to higher dimensions, i.e. to qudits and continuous variables.
Quantum hypergraph states extend the well-studied class of graph states by taking into account multi-qubit interactions through hyperedges. They provide a powerful framework to represent a family of quantum states with genuine multipartite entanglement. In this review, we provide a compact overview of the formal structure, entanglement characteristics, and operational relevance of hypergraph states in quantum information theory. We begin by introducing their mathematical foundations and generalizations of the stabilizer formalism. A central focus is placed on their entanglement properties, including the classification under local unitary and stochastic local operations with classical communication, the quantification of multipartite entanglement, and detection techniques via entanglement witnesses. We also explore other nonclassical features of hypergraph states, such as contextuality and genuine multipartite nonlocality, derived from stabilizer-based Bell-type inequalities. Additional attention is given to the role of hypergraph states in error correction, and as a computational resource in measurement-based quantum computation, and to their non-stabilizer character, quantified via resource-theoretic measures of quantum magic. Finally we review their generalization to higher dimensions, i.e. to qudits and continuous variables.
The measurement-based, or one-way, model of quantum computation for continuous variables uses a highly entangled state called a cluster state to accomplish the task of computing. Cluster states that are universal for computation are a subset of a class of states called graph states. These states are Gaussian states and therefore require that the homodyne detection (Gaussian measurement) scheme is supplemented with a non-Gaussian measurement for universal computation, a significant experimental challenge. Here we define a non-Gaussian class of states based on hypergraphs which we demonstrate satisfy the requirements of the Lloyd-Braunstein criteria while restricted to a Gaussian measurement strategy. Our main result is to show that, taking advantage of the intrinsic multimode nonlinearity, a hypergraph consisting of 3-edges can be used to apply a three-mode operation to an input three-mode state. As a special case, this technique can be used to apply the cubic phase gate to a single mode.
Hypergraph states form a family of multiparticle quantum states that generalizes the well-known concept of Greenberger-Horne-Zeilinger states, cluster states, and more broadly graph states. We study the nonlocal properties of quantum hypergraph states. We demonstrate that the correlations in hypergraph states can be used to derive various types of nonlocality proofs, including Hardy-type arguments and Bell inequalities for genuine multiparticle nonlocality. Moreover, we show that hypergraph states allow for an exponentially increasing violation of local realism which is robust against loss of particles. Our results suggest that certain classes of hypergraph states are novel resources for quantum metrology and measurement-based quantum computation.
We provide a graphical method to describe and analyze non-Gaussian quantum states using a hypergraph framework. These states are pivotal resources for quantum computing, communication, and metrology, but their characterization is hindered by their complex high-order correlations. The framework encapsulates transformation rules for a series of typical Gaussian unitary operation and local quadrature measurement, offering a visually intuitive tool for manipulating such states through experimentally feasible pathways. Notably, we develop methods for the generation of complex hypergraph states with more or higher-order hyperedges from simple structures through Gaussian operations only, facilitated by our graphical rules. We present illustrative examples on the preparation of non-Gaussian states rooted in these graph-based formalisms, revealing their potential to advance continuous-variable general quantum computing capabilities.
Hypergraph states are multi-qubit states that form a subset of the locally maximally entangleable states and a generalization of the well--established notion of graph states. Mathematically, they can conveniently be described by a hypergraph that indicates a possible generation procedure of these states; alternatively, they can also be phrased in terms of a non-local stabilizer formalism. In this paper, we explore the entanglement properties and nonclassical features of hypergraph states. First, we identify the equivalence classes under local unitary transformations for up to four qubits, as well as important classes of five- and six-qubit states, and determine various entanglement properties of these classes. Second, we present general conditions under which the local unitary equivalence of hypergraph states can simply be decided by considering a finite set of transformations with a clear graph-theoretical interpretation. Finally, we consider the question whether hypergraph states and their correlations can be used to reveal contradictions with classical hidden variable theories. We demonstrate that various noncontextuality inequalities and Bell inequalities can be derived for hypergraph states.