PRINCIPLES OF QUANTUM COMPUTING; EXAMPLES OF QUANTUM ALGORITHMS
Dr Leonid Fedichkin, Quantum Computer Physics Laboratory, Institute of Physics and Technology, Russian Academy of Sciences, Moscow

Abstract: The contents of the report can be briefly outlined by terms to be discussed: Complexity of computation. Untractable and polynomial problems. Advantages of quantum mechanics for computing. Entanglement. Quantum bits. Quantum gates. Quantum algorithms. Scheme of quantum computer. Deutsch's algorithm. Influence of errors. Polynomial procedure of avoiding errors of interaction.

This seminar was held at the Department of Computer Science, Royal Holloway, University of London on 9 July 2001.

back