Fetching the paper…

Reading the bibliography…

2008

The Fibonacci scheme for fault-tolerant quantum computation

Aliferis, Panos, Preskill, John

Original
PDF
Post on X

Understand

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.

The Fibonacci scheme for fault-tolerant quantum computation · Around

Built on

in Proc. 37 th
P. Shor, · 1996
Earlier work this paper cites.
Phys. Rev. A
S. Bravyi and A. Kitaev, · 2005
Earlier work this paper cites.
Quantum Inf. Comp
P. Aliferis, D. Gottesman, and J. Preskill, · 2006
Earlier work this paper cites.

Similar

Ph.D. thesis, University of California, Berkeley, CA (2006); e-print quant-ph/0612004
B. W. Reichardt, · 2006
Cited alongside, same era.
Ph.D. thesis, California Institute of Technology, Pasadena, CA (2007); e-print quant-ph/0703230
P. Aliferis, · 2007
Cited alongside, same era.
Phys. Rev. Lett
P. Aliferis and A. W. Cross · 2007
Cited alongside, same era.
e-print arXiv:0709.3603
Original
P. Aliferis,
Cited in the paper.

Then

New Journal of Physics
R. Raussendorf, J. Harrington, and K. Goyal, · 2007
Later among the works it cites.
Quantum Inf. Comp
P. Aliferis, D. Gottesman, and J. Preskill, · 2008
Closest in time.
P. Aliferis and J. Preskill,
Original
2008
Closest in time.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…