Harry Buhrman

Cited by

	All	Since 2019
Citations	11793	4398
h-index	49	26
i10-index	122	57

880

440

220

660

1993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202439 34 34 48 42 118 130 188 206 183 299 260 293 346 383 354 363 315 383 376 442 518 429 530 379 527 602 687 644 762 823 876

Public access

View all

15 articles

0 articles

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
Jaap-Henk HoepmanAssociate Professor of Computer Science, Radboud University NijmegenVerified email at cs.ru.nl
John WatrousIBM QuantumVerified email at ibm.com

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	1357	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	976	2001
Complexity measures and decision tree complexity: a survey H Buhrman, R De Wolf Theoretical Computer Science 288 (1), 21-43, 2002	742	2002
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	713	2018
Nonlocality and communication complexity H Buhrman, R Cleve, S Massar, R De Wolf Reviews of modern physics 82 (1), 665-698, 2010	627	2010
Substituting quantum entanglement for communication R Cleve, H Buhrman Physical Review A 56 (2), 1201, 1997	555	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	511	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	412	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	223	2014
Quantum entanglement and communication complexity H Buhrman, R Cleve, W Van Dam SIAM Journal on Computing 30 (6), 1829-1841, 2001	217	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	191*	2006
Quantum verification of matrix products H Buhrman, R Spalek arXiv preprint quant-ph/0409035, 2004	191	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	175	1999
Communication complexity lower bounds by polynomials H Buhrman, R de Wolf Proceedings 16th Annual IEEE Conference on Computational Complexity, 120-130, 2001	159	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	152	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	125	2007
Nonrelativizing separations H Buhrman, L Fortnow, T Thierauf Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity …, 1998	121	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	115	2001
Robust polynomials and quantum algorithms H Buhrman, I Newman, H Rohrig, R de Wolf Theory of Computing Systems 40, 379-395, 2007	102*	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