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

A Critical Review of the Existing Ideas for Fault-tolerant Quantum Computing.

M. I. Dyakonov

Published Aug 9, 2006• 0 citations
OpenAlex

Abstract

A critical review of the existing ideas for fault-tolerant quantum computing is presented. It is shown that the underlying mathematics is somewhat detached from the physical reality and that some ideal elements are always present in the proposed constructions.

Related papers

An introduction to Fault-tolerant Quantum Computing

Alexandru Paler, Simon J. Devitt

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 driving force for many recent experimental efforts to construct small to medium sized arrays of controllable quantum bits. We examine the basic principals of redundant quantum encoding, required to protect quantum bits from errors generated from both imprecise control and environmental interactions and then examine the principals of fault-tolerance from largely a classical framework. As quantum fault-tolerance essentially is avoiding the uncontrollable cascade of errors caused by the interaction of quantum-bits, these concepts can be directly mapped to quantum information.

arXiv:1508.03695•Aug 15, 2015•9 citations

Is Fault-Tolerant Quantum Computation Really Possible?

M. I. Dyakonov

The so-called "threshold" theorem says that, once the error rate per qubit per gate is below a certain value, indefinitely long quantum computation becomes feasible, even if all of the qubits involved are subject to relaxation processes, and all the manipulations with qubits are not exact. The purpose of this article, intended for physicists, is to outline the ideas of quantum error correction and to take a look at the proposed technical instruction for fault-tolerant quantum computation. It seems that the mathematics behind the threshold theorem is somewhat detached from the physical reality, and that some ideal elements are always present in the construction. This raises serious doubts about the possibility of large scale quantum computations, even as a matter of principle.

arXiv:quant-ph/0610117•Oct 14, 2006•29 citations

Key ideas in quantum error correction

Robert Raussendorf

In this introductory article on the subject of quantum error correction and fault-tolerant quantum computation, we review three important ingredients that enter known constructions for fault-tolerant quantum computation, namely quantum codes, error discretization and transversal quantum gates. Taken together, they provide a ground on which the theory of quantum error correction can be developed and fault-tolerant quantum information protocols can be built.

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Aug 20, 2012•57 citations

An introduction into fault-tolerant quantum computing

Alexandru Paler, Simon J. Devitt

We provide a basic introduction of the core ideas and theory surrounding fault-tolerant quantum computation. Quantum fault-tolerance essentially refers to avoiding the uncontrollable cascade of errors caused by the interaction of quantum-bits. The presented concepts underlay the theoretical framework of large-scale quantum computation and are the driving force for many recent experimental efforts to construct small to medium sized arrays of controllable quantum bits. We examine the basic principles of redundant quantum encoding, required to protect quantum bits from errors generated from both imprecise control and environmental interactions. The novelty of this work consists in the presentation of fault-tolerance principles from a classical distributed computing perspective, as this enables a more straightforward introduction without sacrificing generality. The practicality of fault-tolerant quantum computing is analysed after introducing a metric of scalability and discussing the factors influencing it.

ACM/IEEE Design Automation Conference (DAC)•Jun 2, 2015•16 citations

Approaches to Quantum Error Correction

Julia Kempe

In a ground breaking discovery in 1994, Shor has shown that quantum computers, if built, can factor numbers efficiently. Since then quantum computing has become a burgeoning field of research, attracting theoreticians and experimentalists alike, and regrouping researchers from fields like computer science, physics, mathematics and engineering. Quantum information is very fragile and prone to decoherence. Yet by the middle of 1996 it has been shown that fault-tolerant quantum computation is possible. We give a simple description of the elements of quantum error-correction and quantum fault-tolerance. After characterizing quantum errors we present several error correction schemes and outline the elements of a full fledged fault-tolerant computation, which works error-free even though all of its components can be faulty. We also mention alternative approaches to error-correction, so called error-avoiding or decoherence-free schemes. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

arXiv:quant-ph/0612185•Birkhäuser Basel eBooks•Jan 1, 2006•57 citations

Comment on "Resilient Quantum Computation in Correlated Environments: A Quantum Phase Transition Perspective" and "Fault-tolerant Quantum Computation with Longe-range Correlated Noise"

Robert Alicki

Critical comments on the recent papers supporting the idea of resilient quantum computations are presented.

arXiv:quant-ph/0702050•Feb 6, 2007•9 citations
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 driving force for many recent experimental efforts to construct small to medium sized arrays of controllable quantum bits. We examine the basic principals of redundant quantum encoding, required to protect quantum bits from errors generated from both imprecise control and environmental interactions and then examine the principals of fault-tolerance from largely a classical framework. As quantum fault-tolerance essentially is avoiding the uncontrollable cascade of errors caused by the interaction of quantum-bits, these concepts can be directly mapped to quantum information.
The so-called "threshold" theorem says that, once the error rate per qubit per gate is below a certain value, indefinitely long quantum computation becomes feasible, even if all of the qubits involved are subject to relaxation processes, and all the manipulations with qubits are not exact. The purpose of this article, intended for physicists, is to outline the ideas of quantum error correction and to take a look at the proposed technical instruction for fault-tolerant quantum computation. It seems that the mathematics behind the threshold theorem is somewhat detached from the physical reality, and that some ideal elements are always present in the construction. This raises serious doubts about the possibility of large scale quantum computations, even as a matter of principle.
We provide a basic introduction of the core ideas and theory surrounding fault-tolerant quantum computation. Quantum fault-tolerance essentially refers to avoiding the uncontrollable cascade of errors caused by the interaction of quantum-bits. The presented concepts underlay the theoretical framework of large-scale quantum computation and are the driving force for many recent experimental efforts to construct small to medium sized arrays of controllable quantum bits. We examine the basic principles of redundant quantum encoding, required to protect quantum bits from errors generated from both imprecise control and environmental interactions. The novelty of this work consists in the presentation of fault-tolerance principles from a classical distributed computing perspective, as this enables a more straightforward introduction without sacrificing generality. The practicality of fault-tolerant quantum computing is analysed after introducing a metric of scalability and discussing the factors influencing it.
In a ground breaking discovery in 1994, Shor has shown that quantum computers, if built, can factor numbers efficiently. Since then quantum computing has become a burgeoning field of research, attracting theoreticians and experimentalists alike, and regrouping researchers from fields like computer science, physics, mathematics and engineering. Quantum information is very fragile and prone to decoherence. Yet by the middle of 1996 it has been shown that fault-tolerant quantum computation is possible. We give a simple description of the elements of quantum error-correction and quantum fault-tolerance. After characterizing quantum errors we present several error correction schemes and outline the elements of a full fledged fault-tolerant computation, which works error-free even though all of its components can be faulty. We also mention alternative approaches to error-correction, so called error-avoiding or decoherence-free schemes. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.