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

Quantum-dot cluster-state computing with encoded qubits

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

Published Aug 30, 2005• 58 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.72.020304

Related papers

Cluster-based architecture for fault-tolerant quantum computation

Keisuke Fujii, Katsuji Yamamoto

We present a detailed description of an architecture for fault-tolerant quantum computation, which is based on the cluster model of encoded qubits. In this cluster-based architecture, concatenated computation is implemented in a quite different way from the usual circuit-based architecture where physical gates are recursively replaced by logical gates with error-correction gadgets. Instead, some relevant cluster states, say fundamental clusters, are recursively constructed through verification and postselection in advance for the higher-level one-way computation, which namely provides error-precorrection of gate operations. A suitable code such as the Steane seven-qubit code is adopted for transversal operations. This concatenated construction of verified fundamental clusters has a simple transversal structure of logical errors, and achieves a high noise threshold $~3%$ for computation by using appropriate verification procedures. Since the postselection is localized within each fundamental cluster with the help of deterministic bare controlled-$Z$ gates without verification, divergence of resources is restrained, which reconciles postselection with scalability.

arXiv:0912.5150•Physical Review A•Apr 27, 2010•18 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•21 citations

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

Da-Sheng Diao, Yong-Sheng Zhang, Xiang-Fa Zhou +1 more

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)].

Physical Review A•Apr 7, 2008•1 citation

One-step preparation of cluster states in quantum-dot molecules

Guo‐Ping Guo, Hui Zhang, Tao Tu +1 more

Cluster states, a special type of highly entangled states, are a universal resource for measurement-based quantum computation. Here, we propose an efficient one-step generation scheme for cluster states in semiconductor quantum dot molecules, where qubits are encoded on singlet and triplet states of two coupled quantum dots. By applying a collective electrical field or simultaneously adjusting interdot bias voltages of all double-dot molecules, we get a switchable Ising-like interaction between any two adjacent quantum molecule qubits. The initialization, the single-qubit measurement, and the experimental parameters are discussed. It is shown that preparation of large cluster states and one-way quantum computation are implementable in semiconductor quantum dots with the present techniques.

arXiv:quant-ph/0611247•Physical Review A•May 3, 2007•47 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
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.
We present a detailed description of an architecture for fault-tolerant quantum computation, which is based on the cluster model of encoded qubits. In this cluster-based architecture, concatenated computation is implemented in a quite different way from the usual circuit-based architecture where physical gates are recursively replaced by logical gates with error-correction gadgets. Instead, some relevant cluster states, say fundamental clusters, are recursively constructed through verification and postselection in advance for the higher-level one-way computation, which namely provides error-precorrection of gate operations. A suitable code such as the Steane seven-qubit code is adopted for transversal operations. This concatenated construction of verified fundamental clusters has a simple transversal structure of logical errors, and achieves a high noise threshold  3~3% 3 for computation by using appropriate verification procedures. Since the postselection is localized within each fundamental cluster with the help of deterministic bare controlled-ZZZ gates without verification, divergence of resources is restrained, which reconciles postselection with scalability.
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 special type of highly entangled states, are a universal resource for measurement-based quantum computation. Here, we propose an efficient one-step generation scheme for cluster states in semiconductor quantum dot molecules, where qubits are encoded on singlet and triplet states of two coupled quantum dots. By applying a collective electrical field or simultaneously adjusting interdot bias voltages of all double-dot molecules, we get a switchable Ising-like interaction between any two adjacent quantum molecule qubits. The initialization, the single-qubit measurement, and the experimental parameters are discussed. It is shown that preparation of large cluster states and one-way quantum computation are implementable in semiconductor quantum dots with the present techniques.
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.