Formal name: Prof.dr. H.M. Buhrman
Function: Group leader, Scientific Staff Member
Email: Harry.Buhrman@cwi.nl
Telephone: +31(0)20 592 4076
Room: L233
Research groups: Algorithms and Complexity
Research
Harry Buhrman is head of the research group ‘Algorithms and Complexity’ at the Centrum Wiskunde & Informatica, which he joined in 1994. Since 2000 he also has a joined appointment as full professor of computer science at the University of Amsterdam. Buhrman's research focuses on quantum computing, algorithms, complexity theory, and computational biology. In 2003 he obtained a prestigious Vici-award and was coordinator of several national and international projects. The unifying theme through the work of Buhrman is the development of new algorithms and protocols, as well as establishing their optimality.
One of the highlights in the work of Buhrman is the article co-authored with Richard Cleve (University of Waterloo, Canada) ‘Quantum Entanglement and Communication Complexity’. They demonstrated that with quantum entanglement certain communication tasks can be solved more efficiently. This article formed the basis for the area of quantum communication complexity and has implications to fundamental questions in physics. He also co-developed a general method to establish the limitations of quantum computers. He wrote more than 100 scientific publications.
Buhrman is editor of several international journals and is member of various advisory and scientific boards, such as the advisory board of the Institute for Quantum Computing (Waterloo, Canada).
Career
| 2013 - | Scientific staff member A&C - Algorithms and complexity |
| 2013 - | Group leader A&C - Algorithms and complexity |
| 2010 - 2013 | Group leader PNA6 - Algorithms and Complexity |
| 2003 - 2009 | Group leader INS4 - Quantum Computing and Advanced Systems Research |
| 2000 - | Full professor University of Amsterdam |
| 1997 - 2002 | Scientific staff member INS4 - Quantum Computing and Advanced Systems Research |
Selected Awards and Honours
| 2005 | Vici Innovational Research Grant NWO |
Selected Academic Activities
| 2008 | Member program committee Philadelphia, PA, USA - Annual IEEE Symposium on Foundations of Computer Science - [FOCS] |
| 2007 - | Member advisory board Canadian Institute for Advanced Research - [CIFAR] - Quantum Information Prosessing |
| 2007 - | Editor Journal: ACM Transactions on Computation Theory - [TOCT] |
| 2006 - | Member general board Quantum Information Processing and Communication in Europe - [Qurope] |
| 2006 - | Member advisory board Institute for Quantum Computing Waterloo - [IQC] |
| 2005 | Member program committee Annual ACM Symposium on Theory of Computing - [STOC] |
| 2005 - | Editor Journal: Theory of Computing Systems - [TOCS] |
| 2005 - | Editor Journal: Computational Complexity |
| 2005 - | Chair program committee Lorentz Center, Leiden, The Netherlands - Computer Sciences |
Selected Publications
| H. Buhrman, R. Cleve, S. Massar, R. de Wolf. Nonlocality and communication complexity. Reviews of Modern Physics 82, 665–698, 2010. |
| H. Buhrman, J.M. Hitchcock. NP-hard sets are exponentially dense unless coNP C NP/poly. IEEE Conference on Computational Complexity, 1–7, 2008. |
| H. Buhrman, R. Spalek. Quantum verification of matrix products. Proceedings of ACM-SIAM Symposium on Discrete Algorithms 2006 (17), 880–889, 2006. |
| H. Buhrman, M. Christandl, P. Hayden, H. Lo, S.D.C. Wehner. Security of quantum bit string commitment depends on the information measure. Physical Review Letters 97, 250501, 2006. |
| G. Brassard, H. Buhrman, N. Linden, A.A. Methot, A. Tapp, F.P. Unger. Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial. Physical Review Letters 96, 2006. |
| H. Buhrman, R. Cleve, M. Laurent, N. Linden, A. Schrijver, F.P. Unger. New limits on fault-tolerant quantum computation. Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, Ca, USA, 411–419, 2006. |
