Gottesman, Daniel (1998) Theory of fault-tolerant quantum computation. Physical Review A, 57 (1). pp. 127-137. ISSN 1050-2947 http://resolver.caltech.edu/CaltechAUTHORS:GOTpra98
|
PDF
See Usage Policy. 199Kb | |
|
PDF
See Usage Policy. 195Kb |
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:GOTpra98
Abstract
In order to use quantum error-correcting codes to improve the performance of a quantum computer, it is necessary to be able to perform operations fault-tolerantly on encoded states. I present a theory of fault-tolerant operations on stabilizer codes based on symmetries of the code stabilizer. This allows a straightforward determination of which operations can be performed fault-tolerantly on a given code. I demonstrate that fault-tolerant universal computation is possible for any stabilizer code. I discuss a number of examples in more detail, including the five-quantum-bit code.
| Item Type: | Article |
|---|---|
| Additional Information: | ©1998 The American Physical Society Received 18 February 1997 This work was supported in part by the U.S. Department of Energy under Grant No. DE-FG03-92-ER40701 and by DARPA under Grant No. DAAH04-96-1-0386 administered by the Army Research Office. I would like to thank John Preskill, Manny Knill, Richard Cleve, and David DiVincenzo for helpful discussions. Author preprint arXiv:quant-ph/9702029 v2 18 Feb 1997. Also reports CALT-68-2100, QUIC-97-004 |
| Record Number: | CaltechAUTHORS:GOTpra98 |
| Persistent URL: | http://resolver.caltech.edu/CaltechAUTHORS:GOTpra98 |
| Alternative URL: | http://dx.doi.org/10.1103/PhysRevA.57.127 |
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. |
| ID Code: | 3850 |
| Collection: | CaltechAUTHORS |
| Deposited By: | Archive Administrator |
| Deposited On: | 17 Jul 2006 |
| Last Modified: | 26 Dec 2012 08:56 |
Repository Staff Only: item control page


