Harry Buhrman

Citeras av

	Alla	Sedan 2020
Citat	12330	4301
h-index	49	26
i10-index	128	57

1300

650

325

975

19931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202539 34 34 48 41 121 131 186 212 185 300 265 304 339 376 351 374 318 381 382 444 522 430 530 382 530 597 691 654 737 785 1206 224

Offentlig åtkomst

Visa alla

18 artiklar

0 artiklar

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

Medförfattare

Ronald de WolfCWI and University of AmsterdamVerifierad e-postadress på cwi.nl
Richard CleveInstitute for Quantum Computing, University of WaterlooVerifierad e-postadress på uwaterloo.ca
Lance FortnowIllinois Institute of TechnologyVerifierad e-postadress på iit.edu
Leen TorenvlietILLC University of Amsterdam (retired)Verifierad e-postadress på uva.nl
Florian SpeelmanUniversity of Amsterdam, QuSoftVerifierad e-postadress på uva.nl
Michal KouckyCharles University, PragueVerifierad e-postadress på iuuk.mff.cuni.cz
Paul VitanyiCWI and University of AmsterdamVerifierad e-postadress på cwi.nl
Matthias ChristandlUniversity of CopenhagenVerifierad e-postadress på math.ku.dk
Bruno LoffLASIGE, Faculdade de Ciências da Universidade de LisboaVerifierad e-postadress på fc.up.pt
Christian SchaffnerUniversity of Amsterdam & QuSoftVerifierad e-postadress på uva.nl
Falk UngerVerifierad e-postadress på eecs.berkeley.edu
Jop BriëtCWIVerifierad e-postadress på cwi.nl
Serge MassarUniversité libre de BruxellesVerifierad e-postadress på ulb.ac.be
Serge FehrCWIVerifierad e-postadress på cwi.nl
Ilan NewmanProfessor of Computer Science, University of HaifaVerifierad e-postadress på cs.haifa.ac.il
Eric AllenderRutgers UniversityVerifierad e-postadress på cs.rutgers.edu
Alain TappDIRO, Université de MontréalVerifierad e-postadress på iro.umontreal.ca
Gilles BrassardProfessor of computer science, Université de MontréalVerifierad e-postadress på iro.umontreal.ca
Wim van DamMicrosoftVerifierad e-postadress på microsoft.com
John WatrousIBM QuantumVerifierad e-postadress på ibm.com

Följ

Harry Buhrman

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

Verifierad e-postadress på quantinuum.com

Quantum Computing Complexity Theory Kolmogorov Complexity Computational Learning Theory


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
Quantum fingerprinting H Buhrman, R Cleve, J Watrous, R De Wolf Physical review letters 87 (16), 167902, 2001	1461	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	1016	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	775	2018
Complexity measures and decision tree complexity: a survey H Buhrman, R De Wolf Theoretical Computer Science 288 (1), 21-43, 2002	768	2002
Nonlocality and communication complexity H Buhrman, R Cleve, S Massar, R De Wolf Reviews of modern physics 82 (1), 665-698, 2010	651	2010
Substituting quantum entanglement for communication R Cleve, H Buhrman Physical Review A 56 (2), 1201, 1997	572	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	518	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	414	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	222	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	198*	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	178	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	156	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	127	2007
Nonrelativizing separations H Buhrman, L Fortnow, T Thierauf Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity …, 1998	126	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	116	2001
Distributed quantum computing H Buhrman, H Röhrig International Symposium on Mathematical Foundations of Computer Science, 1-20, 2003	112	2003

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Följ

Citeras av

Medförfattare