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

Unifying Quantum Computation with Projective Measurements only and One-Way Quantum Computation

Philippe Jorrand, Perdrix, S

Published Jan 1, 2004• 29 citations
OpenAlex

Abstract

Abstract. Quantum measurement is universal for quantum computation (Nielsen [4], Raussendorf [7,8]). Two models for performing measurement-based quantum computation exist: the one-way quantum computer was introduced by Briegel and Raussendorf [7], and quantum computation via projective measurements only by Nielsen [4]. The more recent development of this second model is based on state transfers [6] instead of teleportation. From this development, a finite but approximate quantum universal family of observables is exhibited, which includes only one two-qubit observable, while others are one-qubit observables [6]. In this article, an infinite but exact quantum universal family of observables is proposed, including also only one two-qubit observable. The rest of the paper is dedicated to compare these two models of measurement-based quantum computation, i.e. one-way quantum computation and quantum computation via projective measurements only. From this comparison, which was initiated by Cirac and Verstraete [9], closer and more natural connections appear between these two models. These close connections lead to a unified view of measurement-based quantum computation. 1

Related papers

Unifying quantum computation with projective measurements only and one-way quantum computation

Philippe Jorrand, Simon Perdrix

Quantum measurement is universal for quantum computation. Two models for performing measurement-based quantum computation exist: the one-way quantum computater was introduced by Briegel and Raussendorf and quantum computation via projective measurements only by Nielsen. The more recent development of this second model is based on state transfers instead of teleportation. From this development a finite but approximate quantum universal family of observables is exhibited which includes only one two-qubit observable while others are one-qubit observables. In this article an infinite but exact quantum universal family of observables is proposed including also only one two-qubit observable. The rest of the paper is dedicated to compare these two models of measurement-based quantum computation i.e. one-way quantum computation and quantum computation via projective measurements only. From this comparison which was initiated by Cirac and Verstraete closer and more natural connections appear between these two models. These close connections lead to a unified view of measurement-based quantum computation.

arXiv:quant-ph/0404125•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jun 1, 2005•12 citations

Resources for measurement−based quantum computation: A unifying view

Simon Perdrix

Alternative quantum computing models to the standard unitary-based model have been independently introduced and developed. One of them, introduced by Nielsen [11] is based on projective measurements only. Another, the one-way quantum computation introduced by Briegel and Raussendorf [13] consists in applying local measurements on an offline-prepared entangled state, called cluster state. The model via measurements only has been successively improved [12], decreasing the resources (in terms of number of different projective measurements) used for a universal quantum computation. The last improvement is based on state transfer [15]. The resources used by the one-way quantum computation are not limited to local measurements, since the preparation of the initial cluster state has to be taken into account. It turns out that the resources used by the one-way quantum computation if the cluster state is prepared by means of projective measurements [9] are similar to the resources used by the quantum computation via measurements only based on state transfer. Moreover, the measurement-based preparation of the initial cluster state leads to a natural unification of these models. If, instead of a measurement-based preparation, a unitary-based preparation of the cluster state is considered, a natural unification between the one-way quantum computation and an hybrid model allowing both unitary transformation and projective measurements is obtained [3].

•Jan 1, 2005•1 citation

STATE TRANSFER INSTEAD OF TELEPORTATION IN MEASUREMENT-BASED QUANTUM COMPUTATION

Simon Perdrix

Quantum measurement is universal for quantum computation. The model of quantum computation introduced by Nielsen and further developed by Leung relies on a generalized form of teleportation. In order to simulate any n-qubit unitary transformation with this model, four auxiliary qubits are required. Moreover Leung exhibited a universal family of observables composed of one one-qubit measurement and four two-qubit measurements. We introduce a model of quantum computation via measurements only, relying on state transfer: state transfer only retains the part of teleportation which is necessary for computation. In order to simulate any n-qubit unitary transformation with this new model, only one auxiliary qubit is required. Moreover we exhibit a universal family of observables composed of three one-qubit measurements and only one two-qubit measurement. This model improves those of Nielsen and Leung in terms of both the number of auxiliary qubits and the number of two-qubit measurements required for quantum universality. In both cases, the minimal amounts of necessary resources are now reached: one auxiliary qubit (because measurement is destructive) and one two-qubit measurement (for creating entanglement).

arXiv:quant-ph/0402204•International Journal of Quantum Information•Dec 16, 2004•63 citations

Unified derivations of measurement-based schemes for quantum computation

Andrew M. Childs, Debbie Leung, Michael A. Nielsen

