The Fibonacci scheme for fault-tolerant quantum computation

Details The Fibonacci scheme for fault-tolerant quantum computation The Fibonacci scheme for fault-tolerant quantum computation

2008-09-30

arxiv.org/abs/0809.5063v2

Phys. Rev. A 79, 012332 (2009)

Physics

Quantum Physics

24 pages, 10 figures; supersedes arXiv:0709.3603. (v2): Additional discussion about the overhead cost

Scientific paper

10.1103/PhysRevA.79.012332

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 .67\times 10^{-3} for adversarial local stochastic noise, and 1.25\times 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.

Affiliated with

Also associated with

No associations

Rating

The Fibonacci scheme for fault-tolerant quantum computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Fibonacci scheme for fault-tolerant quantum computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Fibonacci scheme for fault-tolerant quantum computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-251543