Richard Cleve

from Wikipedia, the free encyclopedia

Richard Erwin Alexander Cleve (* 1960 ) is a Canadian computer scientist who specializes in quantum information theory.

Cleve studied at the University of Waterloo , where he received his bachelor's and master's degrees, and received his PhD in 1989 under Charles Rackoff at the University of Toronto ( Methodologies for Designing Block Ciphers and Cryptographic Protocols ). As a post-doctoral student he was at the International Computer Science Institute in Berkeley. From 1990 he was at the University of Calgary , where he received a full professorship in 2000. From 2004 he was a professor at the University of Waterloo.

He is a pioneer in quantum communication complexity theory. With Harry Buhrman , he realized that quantum information systems, because of their non-local nature, can reduce communication complexity and costs in distributed systems. He also made important contributions to quantum algorithms, including novel forms such as Quantum Walk.

In 2008 he received the CAP-CRM Prize . He is a Fellow of the Royal Society of Canada (2010).

Fonts (selection)

  • Adriano Barenco, Charles H. Bennett ; Richard Cleve, David DiVincenzo , Norman Margolus, Peter Shor , Tycho Sleator, John A. Smolin, Harald Weinfurter : Elementary gates for quantum computation, Physical Review A, Volume 52, 1995, pp. 3457-3467. Arxiv
  • H. Buhrman, R. Cleve, Avi Wigderson : Quantum vs. classical communication and computation. Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), 1998, pp. 63-68, Arxiv
  • R. Cleve, Artur Ekert , C. Macchiavello, M. Mosca: Quantum algorithms revisited, Proc. Roy. Soc. A, Vol. 454, 1998, pp. 339-354, Arxiv
  • R. Beals, H. Buhrman, R. Cleve, M. Mosca, R. de Wolf: Quantum lower bounds by polynomials. Journal of the ACM, Volume 48, 2001, pp. 778-797, Arxiv
  • AM Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, DA Spielman : Exponential algorithmic speedup by a quantum walk. Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), 2003, pp. 59-68, Arxiv
  • R. Cleve, P. Hoyer, B. Toner, J. Watrous: Consequences and limits of nonlocal strategies. Proceedings of the 19th IEEE Conference on Computational Complexity, 2004, pp. 236-249, Arxiv
  • R. Cleve, D. Gottesman, Michele Mosca , R. Somma, D. Yonge-Mallo: Efficient discrete-time simulations of continuous-time quantum query algorithms, Proceedings of the 41st annual ACM Symposium on Theory of Computing (STOC), 2009 , Pp. 409-416, Arxiv
  • Harry Buhrman, R. Cleve, S. Massar, Ronald de Wolf : Nonlocality and communication complexity, Reviews of Modern Physics, Volume 82, 2010, pp. 665-698, Arxiv

Web links

Individual evidence

  1. ↑ Richard Cleve in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
personal data
SURNAME Cleve, Richard
ALTERNATIVE NAMES Cleve, Richard Erwin Alexander
BRIEF DESCRIPTION Canadian computer scientist
DATE OF BIRTH 1960