Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, March 06, 2012, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Johannes Lengler
Evolutionary algorithms (EAs) are widely used general-purpose algorithms that have proven to be very successful in practice. The user typically does not need to know anything specific about a problem in order to apply them. In contrast, for quantum computers only a handful of highly specialized algorithms are known that outperform classical algorithms, and most of them solve highly structured problems. Nevertheless, it is possible to define for every EA a quantum analogue. In my talk, I will explain the basic idea of Quantum Evolutionary Algorithms (QEAs), after giving a bit of background on evolutionary algorithms and on quantum computing. We will see that the runtime of a QEA can be analyzed by purely classical means, i.e., without any knowledge about quantum computing. It turns out that on some problems the QEAs are considerably faster than their classical counterparts, while on other problems there is no difference at all. I will explain the reasons for this discrepancy by means of some examples.
Automatic MiSe System Software Version 1.4803M | admin login