Andris Ambainis - Google Scholar

Cited by

	All	Since 2015
Citations	9425	3950
h-index	45	32
i10-index	108	72

860

430

215

645

199920002001200220032004200520062007200820092010201120122013201420152016201720182019202069 79 124 176 187 249 312 368 393 419 379 513 419 475 550 512 532 631 603 694 855 629

Co-authors

Julia KempeCDS and Courant Institute, NYUVerified email at nyu.edu
Rusins FreivaldsProfessor of Computer Science, University of LatviaVerified email at mii.lu.lv
Alexander Rivoshresearcher at University of Latvia, Faculty of ComputingVerified email at lu.lv
Juris Smotrovsprofesors, Latvijas UniversitāteVerified email at sets.lv
Ronald de WolfCWI and University of AmsterdamVerified email at cwi.nl
Shigeru YamashitaRitsumeikan UniversityVerified email at cs.ritsumei.ac.jp
Ashwin NayakUniversity of WaterlooVerified email at uwaterloo.ca
John WatrousUniversity of WaterlooVerified email at cs.uwaterloo.ca
Jānis IraidsResearcher, University of LatviaVerified email at lu.lv
Kaspars BalodisUniversity of LatviaVerified email at lu.lv
Robert SpalekundisclosedVerified email at ucw.cz
Todd BrunProfessor of Electrical Engineering, University of Southern CaliforniaVerified email at usc.edu
Krišjānis PrūsisResearcher, University of LatviaVerified email at lu.lv
Andrew M. ChildsJoint Center for Quantum Information and Computer Science, University of MarylandVerified email at umd.edu
Jevgēnijs VihrovsResearcher, University of LatviaVerified email at lu.lv
Rudy RaymondIBM Research - TokyoVerified email at jp.ibm.com
Arturs BackursToyota Technological Institute at ChicagoVerified email at ttic.edu
Akinori KawachiMie UniversityVerified email at cs.info.mie-u.ac.jp
Ben ReichardtUniversity of Southern CaliforniaVerified email at usc.edu
Shengyu Zhang（张胜誉）TencentVerified email at cse.cuhk.edu.hk

Andris Ambainis

Professor, University of Latvia

Verified email at lu.lv - Homepage

quantum algorithms quantum computing quantum information computational complexity theoretical computer science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Quantum walk algorithm for element distinctness A Ambainis SIAM Journal on Computing 37 (1), 210-239, 2007	778	2007
Quantum walks on graphs D Aharonov, A Ambainis, J Kempe, U Vazirani Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001	648*	2001
Quantum walks and their algorithmic applications A Ambainis International Journal of Quantum Information 1 (04), 507-518, 2003	594	2003
One-dimensional quantum walks A Ambainis, E Bach, A Nayak, A Vishwanath, J Watrous Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001	567*	2001
Quantum lower bounds by quantum arguments A Ambainis Journal of Computer and System Sciences 64 (4), 750-767, 2002	412	2002
Coins make quantum walks faster A Ambainis, J Kempe, A Rivosh arXiv preprint quant-ph/0402107, 2004	348*	2004
1-way quantum finite automata: strengths, weaknesses and generalizations A Ambainis, R Freivalds Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998	333	1998
Dense quantum coding and quantum finite automata A Ambainis, A Nayak, A Ta-Shma, U Vazirani Journal of the ACM (JACM) 49 (4), 496-511, 2002	309*	2002
Quantum search of spatial regions S Aaronson, A Ambainis 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003	261	2003
Upper bound on the communication complexity of private information retrieval A Ambainis International Colloquium on Automata, Languages, and Programming, 401-407, 1997	220	1997
Private quantum channels A Ambainis, M Mosca, A Tapp, R De Wolf Proceedings 41st Annual Symposium on Foundations of Computer Science, 547-553, 2000	210	2000
Two-way finite automata with quantum and classical states A Ambainis, J Watrous Theoretical Computer Science 287 (1), 299-311, 2002	204	2002
Quantum to classical transition for random walks TA Brun, HA Carteret, A Ambainis Physical review letters 91 (13), 130602, 2003	198	2003
Any AND-OR Formula of Size N Can Be Evaluated in Time on a Quantum Computer A Ambainis, AM Childs, BW Reichardt, R Špalek, S Zhang SIAM Journal on Computing 39 (6), 2513-2530, 2010	190	2010
Polynomial degree vs. quantum query complexity A Ambainis Journal of Computer and System Sciences 72 (2), 220-238, 2006	189	2006
Quantum walks driven by many coins TA Brun, HA Carteret, A Ambainis Physical Review A 67 (5), 052317, 2003	166	2003
Quantum random walks with decoherent coins TA Brun, HA Carteret, A Ambainis Physical Review A 67 (3), 032304, 2003	156	2003
Quantum search algorithms A Ambainis ACM SIGACT News 35 (2), 22-35, 2004	147	2004
A new protocol and lower bounds for quantum coin flipping A Ambainis Journal of Computer and System Sciences 68 (2), 398-416, 2004	137	2004
Polynomial degree and lower bounds in quantum complexity: Collision and element distinctness with small range A Ambainis Theory of Computing 1 (1), 37-46, 2005	113	2005

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

Upload PDF

Follow this author

Cited by

Co-authors