Published January 2009
| Version Published
Journal Article
Open
Fibonacci scheme for fault-tolerant quantum computation
Creators
-
1.
IBM Research - Thomas J. Watson Research Center
-
2.
California Institute of Technology
Abstract
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.
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.Attached Files
Published - ALIpra09.pdf
Files
ALIpra09.pdf
Additional details
Identifiers
- Eprint ID
- 13166
- Resolver ID
- CaltechAUTHORS:ALIpra09
Funding
- Department of Energy
- DE-FG03-92-ER40701
- National Science Foundation
- PHY-0456720
- National Security Agency
- Army Research Office
- W911NF-05-1-0294
Dates
- Created
-
2009-01-31Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field