Harry Buhrman is a prominent Dutch computer scientist known for his work in theoretical computer science, particularly in quantum computing, algorithmic complexity, and information theory. He has made significant contributions to understanding the power and limits of quantum computers compared to classical computing. Buhrman has also been involved in various academic and research activities, including affiliations with institutions such as the University of Amsterdam and the Centrum Wiskunde & Informatica (CWI) in the Netherlands.
Articles by others on the same topic
Harry Buhrman coauthored Complexity Measures and Decision Tree Complexity: A Survey by Harry Buhrman and Ronald de Wolf. The survey relates measures of Boolean-function complexity, including deterministic and randomized decision-tree queries, certificate size and quantum query complexity. These comparisons separate how a function is represented from how much information an algorithm must inspect to compute it.[ref]