Harry Buhrman

from Wikipedia, the free encyclopedia

Harry Buhrman (* 1966 in Amsterdam ) is a Dutch computer scientist who deals with quantum informatics .

Buhrman received his doctorate in computer science ( Resource bounded reductions ) in 1993 from the University of Amsterdam with Steven Elliot Homer (and Peter van Emde Boas ). He has been Professor of Computer Science at the University of Amsterdam since 2001 and group leader at the Centrum Wiskunde & Informatica (CWI) since 1994 , where he founded and heads the Dutch research center for quantum computer software QuSoft in 2015 .

He is one of the founders of the complexity theory for quantum communication (or distributed quantum computing) and showed for the first time that some communication problems in quantum computing can be overcome exponentially faster. Quantum entanglement cannot be used to communicate faster, but it can sometimes exponentially reduce the computational effort required to communicate. Together with Ronald de Wolf (CWI), he showed that quantum computers are no more efficient than classical computers for most problems (with the quantum polynomial method they developed), and on the other hand, he showed with de Wolf that they are much more efficient for some problems are (like the determination of quantum fingerprints). Buhrman also showed the limits of the application possibilities of position-based quantum cryptography .

In 2017 he is one of the authors of the European Quantum Technologies Roadmap (section Software with Acin).

Buhrman received a Vici Award from the Dutch research organization NWO in 2005 . In 2020 he was elected to the Royal Netherlands Academy of Sciences .

As a student he was a guitarist in a pop band (The Exist).

Fonts (selection)

  • with Richard Cleve, Avi Wigderson : Quantum vs. Classical Communication and Computation, 30. STOC 1998, Arxiv
  • with Richard Cleve, John Watrous, Ronald de Wolf: Quantum fingerprinting, Physical Review Letters, Volume 87, 2001, p. 167902, Arxiv
  • with Richard Cleve, Wim van Dam: Quantum Entanglement and Communication Complexity, SIAM J. Comput., Volume 30, 2001, pp. 1829-1841, Arxiv
  • with Richard Cleve, Serge Massar, Ronald de Wolf: Nonlocality and communication complexity, Rev. Mod.Phys., Volume 82, 2010, p. 665, Arxiv
  • with Nishanth Chadran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrosky, Christian Schaffner: Position-based quantum cryptography: impossibility and constructions, SIAM Journal on Computing, Volume 43, 2014, pp. 150–178, Arxiv
  • with Łukasz Czekaj, Andrzej Grudka, Michał Horodecki, Paweł Horodecki, Marcin Markiewicz, Florian Speelman, Sergii Strelchuk: Quantum communication complexity advantage implies violation of a Bell inequality, Proceedings of the National Academy of Sciences of the United States, Volume 113, 2016, Pp. 3191-3196, Arxiv
  • with M. Christandl, C. Perry, J. Zuiddam: Clean quantum and classical communication protocols, Physical Review Letters, Volume 117, 2016, p. 230503, Arxiv

Web links

Individual evidence

  1. ↑ Date of birth according to Amsterdam Science Magazine, 2017, No. 6, p. 10 (interview)
  2. ↑ Harry Buhrman in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
  3. ↑ R. Beals, H. Buhrman, R. Cleve, M. Mosca, R. de Wolf, Quantum lower bounds by polynomials, FOCS 1998, Arxiv
  4. ↑ Possibilities and Limitations of Quantum Computing , Ercim News, January 2004 (Cor Baayen Award for Ronald de Wolf)
  5. ↑ Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner: Position-Based Quantum Cryptography: Impossibility and Constructions, Arxiv 2010
  6. ↑ Arxiv 2017
  7. ↑ Quantum Technology Roadmap
personal data
SURNAME Buhrman, Harry
BRIEF DESCRIPTION Dutch computer scientist
DATE OF BIRTH 1966
PLACE OF BIRTH Amsterdam