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/0512130 · Quantum Information and Computation

Cluster state quantum computation for many-level systems

W. Hall

Published Mar 1, 2007• 9 citations
arXivHTMLPDF

Abstract

The cluster state model for quantum computation [Phys. Rev. Lett. \textbf{86}, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum computations. The model itself and many works dedicated to it involve using entangled qubits. In this paper we consider the issue of using entangled qudits instead. We present a complete framework for cluster state quantum computation using qudits, which not only contains the features of the original qubit model but also contains the new idea of adaptive computation: via a change in the classical computation that helps to correct the errors that are inherent in the model, the implemented quantum computation can be changed. This feature arises through the extra degrees of freedom that appear when using qudits. Finally, for prime dimensions, we give a very explicit description of the model, making use of mutually unbiased bases.

DOI
10.26421/qic7.3-2

Related papers

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

Quantum computation based on qudit cluster state

Di Zhou, Bei Zeng, Zhongjie Xu +1 more

The concept of qudit (a d-level system)cluster state is proposed by generalizing the qubit cluster state (Phys. Rev. Lett. 86, 910 (2001)) according to the finite dimensional representations of quantum plane algebra. For the defined qudit cluster states we show the maintenance of the quantum correlations and the celebrated theorem, which guarantees the availability of the qudit cluster states in quantum information processing including quantum computation. The corresponding protocol of implementing one-way quantum computer can be suggested with the high dimensional "Ising" model.

•Apr 8, 2003•0 citations

Adiabatic cluster-state quantum computing

Dave Bacon, Steven T. Flammia

Models of quantum computation (QC) are important because they change the physical requirements for achieving universal QC. For example, one-way QC requires the preparation of an entangled ``cluster'' state, followed by adaptive measurement on this state, a set of requirements which is different from the standard quantum-circuit model. Here we introduce a model based on one-way QC but without measurements (except for the final readout), instead using adiabatic deformation of a Hamiltonian whose initial ground state is the cluster state. Our results could help increase the feasibility of adiabatic schemes by using tools from one-way QC.

arXiv:0912.2098•Physical Review A•Sep 27, 2010•27 citations

Fault-tolerant quantum computation with cluster states

Michael A. Nielsen, Christopher M. Dawson

The one-way quantum computing model introduced by Raussendorf and Briegel [Phys. Rev. Lett. 86, 5188 (2001)] shows that it is possible to quantum compute using only a fixed entangled resource known as a cluster state, and adaptive single-qubit measurements. This model is the basis for several practical proposals for quantum computation, including a promising proposal for optical quantum computation based on cluster states [M. A. Nielsen, Phys. Rev. Lett. (to be published), quant-ph/0402005]. A significant open question is whether such proposals are scalable in the presence of physically realistic noise. In this paper we prove two threshold theorems which show that scalable fault-tolerant quantum computation may be achieved in implementations based on cluster states, provided the noise in the implementations is below some constant threshold value. Our first threshold theorem applies to a class of implementations in which entangling gates are applied deterministically, but with a small amount of noise. We expect this threshold to be applicable in a wide variety of physical systems. Our second threshold theorem is specifically adapted to proposals such as the optical cluster-state proposal, in which nondeterministic entangling gates are used. A critical technical component of our proofs is two powerful theorems which relate the properties of noisy unitary operations restricted to act on a subspace of state space to extensions of those operations acting on the entire state space. We expect these theorems to have a variety of applications in other areas of quantum-information science.

arXiv:quant-ph/0405134•Physical Review A•Apr 14, 2005•161 citations

Implementation of Quantum Algorithms using Optical Cluster State

André Stefanov, Robert Prevedel, Pascal Böhi +5 more

Quantum computers promise to be more efficient and powerful than their classical counterparts. In the one-way quantum computer model [1], a sequence of measurements processes qubits, which are initially prepared in a highly entangled cluster state. We present here an optical implementation of a 4-qubit cluster state and we show how different algorithms can be experimentally realized by performing the corresponding sequence of measurements. The key advantage of this scheme over the standard network approach of quantum computing is that inherent, randomly induced measurement errors can classically be fed-forward and corrected by adapting the basis of subsequent measurement.

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 1, 2007•0 citations

An introduction to measurement based quantum computation

Richard Jozsa

In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designated qubits in designated bases. The choice of basis for later measurements may depend on earlier measurement outcomes and the final result of the computation is determined from the classical data of all the measurement outcomes. This is in contrast to the more familiar gate array model in which computational steps are unitary operations, developing a large entangled state prior to some final measurements for the output. Two principal schemes of measurement based computation are teleportation quantum computation (TQC) and the so-called cluster model or one-way quantum computer (1WQC). We will describe these schemes and show how they are able to perform universal quantum computation. We will outline various possible relationships between the models which serve to clarify their workings. We will also discuss possible novel computational benefits of the measurement based models compared to the gate array model, especially issues of parallelisability of algorithms.

arXiv:quant-ph/0508124•Aug 17, 2005•124 citations
The cluster state model for quantum computation [Phys. Rev. Lett. \textbf{86}, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum computations. The model itself and many works dedicated to it involve using entangled qubits. In this paper we consider the issue of using entangled qudits instead. We present a complete framework for cluster state quantum computation using qudits, which not only contains the features of the original qubit model but also contains the new idea of adaptive computation: via a change in the classical computation that helps to correct the errors that are inherent in the model, the implemented quantum computation can be changed. This feature arises through the extra degrees of freedom that appear when using qudits. Finally, for prime dimensions, we give a very explicit description of the model, making use of mutually unbiased bases.
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.
The concept of qudit (a d-level system)cluster state is proposed by generalizing the qubit cluster state (Phys. Rev. Lett. 86, 910 (2001)) according to the finite dimensional representations of quantum plane algebra. For the defined qudit cluster states we show the maintenance of the quantum correlations and the celebrated theorem, which guarantees the availability of the qudit cluster states in quantum information processing including quantum computation. The corresponding protocol of implementing one-way quantum computer can be suggested with the high dimensional "Ising" model.
Models of quantum computation (QC) are important because they change the physical requirements for achieving universal QC. For example, one-way QC requires the preparation of an entangled ``cluster'' state, followed by adaptive measurement on this state, a set of requirements which is different from the standard quantum-circuit model. Here we introduce a model based on one-way QC but without measurements (except for the final readout), instead using adiabatic deformation of a Hamiltonian whose initial ground state is the cluster state. Our results could help increase the feasibility of adiabatic schemes by using tools from one-way QC.
The one-way quantum computing model introduced by Raussendorf and Briegel [Phys. Rev. Lett. 86, 5188 (2001)] shows that it is possible to quantum compute using only a fixed entangled resource known as a cluster state, and adaptive single-qubit measurements. This model is the basis for several practical proposals for quantum computation, including a promising proposal for optical quantum computation based on cluster states [M. A. Nielsen, Phys. Rev. Lett. (to be published), quant-ph/0402005]. A significant open question is whether such proposals are scalable in the presence of physically realistic noise. In this paper we prove two threshold theorems which show that scalable fault-tolerant quantum computation may be achieved in implementations based on cluster states, provided the noise in the implementations is below some constant threshold value. Our first threshold theorem applies to a class of implementations in which entangling gates are applied deterministically, but with a small amount of noise. We expect this threshold to be applicable in a wide variety of physical systems. Our second threshold theorem is specifically adapted to proposals such as the optical cluster-state proposal, in which nondeterministic entangling gates are used. A critical technical component of our proofs is two powerful theorems which relate the properties of noisy unitary operations restricted to act on a subspace of state space to extensions of those operations acting on the entire state space. We expect these theorems to have a variety of applications in other areas of quantum-information science.
Quantum computers promise to be more efficient and powerful than their classical counterparts. In the one-way quantum computer model [1], a sequence of measurements processes qubits, which are initially prepared in a highly entangled cluster state. We present here an optical implementation of a 4-qubit cluster state and we show how different algorithms can be experimentally realized by performing the corresponding sequence of measurements. The key advantage of this scheme over the standard network approach of quantum computing is that inherent, randomly induced measurement errors can classically be fed-forward and corrected by adapting the basis of subsequent measurement.
In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designated qubits in designated bases. The choice of basis for later measurements may depend on earlier measurement outcomes and the final result of the computation is determined from the classical data of all the measurement outcomes. This is in contrast to the more familiar gate array model in which computational steps are unitary operations, developing a large entangled state prior to some final measurements for the output. Two principal schemes of measurement based computation are teleportation quantum computation (TQC) and the so-called cluster model or one-way quantum computer (1WQC). We will describe these schemes and show how they are able to perform universal quantum computation. We will outline various possible relationships between the models which serve to clarify their workings. We will also discuss possible novel computational benefits of the measurement based models compared to the gate array model, especially issues of parallelisability of algorithms.