The Fibonacci scheme for fault-tolerant quantum computation

We rigorously analyze Knill's Fibonacci scheme for fault-tolerant quantum computation, which is based on the recursive preparation of Bell states protected by a concatenated error-detecting code. We prove lower bounds on the threshold fault rate of .67\times 10^{-3} for adversarial local stochastic noise, and 1.25\times 10^{-3} for independent depolarizing noise. In contrast to other schemes with comparable proved accuracy thresholds, the Fibonacci scheme has a significantly reduced overhead cost because it uses postselection far more sparingly.Comment: 24 pages, 10 figures; supersedes arXiv:0709.3603. (v2): Additional discussion about the overhead cos

Fault-tolerant quantum computation versus Gaussian noise

We study the robustness of a fault-tolerant quantum computer subject to Gaussian non-Markovian quantum noise, and we show that scalable quantum computation is possible if the noise power spectrum satisfies an appropriate "threshold condition." Our condition is less sensitive to very-high-frequency noise than previously derived threshold conditions for non-Markovian noise.Comment: 30 pages, 6 figure

Fault-tolerant quantum computation against biased noise

We formulate a scheme for fault-tolerant quantum computation that works effectively against highly biased noise, where dephasing is far stronger than all other types of noise. In our scheme, the fundamental operations performed by the quantum computer are single-qubit preparations, single-qubit measurements, and conditional-phase (CPHASE) gates, where the noise in the CPHASE gates is biased. We show that the accuracy threshold for quantum computation can be improved by exploiting this noise asymmetry; e.g., if dephasing dominates all other types of noise in the CPHASE gates by four orders of magnitude, we find a rigorous lower bound on the accuracy threshold higher by a factor of 5 than for the case of unbiased noise

Simple proof of fault tolerance in the graph-state model

We consider the problem of fault tolerance in the graph-state model of quantum computation. Using the notion of composable simulations, we provide a simple proof for the existence of an accuracy threshold for graph-state computation by invoking the threshold theorem derived for quantum circuit computation. Lower bounds for the threshold in the graph-state model are then obtained from known bounds in the circuit model under the same noise process.Comment: 6 pages, 2 figures, REVTeX4. (v4): Minor revisions and new title; published versio

Efficient electroweak baryogenesis by black holes

A novel cosmological scenario, capable to generate the observed baryon number at the electroweak scale for very small CP violating angles, is presented. The proposed mechanism can be applied in conventional FRW cosmology, but becomes extremely efficient due to accretion in the context of early cosmic expansion with high energy modifications. Assuming that our universe is a Randall-Sundrum brane, baryon asymmetry can easily be produced by Hawking radiation of very small primordial black holes. The Hawking radiation reheats a spherical region around every black hole to a high temperature and the electroweak symmetry is restored there. A domain wall is formed separating the region with the symmetric vacuum from the asymmetric region where electroweak baryogenesis takes place. First order phase transition is not needed. The black holes's lifetime is prolonged due to accretion, resulting to strong efficiency of the baryon producing mechanism. The allowed by the mechanism black hole mass range includes masses that are energetically favoured to be produced from interactions around the higher dimensional Planck scale.Comment: 32 pages, to appear in Physical Review

The Non-Equilibrium Reliability of Quantum Memories

The ability to store quantum information without recourse to constant feedback processes would yield a significant advantage for future implementations of quantum information processing. In this paper, limitations of the prototypical model, the Toric code in two dimensions, are elucidated along with a sufficient condition for overcoming these limitations. Specifically, the interplay between Hamiltonian perturbations and dynamically occurring noise is considered as a system in its ground state is brought into contact with a thermal reservoir. This proves that when utilizing the Toric code on N^2 qubits in a 2D lattice as a quantum memory, the information cannot be stored for a time O(N). In contrast, the 2D Ising model protects classical information against the described noise model for exponentially long times. The results also have implications for the robustness of braiding operations in topological quantum computation.Comment: 4 pages. v3: published versio

The Implications of Ignorance for Quantum Error Correction Thresholds

Quantum error correcting codes have a distance parameter, conveying the minimum number of single spin errors that could cause error correction to fail. However, the success thresholds of finite per-qubit error rate that have been proven for the likes of the Toric code require them to work well beyond this limit. We argue that without the assumption of being below the distance limit, the success of error correction is not only contingent on the noise model, but what the noise model is believed to be. Any discrepancy must adversely affect the threshold rate, and risks invalidating existing threshold theorems. We prove that for the 2D Toric code, suitable thresholds still exist by utilising a mapping to the 2D random bond Ising model.Comment: 8 pages, 2 figures. Title change enforced by journa