Harry Buhrman

Full Name: Prof.dr. H.M. Buhrman
Function(s): Group leader, Scientific Staff Member, Professor - Universiteit van Amsterdam

Email: Harry.Buhrman@cwi.nl
Telephone: +31 20 592 4076
Room: L233
Department(s): Algorithms and Complexity

Publications

Buhrman, H.M, Christandl, M, Koucky, M, Lotker, Z, Patt-Shamir, B, & Vereshchagin, N.K. (2020). High Entropy Random Selection Protocols. Algorithmica. doi:10.1007/s00453-020-00770-y
Bannink, T.R, Buhrman, H.M, Gilyén, A.P, & Szegedy, M. (2019). The interaction light cone of the discrete Bak–Sneppen, contact and other local processes. Journal of Statistical Physics, 1–26. doi:10.1007/s10955-019-02351-y
Bannink, T.R, Briët, J, Buhrman, H.M, Labib, F.S, & Lee, T. J. (2019). Bounding quantum-classical separations for classes of nonlocal games. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019) (pp. 12:1–12:11). doi:10.4230/LIPIcs.STACS.2019.12
Buhrman, H.M, Torenvliet, L, Unger, F.P, & Vereshchagin, N.K. (2018). Sparse Selfreducible Sets and Nonuniform Lower Bounds. Algorithmica, 1–22. doi:10.1007/s00453-018-0439-0
Buhrman, H.M, Christandl, M, & Zuiddam, J. (2017). Nondeterministic quantum communication complexity: The cyclic equality game and iterated matrix multiplication. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.ITCS.2017.24
Buhrman, H.M, Christandl, M, Perry, C, & Zuiddam, J. (2016). Clean quantum and classical communication protocols. Physical Review Letters, 117(230503), 230503‐1–230503‐5. doi:10.1103/PhysRevLett.117.230503
Brody, J, Buhrman, H.M, Koucky, M, Loff Barreto, B. S, Speelman, F, & Vereshchagin, N.K. (2016). Towards a Reverse Newman’s Theorem in interactive information complexity. Algorithmica, 76(3), 749–781. doi:10.1007/s00453-015-0112-9
Antunes, L.F, Buhrman, H.M, Matos, A, Souto, A, & Teixeira, A. (2016). Distinguishing two probability ensembles with one sample from each ensemble. Theory of Computing Systems, 59(3), 517–531. doi:10.1007/s00224-015-9661-1
Buhrman, H.M, Czekaj, L, Grudka, A, Horodecki, M, Horodecki, P, Markiewicz, M, … Strelchuk, S. (2016). Correction for Buhrman et al., Quantum communication complexity advantage implies violation of a Bell inequality. Proceedings of the National Academy of Sciences of the United States of America, 113(21). doi:10.1073/pnas.1606259113
Buhrman, H.M, Czekaj, L, Grudka, A, Horodecki, M, Horodecki, P, Markiewicz, M, … Strelchuk, S. (2016). Quantum communication complexity advantage implies violation of a Bell inequality. Proceedings of the National Academy of Sciences of the United States of America, 113(12), 3191–3196. doi:10.1073/pnas.1507647113

Current projects with external funding

Quantum Algorithms in a Practical Setting ()
Networks
Quantum Computing (PPS ABN AMRO Bank)
Quantum Software Consortium (QSC)
Research centre for quantum software (QUSOFT)

Professional activities

Professor: Universiteit van Amsterdam [UvA]
Committee member: European Science Foundation - Forward Look (NSIT)
Committee member: Lorentz Center, Leiden, The Netherlands - Computer Sciences
Board Member: Canadian Institute for Advanced Research - [CIFAR] - Quantum Information Processing
Board Member: Institute for Quantum Computing Waterloo - [IQC]
Board Member: Quantum Information Processing and Communication in Europe - [Qurope]
Board Member: Dutch Research School in Logic - [OzsL]
Member: Dutch Graduate School Institute for Programming and Algorithmics - [IPA]
Board Member: Dutch Institute for Logic, Language, and Computation - [ILLC]
Board Member: Nederlandse Vereniging Theoretische Informatica - [NVTI]
Committee member: Workshop on Quantum Information Processing - [QIP]
Committee member: IEEE Conference on Computational Complexity - [CCC]
Committee member: Conference on Theory and Applications of Models of Computation - [TAMC]
Editor: Journal: ACM Transactions on Computation Theory - [TOCT]
Editor: Journal: Computational Complexity
Editor: Journal: Theory of Computing Systems - [TOCS]

Grants

Vici Innovational Research Grant NWO (2005)