Harry Buhrman

Scientific Staff Member, Group leader, Professor

Full Name Prof.dr. H.M. Buhrman
Function(s) Scientific Staff Member, Group leader, Professor
Telephone +31 20 592 4076
Room L233
Department(s) 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 joint 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).

Selected Publications

  • H. Buhrman, R. Cleve, S. Massar, R. de Wolf, Nonlocality and communication complexity, American Physical Society, 665-698, 2010
  • H. Buhrman, J.M. Hitchcock, NP-hard sets are exponentially dense unless coNP C NP/poly, IEEE Computer Society, 1-7, 2008
  • H. Buhrman, R. Spalek, Quantum verification of matrix products, 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, American Physical Society, 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, American Physical Society, 2006
  • H. Buhrman, R. Cleve, M. Laurent, N. Linden, A. Schrijver, F.P. Unger, New limits on fault-tolerant quantum computation, IEEE Computer Society, 411-419, 2006

Projects

  • Position-Based Quantum Cryptography
  • QUSOFT
  • Networks
    Networks (eerste fase)