Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1701.05688 · Physical Review A

Verification of hypergraph states

Tomoyuki Morimae, Yuki Takeuchi, Masahito Hayashi

Published Dec 20, 2017• 76 citations
arXivHTMLPDF

Abstract

Hypergraph states are generalizations of graph states where controlled-$Z$ gates on edges are replaced with generalized controlled-$Z$ gates on hyperedges. Hypergraph states have several advantages over graph states. For example, certain hypergraph states, such as the Union Jack states, are universal resource states for measurement-based quantum computing with only Pauli measurements, while graph state measurement-based quantum computing needs non-Clifford basis measurements. Furthermore, it is impossible to classically efficiently sample measurement results on hypergraph states unless the polynomial hierarchy collapses to the third level. Although several protocols have been proposed to verify graph states with only sequential single-qubit Pauli measurements, there was no verification method for hypergraph states. In this paper, we propose a method for verifying a certain class of hypergraph states with only sequential single-qubit Pauli measurements. Importantly, no i.i.d. property of samples is assumed in our protocol: any artificial entanglement among samples cannot fool the verifier. As applications of our protocol, we consider verified blind quantum computing with hypergraph states, and quantum computational supremacy demonstrations with hypergraph states.

DOI
10.1103/physreva.96.062321

Related papers

Quantum computational universality of hypergraph states with Pauli-X and Z basis measurements

Yuki Takeuchi, Tomoyuki Morimae, Masahito Hayashi

Measurement-based quantum computing is one of the most promising quantum computing models. Although various universal resource states have been proposed so far, it was open whether only two Pauli bases are enough for both of universal measurement-based quantum computing and its verification. In this paper, we construct a universal hypergraph state that only requires X and Z-basis measurements for universal measurement-based quantum computing. We also show that universal measurement-based quantum computing on our hypergraph state can be verified in polynomial time using only X and Z-basis measurements. Furthermore, in order to demonstrate an advantage of our hypergraph state, we construct a verifiable blind quantum computing protocol that requires only X and Z-basis measurements for the client.

arXiv:1809.07552•Scientific Reports•Sep 19, 2019•58 citations

Demonstration of hypergraph-state quantum information processing

Jieshan Huang, Xudong Li, Xiaojiong Chen +7 more

Complex entangled states are the key resources for measurement-based quantum computations, which is realised by performing a sequence of measurements on initially entangled qubits. Executable quantum algorithms in the graph-state quantum computing model are determined by the entanglement structure and the connectivity of entangled qubits. By generalisation from graph-type entanglement in which only the nearest qubits interact to a new type of hypergraph entanglement in which any subset of qubits can be arbitrarily entangled via hyperedges, hypergraph states represent more general resource states that allow arbitrary quantum computation with Pauli universality. Here we report experimental preparation, certification and processing of complete categories of four-qubit hypergraph states under the principle of local unitary equivalence, on a fully reprogrammable silicon-photonic quantum chip. Genuine multipartite entanglement for hypergraph states is certificated by the characterisation of entanglement witness, and the observation of violations of Mermin inequalities without any closure of distance or detection loopholes. A basic measurement-based protocol and an efficient resource state verification by color-encoding stabilizers are implemented with local Pauli measurement to benchmark the building blocks for hypergraph-state quantum computation. Our work prototypes hypergraph entanglement as a general resource for quantum information processing.

Nature Communications•Mar 23, 2024•34 citations

Quantum Hypergraph States: A Review

Davide Poderini, Dagmar Bruß, Chiara Macchiavello

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.

quant-pharXiv:2603.10917•Reports on Progress in Physics•Mar 12, 2026•3 citations

Efficient Verification of Hypergraph States

Huangjun Zhu, Masahito Hayashi

Graph and hypergraph states are of wide interest in quantum information processing as well as fundamental physics, and efficient verification of these states is key to various applications. The authors propose a simple recipe for verifying hypergraph states that requires only two distinct Pauli measurements for each party, and is dramatically more efficient than conventional protocols based on local measurements. This approach enables verification of hypergraph states and genuine multipartite entanglement of thousands of qubits, even in an adversarial scenario.

arXiv:1806.05565•Physical Review Applied•Nov 20, 2019•90 citations

Verification of colorable hypergraph states with stabilizer test

Hong Ge Tao, Xiaoqian Zhang, Lei Shao +1 more

Abstract Many-body quantum states, as a matter of fact, are extremely essential to solve certain mathematical problems or simulate quantum systems in measurement-based quantum computation. However, how to verify large-scale quantum states, such as hypergraph states, is an exceedingly hard task for many-body quantum systems. Here, we propose a novel fault-tolerant solution for the verification of colorable hypergraph states by using the stabilizer test. Furthermore, our protocol is dramatically facilitated by making only Pauli-X and Pauli-Z measurements. For geometric structure hypergraph states, the computational complexity of our protocol is polynomial. As to appliance, it will be also applied to blind quantum computing based on the no-signaling principle.

arXiv:2203.09989•Quantum Science and Technology•Nov 10, 2022•4 citations

Verification of blind quantum computation with entanglement witnesses

Qingshan Xu, Xiaoqing Tan, Rui Huang +1 more

