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

Quantum computation based on qudit cluster state

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

Published Apr 8, 2003• 0 citations
OpenAlex

Abstract

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.

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

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

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

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

Subdimensional linear-optical quantum computation: from qudit resource states to qubit quantum computation

Tomohiro Yamazaki

In this paper, we propose a linear-optical quantum computation scheme that starts from high-dimensionally entangled qudits but performs quantum computation on qubits defined in their subspaces. This approach enables us to increase the success probability of linear-optical fusions from $50\%$ to $1-1/d$ for qudits of dimension $d$ without relying on existing approaches using ancilla photons and quantum codes. In particular, we show that a 2D cluster state of qubits can be generated from 5-qudit 1D cluster states using pairwise fusion gates while preserving their boosted success probability. We numerically demonstrate that this approach can improve the loss tolerance of a percolation-based scheme while keeping the photon number per resource state constant.

quant-pharXiv:2610.03408•Oct 5, 2026•0 citations
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 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 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.
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.
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.
In this paper, we propose a linear-optical quantum computation scheme that starts from high-dimensionally entangled qudits but performs quantum computation on qubits defined in their subspaces. This approach enables us to increase the success probability of linear-optical fusions from 50%50\%50% to 1−1/d1-1/d1−1/d for qudits of dimension ddd without relying on existing approaches using ancilla photons and quantum codes. In particular, we show that a 2D cluster state of qubits can be generated from 5-qudit 1D cluster states using pairwise fusion gates while preserving their boosted success probability. We numerically demonstrate that this approach can improve the loss tolerance of a percolation-based scheme while keeping the photon number per resource state constant.