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/0703143 · New Journal of Physics

Topological fault-tolerance in cluster state quantum computation

Robert Raussendorf, J Harrington, Kumar Goyal

Published Jun 29, 2007• 613 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/1367-2630/9/6/199

Related papers

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

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

Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions

Robert Raussendorf, Jim Harrington

We present a scheme of fault-tolerant quantum computation for a local architecture in two spatial dimensions. The error threshold is 0.75% for each source in an error model with preparation, gate, storage, and measurement errors.

arXiv:quant-ph/0610082•Physical Review Letters•May 11, 2007•812 citations

Topological one-way quantum computation on verified logical cluster states

Keisuke Fujii, Katsuji Yamamoto

We present a scheme to improve the noise threshold for fault-tolerant topological one-way computation with constant overhead. Certain cluster states of finite size, say star clusters, are constructed with logical qubits through an efficient verification process to achieve high fidelity. Then, the star clusters are connected near-deterministically with verification to form a three-dimensional cluster state to implement topological one-way computation. The necessary postselection for verification is localized within the star clusters, ensuring the scalability of computation. By using the Steane seven-qubit code for the logical qubits, this scheme works with a high error rate of $2%$ and reasonable resources comparable to or less than those for the other fault-tolerant schemes. A higher noise threshold would be achieved by adopting a larger code.

arXiv:1008.2048•Physical Review A•Dec 20, 2010•21 citations

A Compact One-Way Fault-Tolerant Optical Quantum Computation

Peilin Du, Jing Zhang, Rongguo Yang

One-way quantum computation is a promising approach to achieving universal, scalable, and fault-tolerant quantum computation. However, a main challenge lies in the creation of universal, scalable three-dimensional cluster states. Here, an experimental scheme is proposed for building large-scale canonical three-dimensional cubic cluster states, which are compatible with the majority of qubit error-correcting codes, using the spatiospectral modes of an optical parametric oscillator. Combining with Gottesman-Kitaev-Preskill states, one-way fault-tolerant optical quantum computation can be achieved with a lower fault-tolerant squeezing threshold. Our scheme drastically simplify experimental configurations, paving the way for compact realizations of one-way fault-tolerant optical quantum computation.

arXiv:2502.12429•Feb 18, 2025•0 citations

Concatenation Schemes for Topological Fault-tolerant Quantum Error Correction

Zhaoyi Li, Isaac H. Kim, Patrick M. Hayden

We investigate a family of fault-tolerant quantum error correction schemes based on the concatenation of small error detection or error correction codes with the three-dimensional cluster state. We propose fault-tolerant state preparation and decoding schemes that effectively convert every circuit-level error into an erasure error, leveraging the cluster state's high threshold against such errors. We find a set of codes for which such a conversion is possible, and study their performance against the standard circuit-level depolarizing model. Our best performing scheme, which is based on a concatenation with a classical code, improves the threshold by 16.5% and decreases the spacetime overhead by 32% compared to the scheme without concatenation, with each scheme subject to a physical error rate of 10−3 and achieving a logical error rate of 10−6 .

arXiv:2209.09390•Quantum•Aug 22, 2023•7 citations
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.
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.
We present a scheme to improve the noise threshold for fault-tolerant topological one-way computation with constant overhead. Certain cluster states of finite size, say star clusters, are constructed with logical qubits through an efficient verification process to achieve high fidelity. Then, the star clusters are connected near-deterministically with verification to form a three-dimensional cluster state to implement topological one-way computation. The necessary postselection for verification is localized within the star clusters, ensuring the scalability of computation. By using the Steane seven-qubit code for the logical qubits, this scheme works with a high error rate of 22%2 and reasonable resources comparable to or less than those for the other fault-tolerant schemes. A higher noise threshold would be achieved by adopting a larger code.
One-way quantum computation is a promising approach to achieving universal, scalable, and fault-tolerant quantum computation. However, a main challenge lies in the creation of universal, scalable three-dimensional cluster states. Here, an experimental scheme is proposed for building large-scale canonical three-dimensional cubic cluster states, which are compatible with the majority of qubit error-correcting codes, using the spatiospectral modes of an optical parametric oscillator. Combining with Gottesman-Kitaev-Preskill states, one-way fault-tolerant optical quantum computation can be achieved with a lower fault-tolerant squeezing threshold. Our scheme drastically simplify experimental configurations, paving the way for compact realizations of one-way fault-tolerant optical quantum computation.
We investigate a family of fault-tolerant quantum error correction schemes based on the concatenation of small error detection or error correction codes with the three-dimensional cluster state. We propose fault-tolerant state preparation and decoding schemes that effectively convert every circuit-level error into an erasure error, leveraging the cluster state's high threshold against such errors. We find a set of codes for which such a conversion is possible, and study their performance against the standard circuit-level depolarizing model. Our best performing scheme, which is based on a concatenation with a classical code, improves the threshold by 16.5% and decreases the spacetime overhead by 32% compared to the scheme without concatenation, with each scheme subject to a physical error rate of 10−3 and achieving a logical error rate of 10−6 .