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

Physical Review Letters

A One-Way Quantum Computer

Robert Raussendorf, Hans J. Briegel

Published May 28, 2001• 4,478 citations
Publisher

Abstract

We present a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. The measurements are used to imprint a quantum logic circuit on the state, thereby destroying its entanglement at the same time. Cluster states are thus one-way quantum computers and the measurements form the program.

DOI
10.1103/physrevlett.86.5188

Related papers

Measurement-based quantum computation on cluster states

Robert Raussendorf, Dan E. Browne, Hans J. Briegel

We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. We prove its universality, describe why its underlying computational model is different from the network model of quantum computation, and relate quantum algorithms to mathematical graphs. Further we investigate the scaling of required resources and give a number of examples for circuits of practical interest such as the circuit for quantum Fourier transformation and for the quantum adder. Finally, we describe computation with clusters of finite size.

arXiv:quant-ph/0301052•Physical Review A•Aug 25, 2003•1,650 citations

Highlights from the Asia Pacific Region

APPN Editorial Office

Quantum computing promises to deliver unprecedented effciency by exploiting the laws of quantum mechanics in order to process information in ways fundamentally different from today's classical computers. As recently as a decade ago Raussendorf and Briegel proposed the one-way quantum computer which differs dramatically from the standard model of quantum computation [1]. Whereas the standard model relies on sequences of quantum logic gates that process qubits, the one-way model implements computations as a sequence of measurements on an array of highly entangled states; the so-called cluster state. A cluster state is first created as a generic resource, and the algorithms to be computed are determined by the choice and sequence of measurements, allowing us to imprint a circuit in real time as the flow of information is directed through the cluster.

Asia Pacific Physics Newsletter•Sep 1, 2012•0 citations

MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES

Robert Raussendorf

In this thesis, we describe the one-way quantum computer [Formula: see text], a scheme of universal quantum computation that consists entirely of one-qubit measurements on a highly entangled multiparticle state, i.e. the cluster state. We prove the universality of the [Formula: see text], describe the underlying computational model and demonstrate that the [Formula: see text] can be operated fault-tolerantly. In Sec. 2, we show that the [Formula: see text] can be regarded as a simulator of quantum logic networks. In this way, we prove the universality and establish the link to the network model — the common model of quantum computation. We also indicate that the description of the [Formula: see text] as a network simulator is not adequate in every respect. In Sec. 3, we derive the computational model underlying the [Formula: see text], which is very different from the quantum logic network model. The [Formula: see text] has no quantum input, no quantum output and no quantum register, and the unitary gates from some universal set are not the elementary building blocks of [Formula: see text] quantum algorithms. Further, all information that is processed with the [Formula: see text] is the outcomes of one-qubit measurements and thus processing of information exists only at the classical level. The [Formula: see text] is nevertheless quantum-mechanical, as it uses a highly entangled cluster state as the central physical resource. In Sec. 4, we show that there exist nonzero error thresholds for fault-tolerant quantum computation with the [Formula: see text]. Further, we outline the concept of checksums in the context of the [Formula: see text], which may become an element in future practical and adequate methods for fault-tolerant [Formula: see text] computation.

International Journal of Quantum Information•Sep 1, 2009•42 citations

Computational Model for the One-Way Quantum Computer: Concepts and Summary

Robert Raussendorf, Hans J. Briegel

The one-way quantum computer (QCc) is a universal scheme of quantum computation consisting only of one-qubit measurements on a particular entangled multi-qubit state, the cluster state. The computational model underlying the QCc is different from the quantum logic network model and it is based on different constituents. It has no quantum register and does not consist of quantum gates. The QCc is nevertheless quantum mechanical since it uses a highly entangled cluster state as the central physical resource. The scheme works by measuring quantum correlations of the universal cluster state.

arXiv:quant-ph/0207183•Jul 31, 2002•0 citations

Quantum computing via measurements only

Robert Raussendorf, Hans J. Briegel

A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of these systems to a large number of qubits, essential for practical applications such as the Shor algorithm, represents a formidable challenge. Most of the current experiments are designed to implement sequences of highly controlled interactions between selected particles (qubits), thereby following models of a quantum computer as a (sequential) network of quantum logic gates. Here we propose a different model of a scalable quantum computer. In our model, the entire resource for the quantum computation is provided initially in form of a specific entangled state (a so-called cluster state) of a large number of qubits. Information is then written onto the cluster, processed, and read out form the cluster by one-particle measurements only. The entangled state of the cluster thus serves as a universal substrate for any quantum computation. Cluster states can be created efficiently in any system with a quantum Ising-type interaction (at very low temperatures) between two-state particles in a lattice configuration.

arXiv:quant-ph/0010033•Oct 7, 2000•57 citations

The one-way quantum computer--a non-network model of quantum computation

Robert Raussendorf, Dan E. Browne, Hans J. Briegel

