• home
• current students
• graduate
• events

Presenter: Professor Richard Cleve - Department of Computer Science, University of Calgary
Supervisor:

Date: Fri, July 18, 2003
Time: 13:30:00 - 00:00:00
Place: David Strong Building, Room C122

ABSTRACT

The field of Computer Science is affected in interesting ways when the underlying notion of information is extended to the quantum mechanical framework. In particular, there are a number of information processing tasks that are (or appear to be) infeasible in the context of classical information that become feasible with quantum information.

In this talk, I will first give an overview of quantum information theory and quantum algorithms, including some of my recent work that expands our repertoire of quantum algorithms. I will then explain the communication complexity scenario and show how it is affected when quantum information is available. Although it is known that n quantum bits (qubits) cannot convey more classical information than n bits, there are nevertheless information processing tasks for which using qubits instead of bits can yield substantial communication reductions. My work (and that of others) in this area highlights an interesting interplay between algorithms, communication complexity, and what physicist's call "non-locality" in the setting of quantum information.

Richard Cleve obtained his Ph.D. from the University of Toronto in 1989, working in cryptography and computational complexity. He was a Postdoctoral Fellow at Berkeley's International Computer Science Institute during 1988-90 and has been a faculty member at the University of Calgary since 1990, where he was promoted to Professor in 2000 and awarded a University Professorship in 2002. In recent years, his work has been focused on quantum algorithms and quantum information theory. He played a major role in the development of quantum communication complexity, and, most recently, he helped develop a new class of algorithms based on the behavior of quantum walks (which are quantum analogs of classical random walks).

In 2001 he held a Killam Resident Fellowship, and in 2002 he was appointed as a Fellow of the CIAR Program on Quantum Information Processing. He is also a Founding Managing Editor of the journal Quantum Information & Computation.