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 Information and Computation

Topological cluster state quantum computing

Austin G. Fowler, Kovid Goyal

Published Sep 1, 2009• 36 citations
Publisher

Abstract

The quantum computing scheme described by Raussendorf et. al (2007), when viewed as a cluster state computation, features a 3-D cluster state, novel adjustable strength error correction capable of correcting general errors through the correction of Z errors only, a threshold error rate approaching 1% and low overhead arbitrarily long-range logical gates. In this work, we review the scheme in detail framing the discussion solely in terms of the required 3-D cluster state and its stabilizers.

DOI
10.5555/2011804.2011805

Related papers

Topological cluster state quantum computing

Austin G. Fowler, Kovid Goyal

The quantum computing scheme described by Raussendorf et. al (2007), when viewed as a cluster state computation, features a 3-D cluster state, novel adjustable strength error correction capable of correcting general errors through the correction of Z errors only, a threshold error rate approaching 1% and low overhead arbitrarily long-range logical gates. In this work, we review the scheme in detail framing the discussion solely in terms of the required 3-D cluster state and its stabilizers.

Quantum Information and Computation•Sep 1, 2009•31 citations

Topological cluster state quantum computing

Austin G. Fowler, Kovid Goyal

The quantum computing scheme described in Phys. Rev. Lett. 98, 190504 (2007), when viewed as a cluster state computation, features a 3-D cluster state, novel adjustable strength error correction capable of correcting general errors through the correction of Z errors only, a threshold error rate approaching 1% and low overhead arbitrarily long-range logical gates. In this work, we review the scheme in detail framing discussion solely in terms of the required 3-D cluster state and its stabilizers.

arXiv:0805.3202•May 21, 2008•0 citations

Fault-tolerant topological cluster state quantum computing

Austin G. Fowler, Kovid Goyal

Introduction Cluster states were introduced in Chapter 18, along with some of the approaches to achieving fault tolerance in measurement-based quantum computing. In this chapter, we describe an extremely promising fault-tolerant cluster state quantum computing scheme [RH07, RHG07] with a threshold error rate of 7.46 × 10 −3 , low overhead arbitrarily long-range logical gates and novel adjustable strength error correction capable of correcting general errors through the correction of Z errors only. Detailed proposed implementations of this scheme exist for ion traps [SJ09] and single photons with cavity mediated interactions [DGI+07]. The discussion is organized as follows. In Section 20.2, we describe the topological cluster state, which is a specific three-dimensional (3D) cluster state, and give a brief overview of what topological cluster state quantum computing involves. Section 20.3 describes logical qubits in more detail and how to initialize them to ∣0 L 〉 and ∣+ L 〉 and measure them in the Z L and X L bases. State injection, the non-fault-tolerant construction of arbitrary logical states, is covered in Section 20.4. Logical gates, namely the logical identity gate and the logical CNOT gate, are discussed in Section 20.5 along with their byproduct operators. Section 20.6 describes the errorcorrection procedure. In Section 20.7, we calculate an estimate for the threshold of this scheme. Section 20.8 presents an analysis of the overhead as a function of both the circuit size and the error rate.

Cambridge University Press eBooks•Sep 5, 2013•1 citation

The one-way quantum computer

Robert Raussendorf

We describe a fault-tolerant one-way quantum computer on cluster states in three dimensions. The presented scheme uses methods of topological error correction resulting from a link between cluster states and surface codes. The error threshold is 1.4 % for local depolarizing error and 0.11 % for each source in an error model with preparation-, gate-, storage- and measurement errors. 1

APS•Mar 1, 2003•3 citations

Topological error correction with a Gaussian cluster state

Shuhong Hao, Meihong Wang, Dong Wang +1 more

Topological error correction provides an effective method to correct errors in quantum computation. It allows quantum computation to be implemented with a higher error threshold and high tolerating loss rates. We present a topological error correction scheme with continuous variables based on an eight-partite Gaussian cluster state. We show that topological quantum correlation between two modes can be protected against a single quadrature phase displacement error occurring on any mode and some of two errors occurring on two modes. More interestingly, some cases of errors occurring on three modes can also be recognized and corrected, which is different from the topological error correction with discrete variables. We show that the final error rate after correction can be further reduced if the modes are subjected to identical errors occurring on all modes with equal probability. The presented results provide a feasible scheme for topological error correction with continuous variables and it can be experimentally demonstrated with a Gaussian cluster state.