A one-way quantum computer (QC C ) works by performing a sequence of one-qubit measurements on a particular entangled multi-qubit state, the cluster state. No non-local operations are required in the process of computation. Any quantum logic network can be simulated on the QC C . On the other hand, the network model of quantum computation cannot explain all ways of processing quantum information possible with the QC C . In this paper, two examples of the non-network character of the QC C are given. First, circuits in the Clifford group can be performed in a single time step. Second, the QC C -realization of a particular circuit—the bit-reversal gate—has no network interpretation.

arXiv:quant-ph/0108118•Journal of Modern Optics•Jul 1, 2002•84 citations
We present a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. The measurements are used to imprint a quantum logic circuit on the state, thereby destroying its entanglement at the same time. Cluster states are thus one-way quantum computers and the measurements form the program.
We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. We prove its universality, describe why its underlying computational model is different from the network model of quantum computation, and relate quantum algorithms to mathematical graphs. Further we investigate the scaling of required resources and give a number of examples for circuits of practical interest such as the circuit for quantum Fourier transformation and for the quantum adder. Finally, we describe computation with clusters of finite size.
Quantum computing promises to deliver unprecedented effciency by exploiting the laws of quantum mechanics in order to process information in ways fundamentally different from today's classical computers. As recently as a decade ago Raussendorf and Briegel proposed the one-way quantum computer which differs dramatically from the standard model of quantum computation [1]. Whereas the standard model relies on sequences of quantum logic gates that process qubits, the one-way model implements computations as a sequence of measurements on an array of highly entangled states; the so-called cluster state. A cluster state is first created as a generic resource, and the algorithms to be computed are determined by the choice and sequence of measurements, allowing us to imprint a circuit in real time as the flow of information is directed through the cluster.
In this thesis, we describe the one-way quantum computer [Formula: see text], a scheme of universal quantum computation that consists entirely of one-qubit measurements on a highly entangled multiparticle state, i.e. the cluster state. We prove the universality of the [Formula: see text], describe the underlying computational model and demonstrate that the [Formula: see text] can be operated fault-tolerantly. In Sec. 2, we show that the [Formula: see text] can be regarded as a simulator of quantum logic networks. In this way, we prove the universality and establish the link to the network model — the common model of quantum computation. We also indicate that the description of the [Formula: see text] as a network simulator is not adequate in every respect. In Sec. 3, we derive the computational model underlying the [Formula: see text], which is very different from the quantum logic network model. The [Formula: see text] has no quantum input, no quantum output and no quantum register, and the unitary gates from some universal set are not the elementary building blocks of [Formula: see text] quantum algorithms. Further, all information that is processed with the [Formula: see text] is the outcomes of one-qubit measurements and thus processing of information exists only at the classical level. The [Formula: see text] is nevertheless quantum-mechanical, as it uses a highly entangled cluster state as the central physical resource. In Sec. 4, we show that there exist nonzero error thresholds for fault-tolerant quantum computation with the [Formula: see text]. Further, we outline the concept of checksums in the context of the [Formula: see text], which may become an element in future practical and adequate methods for fault-tolerant [Formula: see text] computation.
The one-way quantum computer (QCc) is a universal scheme of quantum computation consisting only of one-qubit measurements on a particular entangled multi-qubit state, the cluster state. The computational model underlying the QCc is different from the quantum logic network model and it is based on different constituents. It has no quantum register and does not consist of quantum gates. The QCc is nevertheless quantum mechanical since it uses a highly entangled cluster state as the central physical resource. The scheme works by measuring quantum correlations of the universal cluster state.
A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of these systems to a large number of qubits, essential for practical applications such as the Shor algorithm, represents a formidable challenge. Most of the current experiments are designed to implement sequences of highly controlled interactions between selected particles (qubits), thereby following models of a quantum computer as a (sequential) network of quantum logic gates. Here we propose a different model of a scalable quantum computer. In our model, the entire resource for the quantum computation is provided initially in form of a specific entangled state (a so-called cluster state) of a large number of qubits. Information is then written onto the cluster, processed, and read out form the cluster by one-particle measurements only. The entangled state of the cluster thus serves as a universal substrate for any quantum computation. Cluster states can be created efficiently in any system with a quantum Ising-type interaction (at very low temperatures) between two-state particles in a lattice configuration.
A one-way quantum computer (QC C ) works by performing a sequence of one-qubit measurements on a particular entangled multi-qubit state, the cluster state. No non-local operations are required in the process of computation. Any quantum logic network can be simulated on the QC C . On the other hand, the network model of quantum computation cannot explain all ways of processing quantum information possible with the QC C . In this paper, two examples of the non-network character of the QC C are given. First, circuits in the Clifford group can be performed in a single time step. Second, the QC C -realization of a particular circuit—the bit-reversal gate—has no network interpretation.