Harry Buhrman

Cited by

	All	Since 2020
Citations	12196	4192
h-index	49	25
i10-index	128	57

1200

600

300

900

19931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202540 34 34 48 41 118 129 191 206 184 300 260 294 347 383 354 363 315 383 375 443 522 429 527 381 526 603 688 648 757 806 1191 96

Public access

View all

17 articles

1 article

available

not available

Based on funding mandates

Co-authors

Ronald de WolfCWI and University of AmsterdamVerified email at cwi.nl
Richard CleveInstitute for Quantum Computing, University of WaterlooVerified email at uwaterloo.ca
Lance FortnowIllinois Institute of TechnologyVerified email at iit.edu
Leen TorenvlietILLC University of Amsterdam (retired)Verified email at uva.nl
Florian SpeelmanUniversity of Amsterdam, QuSoftVerified email at uva.nl
Michal KouckyCharles University, PragueVerified email at iuuk.mff.cuni.cz
Paul VitanyiCWI and University of AmsterdamVerified email at cwi.nl
Matthias ChristandlUniversity of CopenhagenVerified email at math.ku.dk
Bruno LoffLASIGE, Faculdade de Ciências da Universidade de LisboaVerified email at fc.up.pt
Falk UngerVerified email at eecs.berkeley.edu
Christian SchaffnerUniversity of Amsterdam & QuSoftVerified email at uva.nl
Jop BriëtCWIVerified email at cwi.nl
Serge MassarUniversité libre de BruxellesVerified email at ulb.ac.be
Serge FehrCWIVerified email at cwi.nl
Ilan NewmanProfessor of Computer Science, University of HaifaVerified email at cs.haifa.ac.il
Eric AllenderRutgers UniversityVerified email at cs.rutgers.edu
Alain TappDIRO, Université de MontréalVerified email at iro.umontreal.ca
Wim van DamMicrosoftVerified email at microsoft.com
John WatrousIBM QuantumVerified email at ibm.com
Jaap-Henk HoepmanAssociate Professor of Computer Science, Radboud University NijmegenVerified email at cs.ru.nl

Harry Buhrman

Chief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoft

Verified email at quantinuum.com

Quantum Computing Complexity Theory Kolmogorov Complexity Computational Learning Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Quantum fingerprinting H Buhrman, R Cleve, J Watrous, R De Wolf Physical review letters 87 (16), 167902, 2001	1438	2001
Quantum lower bounds by polynomials R Beals, H Buhrman, R Cleve, M Mosca, R De Wolf Journal of the ACM (JACM) 48 (4), 778-797, 2001	1001	2001
The quantum technologies roadmap: a European community view A Acín, I Bloch, H Buhrman, T Calarco, C Eichler, J Eisert, D Esteve, ... New Journal of Physics 20 (8), 080201, 2018	764	2018
Complexity measures and decision tree complexity: a survey H Buhrman, R De Wolf Theoretical Computer Science 288 (1), 21-43, 2002	761	2002
Nonlocality and communication complexity H Buhrman, R Cleve, S Massar, R De Wolf Reviews of modern physics 82 (1), 665-698, 2010	645	2010
Substituting quantum entanglement for communication R Cleve, H Buhrman Physical Review A 56 (2), 1201, 1997	565	1997
Quantum vs. classical communication and computation H Buhrman, R Cleve, A Wigderson Proceedings of the thirtieth annual ACM symposium on Theory of computing, 63-68, 1998	516	1998
Limit on nonlocality in any world in which communication complexity is not trivial G Brassard, H Buhrman, N Linden, AA Méthot, A Tapp, F Unger Physical Review Letters 96 (25), 250401, 2006	420	2006
Position-based quantum cryptography: Impossibility and constructions H Buhrman, N Chandran, S Fehr, R Gelles, V Goyal, R Ostrovsky, ... SIAM Journal on Computing 43 (1), 150-178, 2014	235	2014
Quantum entanglement and communication complexity H Buhrman, R Cleve, W Van Dam SIAM Journal on Computing 30 (6), 1829-1841, 2001	219	2001
Power from random strings E Allender, H Buhrman, M Koucký, D Van Melkebeek, D Ronneburger SIAM Journal on Computing 35 (6), 1467-1493, 2006	194*	2006
Quantum verification of matrix products H Buhrman, R Spalek arXiv preprint quant-ph/0409035, 2004	192	2004
Bounds for small-error and zero-error quantum algorithms H Buhrman, R Cleve, R De Wolf, C Zalka 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999	176	1999
Communication complexity lower bounds by polynomials H Buhrman, R de Wolf Proceedings 16th Annual IEEE Conference on Computational Complexity, 120-130, 2001	161	2001
Are bitvectors optimal? H Buhrman, PB Miltersen, J Radhakrishnan, S Venkatesh Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000	154	2000
Multiparty quantum communication complexity H Buhrman, W van Dam, P Høyer, A Tapp Physical Review A 60 (4), 2737, 1999	152	1999
On computation and communication with small bias H Buhrman, N Vereshchagin, R de Wolf Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 24-32, 2007	126	2007
Nonrelativizing separations H Buhrman, L Fortnow, T Thierauf Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity …, 1998	122	1998
Quantum algorithms for element distinctness H Buhrman, C Durr, M Heiligman, P Hoyer, F Magniez, M Santha, ... Proceedings 16th Annual IEEE Conference on Computational Complexity, 131-137, 2001	117	2001
Robust polynomials and quantum algorithms H Buhrman, I Newman, H Rohrig, R de Wolf Theory of Computing Systems 40, 379-395, 2007	105*	2007

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors