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/0304054 · Physical Review A

Quantum computation based ond-level cluster state

Di Zhou, Bei Zeng, Zhongjie Xu, C. P. Sun

Published Dec 2, 2003• 166 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.68.062303

Related papers

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

Cluster state quantum computation for many-level systems

W. Hall

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.

arXiv:quant-ph/0512130•Quantum Information and Computation•Mar 1, 2007•9 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

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

Optical d-Level Frequency-Time-Based Cluster States

Michael Kues, Raman Kashyap, Alfonso Carmelo Cino +15 more

Cluster states, a specific class of multi-partite entangled states, are of particular importance for quantum science, as such systems are equivalent to the realization of one-way (or measurement-based) quantum computers [1]. In this scheme, algorithms are implemented through high-fidelity measurements on the parties of the state [2]. While two-level (i.e. qubit) cluster states have been realized so far, increasing the number of particles to boost the computational resource comes at the price of significantly reduced coherence time and detection rates, as well as increased sensitivity to noise, restricting the realization of discrete cluster states to a record of eight qubits. In contrast, the demonstration of d-level (i.e. qudit) cluster states has the potential to i) increase quantum resources without modifying the number of particles; ii) enable the implementation of highly efficient computational protocols; iii) reduce the noise sensitivity of the states. Up till now, the realization of discrete d-level cluster states has not been shown in any quantum platform. We here demonstrate the realization of d-level cluster states, perform d-level one-way quantum processing operations on the states, and show that higher-dimensional forms of cluster states are more noise tolerant than lower dimensional realizations.

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

Quantum teleportation using cluster states

Bei Zeng, Di Zhou, Zhuoqun Xu +1 more

A protocol of quantum communication is proposed in terms of the multi-qubit quantum teleportation through cluster states (Phys. Rev. Lett. \textbf{86}, 910 (2001)). Extending the cluster state based quantum teleportation on the basic unit of three qubits (or qudits), the corresponding multi-qubit network is constructed for both the qubits and qudits (multi-level) cases. The classical information costs to complete this communication task is also analyzed. It is also shown that this quantum communication protocol can be implemented in the spin-spin system on lattices.

arXiv:quant-ph/0304165•Apr 25, 2003•5 citations
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.
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 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.
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.
Cluster states, a specific class of multi-partite entangled states, are of particular importance for quantum science, as such systems are equivalent to the realization of one-way (or measurement-based) quantum computers [1]. In this scheme, algorithms are implemented through high-fidelity measurements on the parties of the state [2]. While two-level (i.e. qubit) cluster states have been realized so far, increasing the number of particles to boost the computational resource comes at the price of significantly reduced coherence time and detection rates, as well as increased sensitivity to noise, restricting the realization of discrete cluster states to a record of eight qubits. In contrast, the demonstration of d-level (i.e. qudit) cluster states has the potential to i) increase quantum resources without modifying the number of particles; ii) enable the implementation of highly efficient computational protocols; iii) reduce the noise sensitivity of the states. Up till now, the realization of discrete d-level cluster states has not been shown in any quantum platform. We here demonstrate the realization of d-level cluster states, perform d-level one-way quantum processing operations on the states, and show that higher-dimensional forms of cluster states are more noise tolerant than lower dimensional realizations.
A protocol of quantum communication is proposed in terms of the multi-qubit quantum teleportation through cluster states (Phys. Rev. Lett. \textbf{86}, 910 (2001)). Extending the cluster state based quantum teleportation on the basic unit of three qubits (or qudits), the corresponding multi-qubit network is constructed for both the qubits and qudits (multi-level) cases. The classical information costs to complete this communication task is also analyzed. It is also shown that this quantum communication protocol can be implemented in the spin-spin system on lattices.