Richard Erwin Cleve
Alma materUniversity of Waterloo
University of Toronto
AwardsCAP-CRM Prize in Theoretical and Mathematical Physics
Scientific career
FieldsComputer science
InstitutionsUniversity of Calgary
University of Waterloo
Institute for Quantum Computing
Perimeter Institute for Theoretical Physics
Doctoral advisorCharles Rackoff

Richard Erwin Cleve is a Canadian professor of computer science at the David R. Cheriton School of Computer Science at the University of Waterloo, where he holds the Institute for Quantum Computing Chair in quantum computing, and an associate member of the Perimeter Institute for Theoretical Physics.[1]

Education

He obtained his BMath and MMath from the University of Waterloo,[2] and his Ph.D. in 1989 at the University of Toronto under the supervision of Charles Rackoff.[3]

Research

He was the recipient of the 2008 CAP-CRM Prize in Theoretical and Mathematical Physics, awarded for "fundamental results in quantum information theory, including the structure of quantum algorithms and the foundations of quantum communication complexity."[4] He has authored several highly cited papers in quantum information,[5][6][7] and is one of the creators of the field of quantum communication complexity.[4][8] He is also one of the founding managing editors of the journal Quantum Information & Computation,[9] a founding fellow of the Quantum Information Processing program at the Canadian Institute for Advanced Research, and a Team Leader at QuantumWorks.[4]

References

  1. ↑ Richard Cleve at the IQC directory.
  2. ↑ Richard Cleve at the University of Waterloo website.
  3. ↑ Richard Cleve at the Mathematics Genealogy Project.
  4. 1 2 3 2008 CAP/CRM Prize in Theoretical and Mathematical Physics
  5. ↑ Barenco, Adriano; Charles H. Bennett; Richard Cleve; David P. DiVincenzo; Norman Margolus; Peter Shor; Tycho Sleator; John A. Smolin; Harald Weinfurter (1995-11-01). "Elementary gates for quantum computation". Physical Review A. 52 (5): 3457–3467. arXiv:quant-ph/9503016. Bibcode:1995PhRvA..52.3457B. doi:10.1103/PhysRevA.52.3457. PMID 9912645. S2CID 8764584. Retrieved 2009-08-18.
  6. ↑ Childs, Andrew M.; Richard Cleve; Enrico Deotto; Edward Farhi; Sam Gutmann; Daniel A. Spielman (2003). "Exponential algorithmic speedup by a quantum walk". Proceedings of the thirty-fifth annual ACM symposium on Theory of computing. San Diego, CA, USA: ACM. pp. 59–68. arXiv:quant-ph/0209131. doi:10.1145/780542.780552. ISBN 1-58113-674-9. Retrieved 2009-08-18.
  7. ↑ Beals, Robert; Harry Buhrman; Richard Cleve; Michele Mosca; Ronald de Wolf (2001). "Quantum lower bounds by polynomials". J. ACM. 48 (4): 778–797. arXiv:quant-ph/9802049. doi:10.1145/502090.502097. Retrieved 2009-08-18.
  8. ↑ Buhrman, Harry; Richard Cleve; Avi Wigderson (1998). "Quantum vs. classical communication and computation". Proceedings of the thirtieth annual ACM symposium on Theory of computing. Dallas, Texas, United States: ACM. pp. 63–68. arXiv:quant-ph/9802040. doi:10.1145/276698.276713. ISBN 0-89791-962-9. Retrieved 2009-08-18.
  9. ↑ List of editors of Quantum Information & Computation


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.