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:quant-ph/0207183

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

Robert Raussendorf, Hans J. Briegel

Published Jul 31, 2002• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.quant-ph/0207183

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

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

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

A One-Way Quantum Computer

Robert Raussendorf, Hans J. Briegel

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.

Physical Review Letters•May 28, 2001•4,478 citations

Quantum computation based ond-level cluster state

Di Zhou, Bei Zeng, Zhongjie Xu +1 more

The concept of a qudit (a d-level system) cluster state is proposed by generalizing the qubit cluster state [Phys. Rev. Lett. 86, 910 (2001)] to higher-dimensional Hilbert space according to the finite-dimensional representations of quantum plane algebra. We demonstrate their quantum correlations and prove a theorem which guarantees the availability of the qudit cluster states in quantum computation. We explicitly construct the network to show the universality of the one-way computer based on the defined qudit cluster states and single-qudit measurement. A protocol of implementing one-way quantum computer is suggested using the high-dimensional ``Ising'' model which can be found in many magnetic systems.

arXiv:quant-ph/0304054•Physical Review A•Dec 2, 2003•166 citations

One-Way Quantum Computation with Cluster State and Probabilistic Gate

Da-Sheng Diao

We present a scheme for efficiently constructing a two-dimensional cluster state, which serves as the central physical resource for one-way quantum computation. In this scheme, we successfully make the required computational overhead scale efficiently with the qubit number by using a probabilistic entangling quantum gate.

Chinese Physics Letters•Jan 1, 2013•2 citations
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.
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.
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.
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.
The concept of a qudit (a d-level system) cluster state is proposed by generalizing the qubit cluster state [Phys. Rev. Lett. 86, 910 (2001)] to higher-dimensional Hilbert space according to the finite-dimensional representations of quantum plane algebra. We demonstrate their quantum correlations and prove a theorem which guarantees the availability of the qudit cluster states in quantum computation. We explicitly construct the network to show the universality of the one-way computer based on the defined qudit cluster states and single-qudit measurement. A protocol of implementing one-way quantum computer is suggested using the high-dimensional ``Ising'' model which can be found in many magnetic systems.