Andris Ambainis

Cited by

	All	Since 2016
Citations	10308	4249
h-index	47	33
i10-index	110	73

860

430

215

645

1999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202166 72 127 180 185 247 307 378 403 428 394 516 419 480 556 518 541 644 590 684 785 860 680

Public access

View all

11 articles

0 articles

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
Alexander Rivoshresearcher at University of Latvia, Faculty of ComputingVerified email at lu.lv
Ronald de WolfCWI and University of AmsterdamVerified email at cwi.nl
Juris Smotrovsprofesors, Latvijas UniversitāteVerified email at sets.lv
Shigeru YamashitaRitsumeikan UniversityVerified email at cs.ritsumei.ac.jp
Kaspars BalodisUniversity of LatviaVerified email at lu.lv
Jānis IraidsResearcher, University of LatviaVerified email at lu.lv
Ashwin NayakUniversity of WaterlooVerified email at uwaterloo.ca
Robert SpalekundisclosedVerified email at ucw.cz
John WatrousUniversity of WaterlooVerified email at cs.uwaterloo.ca
Krišjānis PrūsisResearcher, University of LatviaVerified email at lu.lv
Jevgēnijs VihrovsResearcher, University of LatviaVerified email at lu.lv
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 RaymondIBM QuantumVerified 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	847	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	699*	2001
Quantum walks and their algorithmic applications A Ambainis International Journal of Quantum Information 1 (04), 507-518, 2003	645	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	621*	2001
Quantum lower bounds by quantum arguments A Ambainis Journal of Computer and System Sciences 64 (4), 750-767, 2002	439	2002
Coins make quantum walks faster A Ambainis, J Kempe, A Rivosh arXiv preprint quant-ph/0402107, 2004	384*	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	341*	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	336	1998
Quantum search of spatial regions S Aaronson, A Ambainis 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003	279	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	230	2000
Upper bound on the communication complexity of private information retrieval A Ambainis International Colloquium on Automata, Languages, and Programming, 401-407, 1997	219	1997
Two-way finite automata with quantum and classical states A Ambainis, J Watrous Theoretical Computer Science 287 (1), 299-311, 2002	209	2002
Quantum to classical transition for random walks TA Brun, HA Carteret, A Ambainis Physical review letters 91 (13), 130602, 2003	208	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	203	2010
Polynomial degree vs. quantum query complexity A Ambainis Journal of Computer and System Sciences 72 (2), 220-238, 2006	196	2006
Quantum walks driven by many coins TA Brun, HA Carteret, A Ambainis Physical Review A 67 (5), 052317, 2003	179	2003
Quantum random walks with decoherent coins TA Brun, HA Carteret, A Ambainis Physical Review A 67 (3), 032304, 2003	167	2003
Quantum search algorithms A Ambainis ACM SIGACT News 35 (2), 22-35, 2004	161	2004
A new protocol and lower bounds for quantum coin flipping A Ambainis Journal of Computer and System Sciences 68 (2), 398-416, 2004	153	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	128	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

Follow this author

Cited by

Co-authors