Related papers: Fault-Tolerant Quantum Computation with Higher-Dim…
In this paper we provide a basic introduction of the core ideas and theories surrounding fault-tolerant quantum computation. These concepts underly the theoretical framework of large-scale quantum computation and communications and are the…
We propose a measurement-based model for fault-tolerant quantum computation that can be realised with one-dimensional cluster states and fusion measurements only; basic resources that are readily available with scalable photonic hardware.…
Topological stabilizer codes with different spatial dimensions have complementary properties. Here I show that the spatial dimension can be switched using gauge fixing. Combining 2D and 3D gauge color codes in a 3D qubit lattice,…
Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codes exploit the noncommutative geometry of…
We introduce a class of 3D color codes, which we call stacked codes, together with a fault-tolerant transformation that will map logical qubits encoded in two-dimensional (2D) color codes into stacked codes and back. The stacked code allows…
Universal quantum computation on decoherence-free subspaces and subsystems (DFSs) is examined with particular emphasis on using only physically relevant interactions. A necessary and sufficient condition for the existence of…
The standard approach to universal fault-tolerant quantum computing is to develop a general purpose quantum error correction mechanism that can implement a universal set of logical gates fault-tolerantly. Given such a scheme, any quantum…
In order to build a scalable quantum computer error correction will be required to reduce the impact of errors. Implementing error correction in the framework of measurement based computation manifests itself as the construction of fault…
In this short review, I draw attention to new developments in the theory of fault tolerance in quantum computation that may give concrete direction to future work in the development of superconducting qubit systems. The basics of quantum…
Quantum computation holds the promise of solving certain complex problems exponentially faster than classical computers. However, the high prevalent noise in current quantum devices impedes the accurate execution of even basic algorithms.…
Quantum computing holds the promise of solving classically intractable problems. Enabling this requires scalable and hardware-efficient quantum processors with vanishing error rates. This perspective manuscript describes how bosonic codes,…
In certain approaches to quantum computing the operations between qubits are non-deterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components;…
I give a brief overview of fault-tolerant quantum computation, with an emphasis on recent work and open questions.
We propose a method for universal fault-tolerant quantum computation using concatenated quantum error correcting codes. Namely, other than computational basis state preparation as required by the DiVincenzo criteria [1], our scheme requires…
Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. Here, we explore the potential and limitations of such schemes in codes of all spatial dimensions. We…
Reliable execution of large-scale quantum algorithms requires robust underlying operations and this challenge is addressed by quantum error correction (QEC). Most modern QEC protocols rely on measurements and feed-forward operations, which…
Protection of quantum information from noise is a massive challenge. One avenue people have begun to explore is reducing the number of particles needing to be protected from noise and instead use systems with more states, so called qudit…
Fault-tolerant operations based on stabilizer codes are the state of the art in suppressing error rates in quantum computations. Most such codes do not permit a straightforward implementation of non-Clifford logical operations, which are…
High-rate and large-distance quantum codes are expected to make fault-tolerant quantum computing more efficient, but most of them lack efficient fault-tolerant encoded-state preparation methods. We propose such a fault-tolerant encoder for…
The discovery of quantum error correction has greatly improved the long-term prospects for quantum computing technology. Encoded quantum information can be protected from errors that arise due to uncontrolled interactions with the…