Experimental quantum computation

Peter Plachta

	Ever since their conception (not very long ago), quantum computers have formed a very important field of study. This talk will recall the basics behind a quantum computer, as well as several algorithms, which may be achieved on such architecture. An introduction to the NP-complete class of algorithms will be given and a connection to quantum algorithms will be drawn, based on the fact that some quantum algorithms seem to be run much quicker than their classical counter-parts (polynomial versus exponential running times). 
	Several different approaches to building a quantum computer will be given - 1) an ion trap, 2) MRI methods, 3) simulations by optical systems. Practical matters and the optics behind all of the above will be discussed.

Bibliography (incomplete)
i) R. Cleve, A. Ekert, C. Macchiavello, M. Mosca, "Quantum Algorithms Revisited", LANL e-print quant-ph/9708016
ii) P. Shor, "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer", LANL e-print quant-ph/9508027


--------------314025AD20B5--