Resilient Quantum Computation: Error Models and Thresholds

Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical quantum computation requires overcoming the problems of environmental noise and operational errors, problems which appear to be much more severe than in classical computation due to the inherent fragility of quantum superpositions involving many degrees of freedom. Here we show that arbitrarily accurate quantum computations are possible provided that the error per operation is below a threshold value. The result is obtained by combining quantum error-correction, fault tolerant state recovery, fault tolerant encoding of operations and concatenation. It holds under physically realistic assumptions on the errors.Comment: 19 pages in RevTex, many figures, the paper is also avalaible at http://qso.lanl.gov/qc

Experimental implementation of encoded logical qubit operations in a perfect quantum error correcting code

Large-scale universal quantum computing requires the implementation of quantum error correction (QEC). While the implementation of QEC has already been demonstrated for quantum memories, reliable quantum computing requires also the application of nontrivial logical gate operations to the encoded qubits. Here, we present examples of such operations by implementing, in addition to the identity operation, the NOT and the Hadamard gate to a logical qubit encoded in a five qubit system that allows correction of arbitrary single qubit errors. We perform quantum process tomography of the encoded gate operations, demonstrate the successful correction of all possible single qubit errors and measure the fidelity of the encoded logical gate operations

Characterization of complex quantum dynamics with a scalable NMR information processor

We present experimental results on the measurement of fidelity decay under contrasting system dynamics using a nuclear magnetic resonance quantum information processor. The measurements were performed by implementing a scalable circuit in the model of deterministic quantum computation with only one quantum bit. The results show measurable differences between regular and complex behaviour and for complex dynamics are faithful to the expected theoretical decay rate. Moreover, we illustrate how the experimental method can be seen as an efficient way for either extracting coarse-grained information about the dynamics of a large system, or measuring the decoherence rate from engineered environments.Comment: 4pages, 3 figures, revtex4, updated with version closer to that publishe

Compiling gate networks on an Ising quantum computer

Here we describe a simple mechanical procedure for compiling a quantum gate network into the natural gates (pulses and delays) for an Ising quantum computer. The aim is not necessarily to generate the most efficient pulse sequence, but rather to develop an efficient compilation algorithm that can be easily implemented in large spin systems. The key observation is that it is not always necessary to refocus all the undesired couplings in a spin system. Instead the coupling evolution can simply be tracked and then corrected at some later time. Although described within the language of NMR the algorithm is applicable to any design of quantum computer based on Ising couplings.Comment: 5 pages RevTeX4 including 4 figures. Will submit to PR

Robust polarization-based quantum key distribution over collective-noise channel

We present two polarization-based protocols for quantum key distribution. The protocols encode key bits in noiseless subspaces or subsystems, and so can function over a quantum channel subjected to an arbitrary degree of collective noise, as occurs, for instance, due to rotation of polarizations in an optical fiber. These protocols can be implemented using only entangled photon-pair sources, single-photon rotations, and single-photon detectors. Thus, our proposals offer practical and realistic alternatives to existing schemes for quantum key distribution over optical fibers without resorting to interferometry or two-way quantum communication, thereby circumventing, respectively, the need for high precision timing and the threat of Trojan horse attacks.Comment: Minor changes, added reference

Fault-Tolerant Error Correction with Efficient Quantum Codes

We exhibit a simple, systematic procedure for detecting and correcting errors using any of the recently reported quantum error-correcting codes. The procedure is shown explicitly for a code in which one qubit is mapped into five. The quantum networks obtained are fault tolerant, that is, they can function successfully even if errors occur during the error correction. Our construction is derived using a recently introduced group-theoretic framework for unifying all known quantum codes.Comment: 12 pages REVTeX, 1 ps figure included. Minor additions and revision

The Origin of Time Asymmetry

It is argued that the observed Thermodynamic Arrow of Time must arise from the boundary conditions of the universe. We analyse the consequences of the no boundary proposal, the only reasonably complete set of boundary conditions that has been put forward. We study perturbations of a Friedmann model containing a massive scalar field but our results should be independent of the details of the matter content. We find that gravitational wave perturbations have an amplitude that remains in the linear regime at all times and is roughly time symmetric about the time of maximum expansion. Thus gravitational wave perturbations do not give rise to an Arrow of Time. However density perturbations behave very differently. They are small at one end of the universe's history, but grow larger and become non linear as the universe gets larger. Contrary to an earlier claim, the density perturbations do not get small again at the other end of the universe's history. They therefore give rise to a Thermodynamic Arrow of Time that points in a constant direction while the universe expands and contracts again. The Arrow of Time does not reverse at the point of maximum expansion. One has to appeal to the Weak Anthropic Principle to explain why we observe the Thermodynamic Arrow to agree with the Cosmological Arrow, the direction of time in which the universe is expanding.Comment: 41 pages, DAMTP R92/2

Tight Binding Hamiltonians and Quantum Turing Machines

This paper extends work done to date on quantum computation by associating potentials with different types of computation steps. Quantum Turing machine Hamiltonians, generalized to include potentials, correspond to sums over tight binding Hamiltonians each with a different potential distribution. Which distribution applies is determined by the initial state. An example, which enumerates the integers in succession as binary strings, is analyzed. It is seen that for some initial states the potential distributions have quasicrystalline properties and are similar to a substitution sequence.Comment: 4 pages Latex, 2 postscript figures, submitted to Phys Rev Letter

Protecting Quantum Information Encoded in Decoherence Free States Against Exchange Errors

The exchange interaction between identical qubits in a quantum information processor gives rise to unitary two-qubit errors. It is shown here that decoherence free subspaces (DFSs) for collective decoherence undergo Pauli errors under exchange, which however do not take the decoherence free states outside of the DFS. In order to protect DFSs against these errors it is sufficient to employ a recently proposed concatenated DFS-quantum error correcting code scheme [D.A. Lidar, D. Bacon and K.B. Whaley, Phys. Rev. Lett. {\bf 82}, 4556 (1999)].Comment: 7 pages, no figures. Discussion in section V.A. significantly expanded. Several small changes. Two authors adde

A Theory of Fault-Tolerant Quantum Computation

In order to use quantum error-correcting codes to actually improve the performance of a quantum computer, it is necessary to be able to perform operations fault-tolerantly on encoded states. I present a general theory of fault-tolerant operations based on symmetries of the code stabilizer. This allows a straightforward determination of which operations can be performed fault-tolerantly on a given code. I demonstrate that fault-tolerant universal computation is possible for any stabilizer code. I discuss a number of examples in more detail, including the five-qubit code.Comment: 30 pages, REVTeX, universal swapping operation added to allow universal computation on any stabilizer cod