BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2006/newsitem/1436/7-S
eptember-2006-PhD-defense-Robert-Spalek
DTSTAMP:20060720T000000
SUMMARY:PhD defense, Robert Spalek
DTSTART;TZID=Europe/Amsterdam:20060907T120000
DTEND;TZID=Europe/Amsterdam:20060907T000000
LOCATION:Oude Lutherse Kerk, Singel 411, Amsterdam
ATTENDEE;ROLE=Promotor:Harry Buhrman
ATTENDEE;ROLE=Copromotor:Ronald de Wolf
DESCRIPTION:In this thesis, we investigate fast qu
antum algorithms for several graph problems (such
as finding a maximal bipartite matching, and a max
imal flow in an integer network) and verification
of matrix products. We also address quantum query
lower bounds, i.e. proofs that certain tasks canno
t be computed faster than some value. We prove the
first known time-space tradeoffs for quantum comp
utation, and most of them are tight. For more i
nformation, see http://www.ucw.cz/~robert/papers/a
bs-phd-en.html
X-ALT-DESC;FMTTYPE=text/html:\n \n
In this thesis, we investigate fast quantum algori
thms for several graph problems (such as finding a
maximal bipartite matching, and a maximal flow in
an integer network) and verification of matrix pr
oducts. We also address quantum query lower bound
s, i.e. proofs that certain tasks cannot be comput
ed faster than some value. We prove the first kno
wn time-space tradeoffs for quantum computation, a
nd most of them are tight.\n

\n \n
\n For more information, see\n
http://www.ucw.cz/~robert
/papers/abs-phd-en.html\n

\n
URL:/NewsandEvents/Archives/2006/newsitem/1436/7-S
eptember-2006-PhD-defense-Robert-Spalek
END:VEVENT
END:VCALENDAR