#### Filter Results:

- Full text PDF available (13)

#### Publication Year

1964

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Panos Aliferis, Daniel Gottesman, John Preskill
- Quantum Information & Computation
- 2006

We prove a new version of the quantum threshold theorem that applies to concatenation of a quantum code that corrects only one error, and we use this theorem to derive a rigorous lower bound on the quantum accuracy threshold ε0. Our proof also applies to concatenation of higher-distance codes, and to noise models that allow faults to be correlated in space… (More)

- Panos Aliferis, Andrew W. Cross
- Physical review letters
- 2007

We discuss how the presence of gauge subsystems in the Bacon-Shor code [D. Bacon, Phys. Rev. A 73, 012340 (2006)10.1103/PhysRevA.73.012340 (2006)] leads to remarkably simple and efficient methods for fault-tolerant error correction (FTEC). Most notably, FTEC does not require entangled ancillary states, and it can be implemented with nearest-neighbor… (More)

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 conditionalphase CPHASE gates, where the… (More)

The ability to perform a universal set of quantum operations based solely on static resources and measurements presents us with a striking viewpoint for thinking about quantum computation and its powers. We consider the two major models for doing quantum computation by measurements that have hitherto appeared in the literature and show that they are… (More)

We present a universal scheme of pulsed operations for the IBM oscillator-stabilized flux qubit comprising the controlled-σz (cphase) gate, single-qubit preparations and measurements. Based on numerical simulations, we argue that the error rates for these operations can be as low as about .5% and that noise is highly biased, with phase errors being stronger… (More)

- Panos Aliferis, Barbara M. Terhal
- Quantum Information & Computation
- 2007

We provide a rigorous analysis of fault-tolerant quantum computation in the presence of local leakage faults. We show that one can systematically deal with leakage by using appropriate leakage-reduction units such as quantum teleportation. The leakage noise is described by a Hamiltonian and the noise is treated coherently, similar to general non-Markovian… (More)

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 0.67 10−3 for adversarial local stochastic noise, and 1.25 10−3 for independent depolarizing noise. In… (More)

- Panos Aliferis, Daniel Gottesman, John Preskill
- Quantum Information & Computation
- 2008

We prove an accuracy threshold theorem for fault-tolerant quantum computation based on error detection and postselection. Our proof provides a rigorous foundation for the scheme suggested by Knill, in which preparation circuits for ancilla states are protected by a concatenated error-detecting code and the preparation is aborted if an error is detected. The… (More)

- David P. DiVincenzo, Panos Aliferis
- Physical review letters
- 2007

How important is fast measurement for fault-tolerant quantum computation? Using a combination of existing and new ideas, we argue that measurement times as long as even 1000 gate times or more have a very minimal effect on the quantum accuracy threshold. This shows that slow measurement, which appears to be unavoidable in many implementations of quantum… (More)

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… (More)