Andris Ambainis

Cited by

	All	Since 2020
Citations	14159	5097
h-index	54	34
i10-index	125	79

1300

650

325

975

19992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202570 84 147 170 203 243 319 376 439 443 411 525 429 483 560 529 541 664 615 695 842 829 886 926 1050 1269 134

Public access

View all

31 articles

1 article

available

not available

Based on funding mandates

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
Juris Smotrovsprofesors, Latvijas UniversitāteVerified email at sets.lv
Kaspars BalodisUniversity of LatviaVerified email at lu.lv
Jānis IraidsResearcher, University of LatviaVerified email at lu.lv
Alexander Rivoshresearcher at University of Latvia, Faculty of ComputingVerified email at lu.lv
Jevgēnijs VihrovsAssociate professor, University of LatviaVerified email at lu.lv
Ronald de WolfCWI and University of AmsterdamVerified email at cwi.nl
Krišjānis PrūsisResearcher, University of LatviaVerified email at lu.lv
Ashwin NayakUniversity of WaterlooVerified email at uwaterloo.ca
John WatrousIBM QuantumVerified email at ibm.com
Shigeru YamashitaRitsumeikan UniversityVerified email at cs.ritsumei.ac.jp
Robert SpalekundisclosedVerified email at ucw.cz
Todd BrunProfessor of Electrical Engineering, University of Southern CaliforniaVerified email at usc.edu
Andrew M. ChildsJoint Center for Quantum Information and Computer Science, University of MarylandVerified email at umd.edu
Rudy RaymondJPMorgan ChaseVerified email at jpmchase.com
Yasser OmarInstituto Superior Técnico, University of Lisbon & PQI – Portuguese Quantum InstituteVerified email at pqi.pt
Arturs BackursMicrosoft ResearchVerified email at microsoft.com
Akinori KawachiMie UniversityVerified email at cs.info.mie-u.ac.jp
Ashutosh RaiResearch Assistant Professor, Korea Advanced Institute of Science and Technology (KAIST), Daejeon.Verified email at kaist.ac.kr

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	1174	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	937*	2001
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	817*	2001
Quantum walks and their algorithmic applications A Ambainis International Journal of Quantum Information 1 (04), 507-518, 2003	794	2003
Quantum lower bounds by quantum arguments A Ambainis Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000	544	2000
Coins make quantum walks faster A Ambainis, J Kempe, A Rivosh arXiv preprint quant-ph/0402107, 2004	499*	2004
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	449*	2002
1-way quantum finite automata: strengths, weaknesses and generalizations A Ambainis, R Freivalds Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998	391	1998
Quantum search of spatial regions S Aaronson, A Ambainis 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003	337	2003
Private quantum channels A Ambainis, M Mosca, A Tapp, R De Wolf Proceedings 41st Annual Symposium on Foundations of Computer Science, 547-553, 2000	300	2000
Variable time amplitude amplification and quantum algorithms for linear algebra problems A Ambainis STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 636-647, 2012	263*	2012
Quantum search algorithms A Ambainis ACM SIGACT News 35 (2), 22-35, 2004	258	2004
Upper bound on the communication complexity of private information retrieval A Ambainis International Colloquium on Automata, Languages, and Programming, 401-407, 1997	256	1997
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	247	2010
Quantum to classical transition for random walks TA Brun, HA Carteret, A Ambainis Physical review letters 91 (13), 130602, 2003	239	2003
Quantum walks driven by many coins TA Brun, HA Carteret, A Ambainis Physical Review A 67 (5), 052317, 2003	237	2003
Two-way finite automata with quantum and classical states A Ambainis, J Watrous Theoretical Computer Science 287 (1), 299-311, 2002	237	2002
Polynomial degree vs. quantum query complexity A Ambainis Journal of Computer and System Sciences 72 (2), 220-238, 2006	234	2006
Spatial search by quantum walk is optimal for almost all graphs S Chakraborty, L Novo, A Ambainis, Y Omar Physical review letters 116 (10), 100501, 2016	200	2016
Quantum attacks on classical proof systems: The hardness of quantum rewinding A Ambainis, A Rosmanis, D Unruh 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 474-483, 2014	199	2014

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