We present unified, systematic derivations of schemes in the two known measurement-based models of quantum computation. The first model (introduced by Raussendorf and Briegel, [Phys. Rev. Lett. 86, 5188 (2001)]) uses a fixed entangled state, adaptive measurements on single qubits, and feedforward of the measurement results. The second model (proposed by Nielsen, [Phys. Lett. A 308, 96 (2003)] and further simplified by Leung, [Int. J. Quant. Inf. 2, 33 (2004)]) uses adaptive two-qubit measurements that can be applied to arbitrary pairs of qubits, and feedforward of the measurement results. The underlying principle of our derivations is a variant of teleportation introduced by Zhou, Leung, and Chuang, [Phys. Rev. A 62, 052316 (2000)]. Our derivations unify these two measurement-based models of quantum computation and provide significantly simpler schemes.

arXiv:quant-ph/0404132•Physical Review A•Mar 17, 2005•135 citations

The measurement calculus

Vincent Danos A, Elham Kashefi, Prakash Panangaden

Measurement-based quantum computation has emerged from the physics community as a new approach to quantum computation where the notion of measurement is the main driving force of computation. This is in contrast with the more traditional circuit model that is based on unitary operations. Among measurement-based quantum computation methods, the recently introduced one-way quantum computer [Raussendorf and Briegel 2001] stands out as fundamental. We develop a rigorous mathematical model underlying the one-way quantum computer and present a concrete syntax and operational semantics for programs, which we call patterns , and an algebra of these patterns derived from a denotational semantics. More importantly, we present a calculus for reasoning locally and compositionally about these patterns. We present a rewrite theory and prove a general standardization theorem which allows all patterns to be put in a semantically equivalent standard form. Standardization has far-reaching consequences: a new physical architecture based on performing all the entanglement in the beginning, parallelization by exposing the dependency structure of measurements and expressiveness theorems. Furthermore we formalize several other measurement-based models, for example, Teleportation, Phase and Pauli models and present compositional embeddings of them into and from the one-way model. This allows us to transfer all the theory we develop for the one-way model to these models. This shows that the framework we have developed has a general impact on measurement-based computation and is not just particular to the one-way quantum computer.

Journal of the ACM•Apr 1, 2007•193 citations

Universal quantum computation with two- and three-qubit projective measurements

Stephen Fenner, Yong Zhang

We present a finite set of projective measurements that, together with quantum memory and preparation of the |0> state, suffice for universal quantum computation. This extends work of Nielsen [quant-ph/0108020], who proposed a scheme in which an arbitrary unitary operation on n qubits can be simulated using only projective measurements on at most 2n qubits. All measurements in our set involve two qubits, except two measurements which involve three qubits. Thus we improve by one the upper bound, implied by Nielsen's results, on the maximum number of qubits needed to participate in any single measurement to achieve universal quantum computation. Each of our measurements is two-valued, and each can be expressed mathematically as a Boolean combination of single-qubit measurements.

