Quantum computing for beginners

Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999

Volumn 3, Issue , 1999, Pages 2231-2238

  Narayanan, Ajit ^a  

^a UNIVERSITY OF EXETER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; QUANTUM THEORY;

BASIC CONCEPTS; QUANTUM ALGORITHMS; QUANTUM COMPUTING;

QUANTUM COMPUTERS;

EID: 84901466909     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.1999.785552     Document Type: Conference Paper

References (16)

1. Deutsch, D. (1985). Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London, A400:97-111.
2. Deutsch, D. (1989). Quantum computational networks. Proceedings of the Royal Society of London, A425:73-90.
3. Deutsch, D. (1997). The Fabric of Reality. Allen Lane.
4. Everett, H. (1957). 'relative state' formulation of quantum mechanics. Review of Modern Physics, 29:454-462.
5. Feynman, R. (1982). Simulating physics with computers. International Journal of Theoretical Physics, 21 (6/7):467-488.
6. Feynman, R. (1986). Quantum mechanical computers. Foundations of Physics, 16:507-531.
7. Gershenfeld, N. and Chung, I. (1997). Bulk spin resonance quantum computation. Science, 275 (January 17):350.
8. Hey, T. and Walters, P. (1987). The Quantum Universe. Cambridge University Press.
9. Landauer, R. (1995). Is quantum mechanics useful? Proceedings of the Royal Society of London, To appear.
10. Lloyd, S. (1995). Quantummechanical computers. Scientific American.
11. Moore, M. P. (1995). Quantuminspired algorithms and a method for their construction. Master's thesis, Department of Computer Science, University of Exeter, Exeter, UK.
12. Narayanan, A. and Moore, M. (1996). Quantum inspired genetic algorithms. In Proceedings of the 1996IEE International Conference on Evolutionary Computation (ICEC96). IEEE Press.
13. Penrose, R. (1994). Shadows of the Mind. Oxford University Press.
14. Rivest. R. L., Shamir, A., and Adleman, L. (1978). A method for obtaining digital and public-key cryptosystems. Communications of the ACM, 21 (2).
15. Shor, P. W. (1994). Algorithms for quantum computation: Discrete logarithms and factoring. In 35th Annual Symposium on Foundations of Computer Science. IEEE Press.
16. Turing, A. M. (1936). On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, Series2, 42:230-265. Correction, 43, 544-546, 1937.