A Caltech Library Service

Fibonacci scheme for fault-tolerant quantum computation

Aliferis, Panos and Preskill, John (2009) Fibonacci scheme for fault-tolerant quantum computation. Physical Review A, 79 (1). 012332. ISSN 1050-2947. doi:10.1103/PhysRevA.79.012332.

PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


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

Item Type:Article
Related URLs:
URLURL TypeDescription
Additional Information:© 2009 The American Physical Society. Received 30 September 2008; published 30 January 2009. We are grateful to Daniel Gottesman, David DiVincenzo, and Barbara Terhal for helpful discussions and comments. This research is supported in part by DOE under Grant No. DE-FG03-92-ER40701, NSF under Grant No. PHY-0456720, and NSA under ARO Contract No. W911NF-05-1-0294.
Funding AgencyGrant Number
Department of EnergyDE-FG03-92-ER40701
National Science FoundationPHY-0456720
National Security AgencyUNSPECIFIED
Army Research OfficeW911NF-05-1-0294
Subject Keywords:Bell theorem, fault tolerant computing, Fibonacci sequences, quantum computing, quantum noise
Issue or Number:1
Record Number:CaltechAUTHORS:ALIpra09
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:13166
Deposited By: Archive Administrator
Deposited On:31 Jan 2009 00:15
Last Modified:08 Nov 2021 22:35

Repository Staff Only: item control page