We propose a scheme to realize scalable quantum computation in a planar ion crystal confined by a Paul trap. We show that the inevitable in-plane micromotion affects the gate design via three separate effects: renormalization of the equilibrium positions, coupling to the transverse motional modes, and amplitude modulation in the addressing beam. We demonstrate that all of these effects can be t...

As transistor geometries are reduced, quantum effects begin to dominate device performance. At some point, transistors cease to have the properties that make them useful computational components. New computing elements must be developed in order to keep pace with Moore’s Law. Quantum dot cellular automata (QCA) represent an alternative paradigm to transistor-based logic. QCA architectures that ...

We present a peer logging system for reducing performance overhead in fault-tolerant distributed shared memory systems. Our system provides fault-tolerant shared memory using individual checkpointing and rollback. Peer logging logs DSM modification messages to remote nodes instead of to local disks. We present results for implementations of our fault-tolerant technique using simulations of both...

AI-based search techniques have been adapted as viable, topology-independent fault-tolerant routing strategies on multiprocessor networks [P.K.K. Loh, Artificial intelligence search techniques as fault-tolerant routing strategies, Parallel Computing 22 (8) (1996) 1127–1147]. These fault-tolerant routing strategies are viable with the exception that the routes obtained were non-minimal. This mea...

When a fault occurs in a system, the main problem to be addressed is to raise an alarm, ideally diagnose what fault has occurred, and then decide how to deal with it. The problem of detecting a fault, finding the source/location and then taking appropriate action is the basis of fault tolerant control. In this chapter, an introduction to fault tolerant control (FTC) and fault detection and isol...

We present a novel set of reversible modular multipliers applicable to quantum computing, derived from three classical techniques: 1) traditional integer division, 2) Montgomery residue arithmetic [1], and 3) Barrett reduction [2]. Each multiplier computes an exact result for all binary input values, while maintaining the asymptotic resource complexity of a single (non-modular) integer multipli...

Topological color codes defined by the 4.8.8 semiregular lattice feature geometrically local check operators and admit transversal implementation of the entire Clifford group, making them promising candidates for fault-tolerant quantum computation. Recently, several efficient algorithms for decoding the syndrome of color codes were proposed. Here, we modify one of these algorithms to account fo...

This paper studies on a fuzzy predictive model based high speed train fault tolerant control method, which is very important for high speed train’s high-precision control. After analyzing related research works about fault tolerant control and the development of modern high speed train, design of the high speed train fault tolerant control system is given. Afterwards, the high speed train fault...

High performance computing platforms such as Clusters, Grid and Desktop Grids are becoming larger and subject to more frequent failures. MPI is one of the most used message passing libraries in HPC applications. These two trends raise the need for fault-tolerant MPI. The MPICH-V project focuses on designing, implementing and comparing several automatic fault-tolerant protocols for MPI applicati...

This pedagogical review presents the proof of the Solovay-Kitaev theorem in the form of an efficient classical algorithm for compiling an arbitrary single-qubit gate into a sequence of gates from a fixed and finite set. The algorithm can be used, for example, to compile Shor's algorithm, which uses rotations of π/2 k , into an efficient fault-tolerant form using only Hadamard, controlled-not, a...