activity
20042011
most citedSubsystem fault tolerance with the Bacon-Shor code

209 citations · 991 across the 13 of their papers we have counts for

collaborators

13 papers

quant-ph2011★ 5 cited

An introduction to reliable quantum computation

Panos Aliferis

This is an introduction to software methods of quantum fault tolerance. Broadly speaking, these methods describe strategies for using the noisy hardware components of a quantum com…

quant-ph2008★ 50 cited

The Fibonacci scheme for fault-tolerant quantum computation

Panos Aliferis, John Preskill

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-…

quant-ph2008★ 104 cited

Fault-Tolerant Computing With Biased-Noise Superconducting Qubits

Panos Aliferis, Frederico Brito, David P. DiVincenzo +3

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 num…

quant-ph2007★ 206 cited

Fault-tolerant quantum computation against biased noise

Panos Aliferis, John Preskill

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 o…

quant-ph2007★ 2 cited

Fibonacci schemes of fault-tolerant quantum computation

Panos Aliferis

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.

quant-ph2007★ 7 cited

Accuracy threshold for postselected quantum computation

Panos Aliferis, Daniel Gottesman, John Preskill

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 su…