E. Knill, R. La amme, and W. H. Zurek, \Resilient quantum computation: error models and thresholds," Proceedings of the Royal Society of London, Series A, 454(1998), pp. 365-384. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Self-Testing of Universal and Fault-Tolerant Sets of.. - van Dam, Magniez.. (2000) (Correct)
....set consisting of a Hadamard gate, a c NOT gate, and a phase rotation gate of angle =4 is universal. In order to form a practical basis for quantum computation, a universal set must also be able to operate in a noisy environment, and therefore has to be fault tolerant[Sho95, Sho96, AB97, Kit97, KLZ98] The above set of three gates has the additional advantage of also being fault tolerant. Experimental procedures for determining the properties of quantum black boxes were given by Chuang and Nielsen[CN97] and Poyatos, Cirac and Zoller[PCZ97] however these procedures implicitly require ....
E. Knill, R. Laflamme, and W. H. Zurek. Resilient quantum computation: error models and thresholds. In Proc. Roy. Soc. London, Ser. A, 454, pp. 365--384, 1998.
Self-Testing of Universal and Fault-Tolerant Sets of.. - van Dam, Magniez.. (2000) (Correct)
....have recently shown that the set consisting of a Hadamard gate, a c NOT gate, and a phase rotation gate of angle # 4 is universal. In order to form a practical basis for quantum computation, a universal set must also be able to operate in a noisy environment, and therefore has to be fault tolerant[32, 2, 20, 22]. The above set of three gates has the additional advantage of also being fault tolerant. Experimental procedures for determining the properties of quantum black boxes were given by Chuang and Nielsen[12] and Poyatos, Cirac and Zoller[26] however these procedures implicitly require apparatus ....
E. Knill, R. Laflamme, and W.H. Zurek. Resilient quantum computation: error models and thresholds. In Proc. Roy. Soc. London, Ser. A, 454, pp. 365--384, 1998.
On the Power of Quantum Computation - Vazirani (1998) (Correct)
....for all the results in this paper. The technique is known as the hybrid argument among cryptographers. Using quantum error correction techniques, faulttolerant quantum circuits can be created that are resilient to constant error in the rotation gates, independent of the size of the circuit [AB, Go, KLZ]. How does one explain the power of quantum computation The dimension of the Hilbert space associated with an n qubit system is 2 n . Therefore, just describing the state of this system requires 2 n complex numbers. Moreover, Nature must update the 2 n complex numbers to evolve the system ....
Knill, E., Laflamme, R., Zurek, W. "Resilient quantum computation: error models and thresholds", quant-ph/9702058.
Self-Testing of Universal and Fault-Tolerant Sets of.. - van Dam, Magniez.. (2000) (Correct)
....have recently shown that the set consisting of a Hadamard gate, a c NOT gate, and a phase rotation gate of angle =4 is universal. In order to form a practical basis for quantum computation, a universal set must also be able to operate in a noisy environment, and therefore has to be fault tolerant[32, 2, 20, 22]. The above set of three gates has the additional advantage of also being fault tolerant. Experimental procedures for determining the properties of quantum black boxes were given by Chuang and Nielsen[12] and Poyatos, Cirac and Zoller[26] however these procedures implicitly require apparatus ....
E. Knill, R. La amme, and W.H. Zurek. Resilient quantum computation: error models and thresholds. In Proc. Roy. Soc. London, Ser. A, 454, pp. 365-384, 1998.
Quantum Computation - Aharonov (1998) (1 citation) (Correct)
....length can be applied efficiently with arbitrary level of confidence, if the noise rate is smaller than the threshold j c . The threshold j c , depends on the parameters of the computation code: A, the largest procedure s area, and d, the number of errors which the code can correct. Estimations[5, 128, 106, 107, 130, 162] of j c are in the range between 10 Gamma4 and 10 Gamma6 . Presumably the correct threshold is much higher. The highest noise rate in which fault tolerance is possible is not known yet. The rigorous proof of the threshold theorem is quite complicated. To gain some insight we can view the ....
Knill E, Laflamme R and Zurek W H 1997 Resilient quantum computation: error models and thresholds in LANL e-print quant-ph/9702058, http://xxx.lanl.gov (1997)
On Universal and Fault-Tolerant Quantum Computing - Boykin, Mor, Pulver.. (1999) (7 citations) (Correct)
No context found.
E. Knill, R. La amme, and W. H. Zurek, \Resilient quantum computation: error models and thresholds," Proceedings of the Royal Society of London, Series A, 454(1998), pp. 365-384.
Fault Tolerant Computation on Ensemble Quantum Computers - Boykin, Mor, Roychowdhury, .. (Correct)
No context found.
E. Knill, R. La amme, and W. H. Zurek. Resilient quantum computation: error models and threshold. Proceedings of the Royal Society of London, Series A, 454(1969):365-384, 8 January 1998.
Self-Testing of Universal and Fault-Tolerant Sets of.. - van Dam, Magniez.. (Correct)
No context found.
E. Knill, R. Laflamme, and W.H. Zurek. Resilient quantum computation: error models and thresholds. In Proc. Roy. Soc. London, Ser. A, 454, pp. 365--384, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC