BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260416T202429Z
UID:Seminar-dept-1040@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20230421T130000
DTEND:20230421T140000
SUMMARY:School Seminar Series
DESCRIPTION:Dr. Nikhil Mande: Understanding the power and limitations of randomness and quantumness\n\nIn this talk we will try to understand whether access to randomness and quantumness gives an advantage to algorithms, in the settings of query complexity and communication complexity. The talk will consist of two parts:\n\n\n\nIn the first part of the talk, we consider query-to-communication simulation and show a surprising weakness of the quantum model as compared to the classical deterministic and randomized models.\n\nIn the second part of the talk, we consider the query complexity of algorithms, with oracle access to AND's and OR's of arbitrary subsets of the inputs, computing Boolean functions. We show that randomized algorithms give at most a polynomial advantage over their deterministic counterparts.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1040
LOCATION:Ashton Lecture Theatre
END:VEVENT
END:VCALENDAR