Verifiable blind quantum computation provides a cloud scenario for scalable quantum information processing. However, constructing one resource-efficient verification protocol is still an open problem. In this paper, the context of verification we consider is the measurement-based model, in which the client receives the graph state prepared by the server and performs single-qubit measurements on it to drive the computation. We first utilize three entanglement witnesses to estimate the fidelity of the prepared graph state. Applying entanglement witnesses to design the test phase, we propose verification protocols. Our protocol requires overhead in terms of copies of the graph state that scales as $O({n}^{2}logn)$, where $n$ is the number of qubits of the graph state. Furthermore, the soundness of our protocol is improved. The advantages of our protocol are derived from the fact that each entanglement witness can be implemented by the client with a fixed number of measurement settings.

Physical Review A•Oct 12, 2021•20 citations
Hypergraph states are generalizations of graph states where controlled-ZZZ gates on edges are replaced with generalized controlled-ZZZ gates on hyperedges. Hypergraph states have several advantages over graph states. For example, certain hypergraph states, such as the Union Jack states, are universal resource states for measurement-based quantum computing with only Pauli measurements, while graph state measurement-based quantum computing needs non-Clifford basis measurements. Furthermore, it is impossible to classically efficiently sample measurement results on hypergraph states unless the polynomial hierarchy collapses to the third level. Although several protocols have been proposed to verify graph states with only sequential single-qubit Pauli measurements, there was no verification method for hypergraph states. In this paper, we propose a method for verifying a certain class of hypergraph states with only sequential single-qubit Pauli measurements. Importantly, no i.i.d. property of samples is assumed in our protocol: any artificial entanglement among samples cannot fool the verifier. As applications of our protocol, we consider verified blind quantum computing with hypergraph states, and quantum computational supremacy demonstrations with hypergraph states.
Measurement-based quantum computing is one of the most promising quantum computing models. Although various universal resource states have been proposed so far, it was open whether only two Pauli bases are enough for both of universal measurement-based quantum computing and its verification. In this paper, we construct a universal hypergraph state that only requires X and Z-basis measurements for universal measurement-based quantum computing. We also show that universal measurement-based quantum computing on our hypergraph state can be verified in polynomial time using only X and Z-basis measurements. Furthermore, in order to demonstrate an advantage of our hypergraph state, we construct a verifiable blind quantum computing protocol that requires only X and Z-basis measurements for the client.
Complex entangled states are the key resources for measurement-based quantum computations, which is realised by performing a sequence of measurements on initially entangled qubits. Executable quantum algorithms in the graph-state quantum computing model are determined by the entanglement structure and the connectivity of entangled qubits. By generalisation from graph-type entanglement in which only the nearest qubits interact to a new type of hypergraph entanglement in which any subset of qubits can be arbitrarily entangled via hyperedges, hypergraph states represent more general resource states that allow arbitrary quantum computation with Pauli universality. Here we report experimental preparation, certification and processing of complete categories of four-qubit hypergraph states under the principle of local unitary equivalence, on a fully reprogrammable silicon-photonic quantum chip. Genuine multipartite entanglement for hypergraph states is certificated by the characterisation of entanglement witness, and the observation of violations of Mermin inequalities without any closure of distance or detection loopholes. A basic measurement-based protocol and an efficient resource state verification by color-encoding stabilizers are implemented with local Pauli measurement to benchmark the building blocks for hypergraph-state quantum computation. Our work prototypes hypergraph entanglement as a general resource for quantum information processing.
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.
Graph and hypergraph states are of wide interest in quantum information processing as well as fundamental physics, and efficient verification of these states is key to various applications. The authors propose a simple recipe for verifying hypergraph states that requires only two distinct Pauli measurements for each party, and is dramatically more efficient than conventional protocols based on local measurements. This approach enables verification of hypergraph states and genuine multipartite entanglement of thousands of qubits, even in an adversarial scenario.
Abstract Many-body quantum states, as a matter of fact, are extremely essential to solve certain mathematical problems or simulate quantum systems in measurement-based quantum computation. However, how to verify large-scale quantum states, such as hypergraph states, is an exceedingly hard task for many-body quantum systems. Here, we propose a novel fault-tolerant solution for the verification of colorable hypergraph states by using the stabilizer test. Furthermore, our protocol is dramatically facilitated by making only Pauli-X and Pauli-Z measurements. For geometric structure hypergraph states, the computational complexity of our protocol is polynomial. As to appliance, it will be also applied to blind quantum computing based on the no-signaling principle.
Verifiable blind quantum computation provides a cloud scenario for scalable quantum information processing. However, constructing one resource-efficient verification protocol is still an open problem. In this paper, the context of verification we consider is the measurement-based model, in which the client receives the graph state prepared by the server and performs single-qubit measurements on it to drive the computation. We first utilize three entanglement witnesses to estimate the fidelity of the prepared graph state. Applying entanglement witnesses to design the test phase, we propose verification protocols. Our protocol requires overhead in terms of copies of the graph state that scales as O(n2logn)O({n}^{2}logn)O(n2logn), where nnn is the number of qubits of the graph state. Furthermore, the soundness of our protocol is improved. The advantages of our protocol are derived from the fact that each entanglement witness can be implemented by the client with a fixed number of measurement settings.