arXiv:2105.06012•Physical Review A•May 10, 2021•5 citations

Topological fault-tolerance in cluster state quantum computation

Robert Raussendorf, J Harrington, Kumar Goyal

We describe a fault-tolerant version of the one-way quantum computer using a cluster state in three spatial dimensions. Topologically protected quantum gates are realized by choosing appropriate boundary conditions on the cluster. We provide equivalence transformations for these boundary conditions that can be used to simplify fault-tolerant circuits and to derive circuit identities in a topological manner. The spatial dimensionality of the scheme can be reduced to two by converting one spatial axis of the cluster into time. The error threshold is 0.75% for each source in an error model with preparation, gate, storage and measurement errors. The operational overhead is poly-logarithmic in the circuit size.

arXiv:quant-ph/0703143•New Journal of Physics•Jun 29, 2007•613 citations
The quantum computing scheme described by Raussendorf et. al (2007), when viewed as a cluster state computation, features a 3-D cluster state, novel adjustable strength error correction capable of correcting general errors through the correction of Z errors only, a threshold error rate approaching 1% and low overhead arbitrarily long-range logical gates. In this work, we review the scheme in detail framing the discussion solely in terms of the required 3-D cluster state and its stabilizers.
Introduction Cluster states were introduced in Chapter 18, along with some of the approaches to achieving fault tolerance in measurement-based quantum computing. In this chapter, we describe an extremely promising fault-tolerant cluster state quantum computing scheme [RH07, RHG07] with a threshold error rate of 7.46 × 10 −3 , low overhead arbitrarily long-range logical gates and novel adjustable strength error correction capable of correcting general errors through the correction of Z errors only. Detailed proposed implementations of this scheme exist for ion traps [SJ09] and single photons with cavity mediated interactions [DGI+07]. The discussion is organized as follows. In Section 20.2, we describe the topological cluster state, which is a specific three-dimensional (3D) cluster state, and give a brief overview of what topological cluster state quantum computing involves. Section 20.3 describes logical qubits in more detail and how to initialize them to ∣0 L 〉 and ∣+ L 〉 and measure them in the Z L and X L bases. State injection, the non-fault-tolerant construction of arbitrary logical states, is covered in Section 20.4. Logical gates, namely the logical identity gate and the logical CNOT gate, are discussed in Section 20.5 along with their byproduct operators. Section 20.6 describes the errorcorrection procedure. In Section 20.7, we calculate an estimate for the threshold of this scheme. Section 20.8 presents an analysis of the overhead as a function of both the circuit size and the error rate.
Topological error correction provides an effective method to correct errors in quantum computation. It allows quantum computation to be implemented with a higher error threshold and high tolerating loss rates. We present a topological error correction scheme with continuous variables based on an eight-partite Gaussian cluster state. We show that topological quantum correlation between two modes can be protected against a single quadrature phase displacement error occurring on any mode and some of two errors occurring on two modes. More interestingly, some cases of errors occurring on three modes can also be recognized and corrected, which is different from the topological error correction with discrete variables. We show that the final error rate after correction can be further reduced if the modes are subjected to identical errors occurring on all modes with equal probability. The presented results provide a feasible scheme for topological error correction with continuous variables and it can be experimentally demonstrated with a Gaussian cluster state.
We describe a fault-tolerant version of the one-way quantum computer using a cluster state in three spatial dimensions. Topologically protected quantum gates are realized by choosing appropriate boundary conditions on the cluster. We provide equivalence transformations for these boundary conditions that can be used to simplify fault-tolerant circuits and to derive circuit identities in a topological manner. The spatial dimensionality of the scheme can be reduced to two by converting one spatial axis of the cluster into time. The error threshold is 0.75% for each source in an error model with preparation, gate, storage and measurement errors. The operational overhead is poly-logarithmic in the circuit size.