Campus Event Calendar
Event Entry
What and Who
Quantum Computing and Quantum Complexity
Johannes Lengler
Fachrichtung Mathematik - Saarbrücken
Talk
AG 1, AG 3, AG 5, RG2, AG 2, AG 4, RG1, SWS
MPI Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 27 October 2008
16:00
90 Minutes
E2.4 - math building
HS IV
Saarbrücken
Abstract
Quantum computers are computers which make use of the quantum theoretic effects that occur in small-scale systems.
I introduce the abstract notion of a quantum computer, explain why it might be computationally stronger than classical computer and give an overview of its complexity theory (both on what is know and what is conjectured). I also try to adjust some misconceptions about quantum computers - especially that they were essentially non-deterministic Turing machines or that they could be used to solve NP-hard problems.
I finally present shortly two of the three algorithm classes that are faster on a quantum computer than on a classical computer. (The third class follows next week).
Contact
math-vl
Uni-2230
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
The talk will be continued next week, but the first talk is self-contained. If you are interested in Quantum complexity, the first talk alone will be fine.
However, the second talk is not self-contained. You will need the first talk (or at least the notion of an abstract quantum computer) to understand the second talk.
However, the second talk is not self-contained. You will need the first talk (or at least the notion of an abstract quantum computer) to understand the second talk.
math-vl, 10/21/2008 09:59 -- Created document.