Fault tolerant computation on ensemble quantum computers

Proceedings of the International Conference on Dependable Systems and Networks

Volumn , Issue , 2004, Pages 157-166

  Boykin, P Oscar ^a   Roychowdhury, Vwani P ^a   Mor, Tal ^b   Vatan, Farrokh ^c  

^a University of California   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DECODING; ERROR CORRECTION; NUCLEAR MAGNETIC RESONANCE; PROBLEM SOLVING; QUANTUM CRYPTOGRAPHY;

QUANTUM COMPUTATION (QC); QUANTUM TOFFOLI GATES; RANDOM NUMBER GENERATOR (RNG);

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 4544344346     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/dsn.2004.1311886     Document Type: Conference Paper

References (23)

1. D. Aharonov. Private communication.
2. D. Aharonov and M. Ben-Or. Fault tolerant quantum computation with constant error rate, submitted to SIAM journal of computation, quant-ph/9906129.
3. D. Aharonov and M. Ben-Or. Polynomial simulations of decohered quantum computers. In Proceedings of 37th Annual Symposium on Foundations of Computer Science, FOCS'96, pages 46-55. IEEE Computer Society Press, Los Alamitos, CA, USA, 1996.
4. P. O. Boykin, T. Mor, M. Pulver, V. P. Roychowdhury, and F. Vatan. On universal and fault-tolerant quantum computation. In Proc. of 40th Ann. Symp. on Found, of Comp. Sc., pages 486-494, 1999. quant-ph/9906054.
5. P. O. Boykin, T. Mor, M. Pulver, V. P. Roychowdhury, and F. Vatan. A new universal and fault-tolerant quantum basis. Information Processing Letters, 75:101-107, 2000.
6. P. O. Boykin, T. Mor, V. P. Roychowdhury, and F. Vatan. Algorithms on ensemble quantum computers. quant-ph/9907067, 1999.
7. P. O. Boykin, T. Mor, V. P. Roychowdhury, F. Vatan, and R. Vrijen. Algorithmic cooling of ensemble computers. Proceedings of the National Academy of Sciences, 99(6):3388-3393, 2002.
8. G. Brassard, S. L. Braunstein, and R. Cleve. Teleportation as a quantum computation. Physica D, 120(1-2):43-47, 1 September 1998.
9. D. Gory, M. Price, W. Mass, E. Knill, R. Laflamme, W. Zurek, T. Havel, and S. Somaroo. Experimental quantum error correction. Phys. Rev. Lett., 81:2152-2155, 1998.
10. D. G. Cory, A. F. Fahmy, and T. F. Havel. Ensemble quantum computing by nuclear magnetic resonance spectroscopy. Proceedings of the National Acadamy of Sciences of USA, 94:1634-1639, 1997.
11. N. Gershenfeld and I. L. Chuang. Bulk spin-resonance quantum computation. Science, 275(5298):350-356, 17 January 1997.
12. L. K. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC'96, pages 212-219. ACM Press, 1996.
13. J. A. Jones, M. Mosca, and R. H. Hansen. Implementation of a quantum search algorithm on a quantum computer. Nature, 393:344-346, 1998.
14. A. Yu. Kitaev. Quantum computation: algorithms and error correction. Russian Mathematical Surveys, 52(6):1191-1249, 1997.
15. E. Knill, R. Laflamme, and W. H. Zurek. Accuracy threshold for quantum computation, quantph/9610011, 1996.
16. E. Knill, R. Laflamme, 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.
17. M. A. Nielsen, E. Knill, and R. Laflamme. Complete quantum teleportation using nuclear magnetic resonance. Nature, 396:52-55, 1998.
18. A. Peres. Quantum disentanglement and computation. Superlattices and Microstructures, 23(3-4):373-379, 1998.
19. J. Preskill. Reliable quantum computers. Proceedings of the Royal Society of London, Series A, 454(1969):385-410, 8 January 1998.
20. L. J. Schulman and U. Vazirani. Scalable nmr quantum computation. In Proceedings of the Slat Annual ACM Symposium on Theory of Computing, STOC'99, pages 322-329. IEEE Computer Society Press, 1999. quantph/9804060.
21. P. W. Shor. Fault-tolerant quantum computation. In Proceedings of 37th Annual Symposium on Foundations of Computer Science, FOCS'96, pages 56-65. IEEE Computer Society Press, Los Alamitos, CA, USA, 1996.
22. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484-1509, October 1997.
23. L. M. K. Vandersypen, M. Steffen, G. Breyta, C. S. Yannoni, M. H. Sherwood, and I. L. Chuang. Experimental realization of shor's quantum factoring algorithm using nuclear magnetic resonance. Nature, 414:883-887, 2001.