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

Optics & Laser Technology

Strictly universal hypergraph states for measurement-based blind quantum computation

Junyu Quan, Yuxun Wang, Li Peishan, Yanyan Feng, Qin Li

Published May 15, 2026• 0 citations
Publisher
DOI
10.1016/j.optlastec.2026.115531

Related papers

Strictly universal hypergraph states for measurement-based blind quantum computation

QUAN Junyu, Yuxun Wang, Li Peishan +2 more

•Jan 1, 2026•0 citations

Measurement-Based and Universal Blind Quantum Computation

Anne Broadbent, Joseph F. Fitzsimons, Elham Kashefi

Lecture notes in computer science•Jan 1, 2010•23 citations

Measurement-based universal blind quantum computation with minor resources

Xiaoqian Zhang

arXiv:1801.03090•Quantum Information Processing•Dec 23, 2021•10 citations

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•55 citations

Catalytic Transformation from Computationally Universal to Strictly Universal Measurement-Based Quantum Computation

Yuki Takeuchi

There are two types of universality in measurement-based quantum computation (MBQC): strict and computational. It is well known that the former is stronger than the latter. We present a method of transforming from a certain type of computationally universal MBQC to a strictly universal one. Our method simply replaces a single qubit in a resource state with a Pauli-Y eigenstate. We applied our method to show that hypergraph states can be made strictly universal with only Pauli measurements, while only computationally universal hypergraph states were known.

arXiv:2312.16433•Physical Review Letters•Jul 30, 2024•4 citations

A hybrid universal blind quantum computation

Xiaoqian Zhang, Weiqi Luo, Guo‐Qiang Zeng +4 more

arXiv:1809.06000•Information Sciences•May 22, 2019•16 citations
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.
There are two types of universality in measurement-based quantum computation (MBQC): strict and computational. It is well known that the former is stronger than the latter. We present a method of transforming from a certain type of computationally universal MBQC to a strictly universal one. Our method simply replaces a single qubit in a resource state with a Pauli-Y eigenstate. We applied our method to show that hypergraph states can be made strictly universal with only Pauli measurements, while only computationally universal hypergraph states were known.