55,001 research outputs found
Efficient fault-tolerant quantum computing
Fault tolerant quantum computing methods which work with efficient quantum
error correcting codes are discussed. Several new techniques are introduced to
restrict accumulation of errors before or during the recovery. Classes of
eligible quantum codes are obtained, and good candidates exhibited. This
permits a new analysis of the permissible error rates and minimum overheads for
robust quantum computing. It is found that, under the standard noise model of
ubiquitous stochastic, uncorrelated errors, a quantum computer need be only an
order of magnitude larger than the logical machine contained within it in order
to be reliable. For example, a scale-up by a factor of 22, with gate error rate
of order , is sufficient to permit large quantum algorithms such as
factorization of thousand-digit numbers.Comment: 21 pages plus 5 figures. Replaced with figures in new format to avoid
problem
Survivable algorithms and redundancy management in NASA's distributed computing systems
The design of survivable algorithms requires a solid foundation for executing them. While hardware techniques for fault-tolerant computing are relatively well understood, fault-tolerant operating systems, as well as fault-tolerant applications (survivable algorithms), are, by contrast, little understood, and much more work in this field is required. We outline some of our work that contributes to the foundation of ultrareliable operating systems and fault-tolerant algorithm design. We introduce our consensus-based framework for fault-tolerant system design. This is followed by a description of a hierarchical partitioning method for efficient consensus. A scheduler for redundancy management is introduced, and application-specific fault tolerance is described. We give an overview of our hybrid algorithm technique, which is an alternative to the formal approach given
- …