Richard Cleve
Richard Erwin Cleve | |
|---|---|
| Alma mater | University of Waterloo University of Toronto |
| Scientific career | |
| Fields | Computer science |
| Institutions | University of Calgary University of Waterloo Institute for Quantum Computing Perimeter Institute for Theoretical Physics |
| Doctoral advisor | Charles Rackoff |
Richard Erwin Cleve is a 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
- ^ Richard Cleve at the IQC directory.
- ^ Richard Cleve at the University of Waterloo website.
- ^ Richard Cleve at the Mathematics Genealogy Project.
- ^ a b c 2008 CAP/CRM Prize in Theoretical and Mathematical Physics
- ^ Barenco, Adriano (1995-11-01). "Elementary gates for quantum computation". Physical Review A. 52 (5): 3457–3467. doi:10.1103/PhysRevA.52.3457. PMID 9912645. Retrieved 2009-08-18.
{{cite journal}}: Unknown parameter|coauthors=ignored (|author=suggested) (help) - ^ Childs, Andrew M. (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. doi:10.1145/780542.780552. ISBN 1-58113-674-9. Retrieved 2009-08-18.
{{cite conference}}: Unknown parameter|booktitle=ignored (|book-title=suggested) (help); Unknown parameter|coauthors=ignored (|author=suggested) (help) - ^ Beals, Robert; Harry Buhrman; Richard Cleve; Michele Mosca; Ronald de Wolf (2001). "Quantum lower bounds by polynomials". J. ACM. 48 (4): 778–797. doi:10.1145/502090.502097. Retrieved 2009-08-18.
- ^ 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. doi:10.1145/276698.276713. ISBN 0-89791-962-9. Retrieved 2009-08-18.
{{cite conference}}: Unknown parameter|booktitle=ignored (|book-title=suggested) (help) - ^ List of editors of Quantum Information & Computation
.svg){kind=small}   | This article about a Canadian scientist is a stub. You can help Wikipedia by expanding it. |