Fibonacci scheme for fault-tolerant quantum computation (2009)
Aliferis, Panos, Preskill, John
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...
Fault-tolerant quantum computation against biased noise (2008)
Aliferis, Panos, Preskill, John
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...
The Fibonacci scheme for fault-tolerant quantum computation (2008)
Aliferis, Panos, Preskill, John
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...
Fault-Tolerant Computing With Biased-Noise Superconducting Qubits (2008)
Aliferis, Panos, Brito, Frederico, DiVincenzo, David P., Preskill, John, Steffen, Matthias, Terhal, Barbara M.
We present a universal scheme of pulsed operations for the IBM oscillator-stabilized flux qubit comprising the CPHASE gate, single-qubit preparations and measurements. Based on numerical simulations,...
Fault-tolerant quantum computation against biased noise (2007)
Aliferis, Panos, Preskill, John
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...
Fibonacci schemes of fault-tolerant quantum computation (2007)
The threshold estimate derived in previous versions of this paper was incorrect; this note explains the flaw. A new proof is discussed in arXiv:0809.5063.
Subsystem Fault Tolerance with the Bacon-Shor Code (2007)
Aliferis, Panos, Cross, Andrew W.
We discuss how the presence of gauge subsystems in the Bacon-Shor code [D. Bacon, Phys. Rev. A 73, 012340 (2006)] leads to remarkably simple and efficient methods for fault-tolerant error correction...
Accuracy threshold for postselected quantum computation (2007)
Aliferis, Panos, Gottesman, Daniel, Preskill, John
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,...
Level Reduction and the Quantum Threshold Theorem (2007)
The quantum threshold theorem shows that a noisy quantum computer can accurately and efficiently simulate any ideal quantum computation provided that noise is weakly correlated and its strength is...
Effective Fault-Tolerant Quantum Computation with Slow Measurements (2007)
DiVincenzo, David P., Aliferis, Panos
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...
Subsystem fault tolerance with the Bacon-Shor code (2006)
Aliferis, Panos, Cross, Andrew W.
We discuss how the presence of gauge sub-systems in the Bacon-Shor code [D. Bacon, Phys. Rev. A 73, 012340 (2006)] leads to remarkably simple and efficient methods for fault-tolerant error correction...
Effective fault-tolerant quantum computation with slow measurements (2006)
DiVincenzo, David P., Aliferis, Panos
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 1,000 gate times or more have...
Fault-Tolerant Quantum Computation for Local Leakage Faults (2005)
Aliferis, Panos, Terhal, Barbara M.
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...
Quantum accuracy threshold for concatenated distance-3 codes (2005)
Aliferis, Panos, Gottesman, Daniel, Preskill, John
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...
Simple proof of fault tolerance in the graph-state model (2005)
Aliferis, Panos, Leung, Debbie W.
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...
Computation by measurements: A unifying picture (2004)
Aliferis, Panos, Leung, Debbie W.
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...
Computation by measurements: a unifying picture (2004)
Aliferis, Panos, Leung, Debbie W.
The ability to perform a universal set of quantum operations based solely on static resources and measurements presents us with a strikingly novel viewpoint for thinking about quantum computation and...