Fault-tolerant quantum computation with local gates - INSPIRE

DataBETA

Fault-tolerant quantum computation with local gates

Daniel Gottesman

Mar, 1999

14 pages

Published in:

J.Mod.Opt. 47 (2000) 333-345

e-Print:

quant-ph/9903099 [quant-ph]

DOI:

10.1080/09500340008244046

View in:

ADS Abstract Service

reference search44 citations

Citations per year

Abstract:

I discuss how to perform fault-tolerant quantum computation with concatenated codes using local gates in small numbers of dimensions. I show that a threshold result still exists in three, two, or one dimensions when next-to-nearest-neighbor gates are available, and present explicit constructions. In two or three dimensions, I also show how nearest-neighbor gates can give a threshold result. In all cases, I simply demonstrate that a threshold exists, and do not attempt to optimize the error correction circuit or determine the exact value of the threshold. The additional overhead due to the fault-tolerance in both space and time is polylogarithmic in the error rate per logical gate.

Note:

14 pages, LaTeX

References(18)

Figures(0)

[1]

Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer

Peter W. Shor
(
- Bell Labs
)

- SIAM J.Sci.Statist.Comput. 26 (1997) 1484
•
e-Print:
- quant-ph/9508027
•
DOI:
- 10.1137/S0097539795293172

[2]

Quantum mechanics helps in searching for a needle in a haystack

Lov K. Grover
(
- Bell Labs
)

- Phys.Rev.Lett. 79 (1997) 325-328
•
e-Print:
- quant-ph/9706033
•
DOI:
- 10.1103/PhysRevLett.79.325

[3]

Fault-tolerant quantum computation

Peter W. Shor
(
- Bell Labs
)

[4]

Concatenated quantum codes

Emanuel Knill
(
- Los Alamos and
- Santa Barbara, KITP
)
,
Raymond Laflamme
(
- Los Alamos and
- Santa Barbara, KITP
)

e-Print:
- quant-ph/9608012

[5]

Accuracy threshold for quantum computation

Emanuel Knill
(
- Los Alamos and
- UC, Santa Barbara
)
,
Raymond Laflamme
(
- Los Alamos and
- UC, Santa Barbara
)
,
Wojciech Zurek
(
- Los Alamos and
- UC, Santa Barbara
)

e-Print:
- quant-ph/9610011

[5]

Resilient Quantum Computation

- Science 279 (1998) 5349, 342-345
•
DOI:
- 10.1126/science.279.5349.342

[5]

Resilient quantum computation: error models and thresholds

E. Knill
,
R. Laflamme
,
W.H. Zurek

[7]

Fault tolerant quantum computation with constant error

Dorit Aharonov
(
- Hebrew U.
)
,
Michael Ben-Or
(
- Hebrew U.
)

e-Print:
- quant-ph/9611025

[6]

Quantum error correction with imperfect gates

A.Y. Kitaev

[7]

Fault tolerant quantum computation with constant error

Dorit Aharonov
(
- Hebrew U.
)
,
Michael Ben-Or
(
- Hebrew U.
)

e-Print:
- quant-ph/9611025

[8]

A Theory of fault tolerant quantum computation

Daniel Gottesman
(
- Caltech
)

- Phys.Rev.A 57 (1998) 127
•
e-Print:
- quant-ph/9702029
•
DOI:
- 10.1103/PhysRevA.57.127

[9]

Fault tolerant quantum computation

John Preskill
(
- Caltech
)

e-Print:
- quant-ph/9712048

[10]

unpublished

D. Gottesman
,
J. Preskill

[11]

Threshold estimate for fault tolerant quantum computing

Christof Zalka
(
- Los Alamos
)

e-Print:
- quant-ph/9612028

[12]

A silicon-based nuclear spin quantum computer

B.E. Kane
(
- New South Wales U.
)

- Nature 393 (1998) 6681, 133-137
•
DOI:
- 10.1038/30156

[13]

Error Correcting Codes in Quantum Theory

A.M. Steane
(
- Oxford U., Ctr. Quantum Comp.
)

- Phys.Rev.Lett. 77 (1996) 5, 793-797
•
DOI:
- 10.1103/physrevlett.77.793

[14]

Reliable computation with cellular automata

P. Gács

- J.Comput.Syst.Sci. 32 (1986) 15

[15]

Elementary gates for quantum computation

Adriano Barenco
(
- Oxford U.
)
,
Charles H. Bennett
(
- IBM Watson Res. Ctr.
)
,
Richard Cleve
(
- Calgary U.
)
,
David P. DiVincenzo
(
- IBM Watson Res. Ctr.
)
,
Norman Margolus
(
- MIT, LNS
)

et al.

- Phys.Rev.A 52 (1995) 3457
•
e-Print:
- quant-ph/9503016
•
DOI:
- 10.1103/PhysRevA.52.3457