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

APS

The one-way quantum computer

Robert Raussendorf

Published Mar 1, 2003• 3 citations
OpenAlex

Abstract

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

Related papers

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

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

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

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

Fault-tolerant quantum computing with three-dimensional surface codes

Michael Vasmer

Quantum computers are far more error-prone than their classical counterparts. Therefore, to build a quantum computer capable of running large-scale quantum algorithms, we must use the techniques of quantum error correction to ensure that the computer produces the correct output even when its components are unreliable. However, the resource requirements of building such a fault-tolerant quantum computer are currently prohibitive. Here, we examine the utility of using three-dimensional (3D) surface codes in a fault-tolerant quantum computer. This family of topological error-correcting codes is a generalization of the well-known 2D surface code to three spatial dimensions. We show that certain 3D surface codes have a transversal logical non-Clifford gate. In a quantum computing architecture, a non-Clifford gate is required to achieve computational universality. Transversal gates do not entangle qubits in different codes, so they are naturally fault tolerant because they do not spread errors. Next, we consider the problem of decoding 3D surface codes. In a quantum error-correcting code, we cannot observe the qubits directly, so we measure parity-check operators to gain information about the state of the code. Decoding is the problem of estimating what error has occurred given a list of unsatisfied parity checks. We observe that 3D surface codes offer asymmetric protection against bit-flip and phase-flip errors, but in both cases, we find that a threshold error rate exists below which we can suppress logical errors by increasing the size of the code. We use our results about logical gates and decoding to propose two fault-tolerant quantum computing architectures that utilize 3D surface codes. Finally, we compare the resource requirements of our architectures with the requirements of leading quantum computing architectures based on topological codes. We find that one of our architectures may be competitive with the leading architectures, depending on the properties of the physical systems used to build the qubits.

•Dec 28, 2019•2 citations
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
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 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 .
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.
Quantum computers are far more error-prone than their classical counterparts. Therefore, to build a quantum computer capable of running large-scale quantum algorithms, we must use the techniques of quantum error correction to ensure that the computer produces the correct output even when its components are unreliable. However, the resource requirements of building such a fault-tolerant quantum computer are currently prohibitive. Here, we examine the utility of using three-dimensional (3D) surface codes in a fault-tolerant quantum computer. This family of topological error-correcting codes is a generalization of the well-known 2D surface code to three spatial dimensions. We show that certain 3D surface codes have a transversal logical non-Clifford gate. In a quantum computing architecture, a non-Clifford gate is required to achieve computational universality. Transversal gates do not entangle qubits in different codes, so they are naturally fault tolerant because they do not spread errors. Next, we consider the problem of decoding 3D surface codes. In a quantum error-correcting code, we cannot observe the qubits directly, so we measure parity-check operators to gain information about the state of the code. Decoding is the problem of estimating what error has occurred given a list of unsatisfied parity checks. We observe that 3D surface codes offer asymmetric protection against bit-flip and phase-flip errors, but in both cases, we find that a threshold error rate exists below which we can suppress logical errors by increasing the size of the code. We use our results about logical gates and decoding to propose two fault-tolerant quantum computing architectures that utilize 3D surface codes. Finally, we compare the resource requirements of our architectures with the requirements of leading quantum computing architectures based on topological codes. We find that one of our architectures may be competitive with the leading architectures, depending on the properties of the physical systems used to build the qubits.