Fibonacci schemes of fault-tolerant quantum computation

2007/09/22 by Panos Aliferis, Aliferis, Panos · 2 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph

paper · pdf · doi:10.48550/arxiv.0709.3603

Superseded by arXiv:0809.5063

arxiv created 2008/09/29 · arxiv updated 2009/12/01

Abstract

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.

Cited by

• The Fibonacci scheme for fault-tolerant quantum computation
• Efficient one- and two-qubit pulsed gates for an oscillator-stabilized Josephson qubit

Related

• Fault-Tolerant Quantum Computation
• Fault-Tolerant Postselected Quantum Computation: Threshold Analysis
• Fault-Tolerant Quantum Computation With Constant Error Rate
• Threshold Estimate for Fault Tolerant Quantum Computation
• A note on threshold theorem of fault-tolerant quantum computation