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

International journal of unconventional computing

Quantum Measurements and Universal Computation

Marius Nagy, Selim G. Akl

Published Jan 1, 2006• 17 citations
OpenAlex

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

Measurement and Quantum Computation

Gerard J Milburn, Cassius D'Helon

•Jan 1, 1998•0 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

Measurement-based quantum computation

Hans J. Briegel, Dan E. Browne, Wolfgang Dür +2 more

arXiv:0910.1116•Nature Physics•Jan 1, 2009•1,087 citations

Quantum Computation and Its Perspective

Craig S. Lent

FEDジャ-ナル•Mar 1, 1997•2 citations

Measurement-Based Quantum Turing Machines and their Universality

Simon Perdrix, Philippe Jorrand

Quantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In order to formalize these other forms of computation, while pointing out the role and the necessity of classical control in measurement-based computation, and for establishing a new upper bound of the minimal resources needed to quantum universality, a formal model is introduced by means of Measurement-based Quantum Turing Machines.

arXiv:quant-ph/0404146•Apr 26, 2004•25 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.
Quantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In order to formalize these other forms of computation, while pointing out the role and the necessity of classical control in measurement-based computation, and for establishing a new upper bound of the minimal resources needed to quantum universality, a formal model is introduced by means of Measurement-based Quantum Turing Machines.