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 became a faculty member at the University of Calgary in 1990, where he was promoted to Full Professor in 2000. In 2001, he held a Killam Resident Fellowship, and in 2002 he was honoured with the title University Professor. In 2004, Dr. Cleve moved to the University of Waterloo's School of Computer Science, and also became a member of the Institute for Quantum Computing in Waterloo. He is a Founding Managing Editor of the journal, Quantum Information & Computation. Quantum information can be used to perform a variety of feats that cannot be accomplished with classical information. For example, there is a quantum algorithm that can factorize integers very quickly (in polynomial time), whereas all known conventional algorithms require an enormous (exponential) amount of time to do this. Quantum information can also exhibit "non-local" behaviour, whereby two (or more) quantum systems that are physically separated exhibit a collective behaviour that cannot occur with classical systems, unless communication occurs between them. Professor Cleve realized that non-local behaviour was intimately connected to a class of computational problems involving distributed systems in which the primary resource under consideration is the amount of communication that occurs between processors. Building on this insight, he was the first (with Harry Buhrman) to show that quantum information can reduce "communication complexity" costs in distributed systems. Since then he has played a major role in the development of the rich and lively area of quantum communication complexity. Professor Cleve has also made several contributions to the fascinating and important theory of quantum algorithms. These include simplifications and efficiency improvements to existing quantum algorithms, results that establish limits on the power quantum algorithms, and the development of novel algorithmic paradigms. He has recently helped develop a new class of algorithms based on the behaviour of quantum walks (which are quantum analogs of classical random walks).