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 A

Efficient measurement-based quantum computation with cluster states in quantum-bit fixed systems

Da-Sheng Diao, Yong-Sheng Zhang, Xiang-Fa Zhou, Guang‐Can Guo

Published Apr 7, 2008• 1 citation
Publisher

Abstract

We present an efficient quantum computation protocol on a special class of systems in which the positions of all quantum bits are fixed. This protocol is a generalized scheme based on L.-M. Duan and R. Raussendorf [Phys. Rev. Lett. 95, 080503 (2005)].
DOI
10.1103/physreva.77.044301

Related papers

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•21 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

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•170 citations

Unified derivations of measurement-based schemes for quantum computation

Andrew M. Childs, Debbie Leung, Michael A. Nielsen

We present unified, systematic derivations of schemes in the two known measurement-based models of quantum computation. The first model (introduced by Raussendorf and Briegel, [Phys. Rev. Lett. 86, 5188 (2001)]) uses a fixed entangled state, adaptive measurements on single qubits, and feedforward of the measurement results. The second model (proposed by Nielsen, [Phys. Lett. A 308, 96 (2003)] and further simplified by Leung, [Int. J. Quant. Inf. 2, 33 (2004)]) uses adaptive two-qubit measurements that can be applied to arbitrary pairs of qubits, and feedforward of the measurement results. The underlying principle of our derivations is a variant of teleportation introduced by Zhou, Leung, and Chuang, [Phys. Rev. A 62, 052316 (2000)]. Our derivations unify these two measurement-based models of quantum computation and provide significantly simpler schemes.

arXiv:quant-ph/0404132•Physical Review A•Mar 17, 2005•142 citations

Quantum-dot cluster-state computing with encoded qubits

Yaakov S. Weinstein, C. Stephen Hellberg, Jeremy Levy

A class of architectures is advanced for cluster-state quantum computation using quantum dots. These architectures include using single and multiple dots as logical qubits. Special attention is given to supercoherent qubits introduced by Bacon et al. [Phys. Rev. Lett. 87, 247902 (2001)] for which we discuss the effects of various errors and present a means of error protection.

arXiv:quant-ph/0506032•Physical Review A•Aug 30, 2005•58 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•176 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 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 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.
We present unified, systematic derivations of schemes in the two known measurement-based models of quantum computation. The first model (introduced by Raussendorf and Briegel, [Phys. Rev. Lett. 86, 5188 (2001)]) uses a fixed entangled state, adaptive measurements on single qubits, and feedforward of the measurement results. The second model (proposed by Nielsen, [Phys. Lett. A 308, 96 (2003)] and further simplified by Leung, [Int. J. Quant. Inf. 2, 33 (2004)]) uses adaptive two-qubit measurements that can be applied to arbitrary pairs of qubits, and feedforward of the measurement results. The underlying principle of our derivations is a variant of teleportation introduced by Zhou, Leung, and Chuang, [Phys. Rev. A 62, 052316 (2000)]. Our derivations unify these two measurement-based models of quantum computation and provide significantly simpler schemes.
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.