Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, March 06, 2012, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Johannes Lengler

Evolutionary Algorithms on Quantum Computers

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login