arXiv:quant-ph/0111077•Nov 13, 2001•12 citations
Abstract. Quantum measurement is universal for quantum computation (Nielsen [4], Raussendorf [7,8]). Two models for performing measurement-based quantum computation exist: the one-way quantum computer was introduced by Briegel and Raussendorf [7], and quantum computation via projective measurements only by Nielsen [4]. The more recent development of this second model is based on state transfers [6] instead of teleportation. From this development, a finite but approximate quantum universal family of observables is exhibited, which includes only one two-qubit observable, while others are one-qubit observables [6]. In this article, an infinite but exact quantum universal family of observables is proposed, including also only one two-qubit observable. The rest of the paper is dedicated to compare these two models of measurement-based quantum computation, i.e. one-way quantum computation and quantum computation via projective measurements only. From this comparison, which was initiated by Cirac and Verstraete [9], closer and more natural connections appear between these two models. These close connections lead to a unified view of measurement-based quantum computation. 1
Quantum measurement is universal for quantum computation. Two models for performing measurement-based quantum computation exist: the one-way quantum computater was introduced by Briegel and Raussendorf and quantum computation via projective measurements only by Nielsen. The more recent development of this second model is based on state transfers instead of teleportation. From this development a finite but approximate quantum universal family of observables is exhibited which includes only one two-qubit observable while others are one-qubit observables. In this article an infinite but exact quantum universal family of observables is proposed including also only one two-qubit observable. The rest of the paper is dedicated to compare these two models of measurement-based quantum computation i.e. one-way quantum computation and quantum computation via projective measurements only. From this comparison which was initiated by Cirac and Verstraete closer and more natural connections appear between these two models. These close connections lead to a unified view of measurement-based quantum computation.
Alternative quantum computing models to the standard unitary-based model have been independently introduced and developed. One of them, introduced by Nielsen [11] is based on projective measurements only. Another, the one-way quantum computation introduced by Briegel and Raussendorf [13] consists in applying local measurements on an offline-prepared entangled state, called cluster state. The model via measurements only has been successively improved [12], decreasing the resources (in terms of number of different projective measurements) used for a universal quantum computation. The last improvement is based on state transfer [15]. The resources used by the one-way quantum computation are not limited to local measurements, since the preparation of the initial cluster state has to be taken into account. It turns out that the resources used by the one-way quantum computation if the cluster state is prepared by means of projective measurements [9] are similar to the resources used by the quantum computation via measurements only based on state transfer. Moreover, the measurement-based preparation of the initial cluster state leads to a natural unification of these models. If, instead of a measurement-based preparation, a unitary-based preparation of the cluster state is considered, a natural unification between the one-way quantum computation and an hybrid model allowing both unitary transformation and projective measurements is obtained [3].
Quantum measurement is universal for quantum computation. The model of quantum computation introduced by Nielsen and further developed by Leung relies on a generalized form of teleportation. In order to simulate any n-qubit unitary transformation with this model, four auxiliary qubits are required. Moreover Leung exhibited a universal family of observables composed of one one-qubit measurement and four two-qubit measurements. We introduce a model of quantum computation via measurements only, relying on state transfer: state transfer only retains the part of teleportation which is necessary for computation. In order to simulate any n-qubit unitary transformation with this new model, only one auxiliary qubit is required. Moreover we exhibit a universal family of observables composed of three one-qubit measurements and only one two-qubit measurement. This model improves those of Nielsen and Leung in terms of both the number of auxiliary qubits and the number of two-qubit measurements required for quantum universality. In both cases, the minimal amounts of necessary resources are now reached: one auxiliary qubit (because measurement is destructive) and one two-qubit measurement (for creating entanglement).
We present unified, systematic derivations of schemes in the two known measurement-based models of quantum computation. The first model (introduced by Raussendorf and Briegel, [Phys. Rev. Lett. 86, 5188 (2001)]) uses a fixed entangled state, adaptive measurements on single qubits, and feedforward of the measurement results. The second model (proposed by Nielsen, [Phys. Lett. A 308, 96 (2003)] and further simplified by Leung, [Int. J. Quant. Inf. 2, 33 (2004)]) uses adaptive two-qubit measurements that can be applied to arbitrary pairs of qubits, and feedforward of the measurement results. The underlying principle of our derivations is a variant of teleportation introduced by Zhou, Leung, and Chuang, [Phys. Rev. A 62, 052316 (2000)]. Our derivations unify these two measurement-based models of quantum computation and provide significantly simpler schemes.
Measurement-based quantum computation has emerged from the physics community as a new approach to quantum computation where the notion of measurement is the main driving force of computation. This is in contrast with the more traditional circuit model that is based on unitary operations. Among measurement-based quantum computation methods, the recently introduced one-way quantum computer [Raussendorf and Briegel 2001] stands out as fundamental. We develop a rigorous mathematical model underlying the one-way quantum computer and present a concrete syntax and operational semantics for programs, which we call patterns , and an algebra of these patterns derived from a denotational semantics. More importantly, we present a calculus for reasoning locally and compositionally about these patterns. We present a rewrite theory and prove a general standardization theorem which allows all patterns to be put in a semantically equivalent standard form. Standardization has far-reaching consequences: a new physical architecture based on performing all the entanglement in the beginning, parallelization by exposing the dependency structure of measurements and expressiveness theorems. Furthermore we formalize several other measurement-based models, for example, Teleportation, Phase and Pauli models and present compositional embeddings of them into and from the one-way model. This allows us to transfer all the theory we develop for the one-way model to these models. This shows that the framework we have developed has a general impact on measurement-based computation and is not just particular to the one-way quantum computer.
We present a finite set of projective measurements that, together with quantum memory and preparation of the |0> state, suffice for universal quantum computation. This extends work of Nielsen [quant-ph/0108020], who proposed a scheme in which an arbitrary unitary operation on n qubits can be simulated using only projective measurements on at most 2n qubits. All measurements in our set involve two qubits, except two measurements which involve three qubits. Thus we improve by one the upper bound, implied by Nielsen's results, on the maximum number of qubits needed to participate in any single measurement to achieve universal quantum computation. Each of our measurements is two-valued, and each can be expressed mathematically as a Boolean combination of single-qubit measurements.