Andris Ambainis - Google Scholar Citations

Cited by

	All	Since 2014
Citations	8681	3756
h-index	43	31
i10-index	104	69

820

410

205

615

1997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201928 21 67 79 126 173 186 244 316 375 379 420 387 504 430 466 534 523 527 604 583 712 803

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
Ashwin NayakUniversity of WaterlooVerified email at uwaterloo.ca
John WatrousUniversity of WaterlooVerified email at cs.uwaterloo.ca
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 RaymondIBM Research - TokyoVerified email at jp.ibm.com
Kaspars BalodisUniversity of LatviaVerified email at lu.lv
Jānis IraidsResearcher, University of LatviaVerified email at lu.lv
Akinori KawachiOsaka UniversityVerified email at comm.eng.osaka-u.ac.jp
Krišjānis PrūsisResearcher, University of LatviaVerified email at lu.lv
Jevgēnijs VihrovsResearcher, University of LatviaVerified email at lu.lv
Ben ReichardtUniversity of Southern CaliforniaVerified email at usc.edu
Sanjay JainProfessor of Computer Science, National University of SingaporeVerified email at comp.nus.edu.sg
Ashvin VishwanathProfessor of Physics, Harvard UniversityVerified email at g.harvard.edu

Andris Ambainis

Professor, University of Latvia

Verified email at lu.lv - Homepage

quantum algorithms quantum computing quantum information computational complexity theoretical computer science


Title	Cited by	Year
Quantum walk algorithm for element distinctness A Ambainis SIAM Journal on Computing 37 (1), 210-239, 2007	713	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	602*	2001
Quantum walks and their algorithmic applications A Ambainis International Journal of Quantum Information 1 (04), 507-518, 2003	552	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	548*	2001
Quantum lower bounds by quantum arguments A Ambainis Journal of Computer and System Sciences 64 (4), 750-767, 2002	388	2002
Coins make quantum walks faster A Ambainis, J Kempe, A Rivosh Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005	319*	2005
1-way quantum finite automata: strengths, weaknesses and generalizations A Ambainis, R Freivalds Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998	319	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	281*	2002
Quantum search of spatial regions S Aaronson, A Ambainis 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003	249	2003
Upper bound on the communication complexity of private information retrieval A Ambainis International Colloquium on Automata, Languages, and Programming, 401-407, 1997	204	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	202	2000
Two-way finite automata with quantum and classical states A Ambainis, J Watrous Theoretical Computer Science 287 (1), 299-311, 2002	192	2002
Quantum to classical transition for random walks TA Brun, HA Carteret, A Ambainis Physical review letters 91 (13), 130602, 2003	186	2003
Polynomial degree vs. quantum query complexity A Ambainis Journal of Computer and System Sciences 72 (2), 220-238, 2006	177	2006
Any AND-OR formula of size N can be evaluated in time N^1/2+o(1) on a quantum computer A Ambainis, AM Childs, BW Reichardt, R Špalek, S Zhang SIAM Journal on Computing 39 (6), 2513-2530, 2010	174	2010
Quantum walks driven by many coins TA Brun, HA Carteret, A Ambainis Physical Review A 67 (5), 052317, 2003	157	2003
A new protocol and lower bounds for quantum coin flipping A Ambainis Journal of Computer and System Sciences 68 (2), 398-416, 2004	140	2004
Quantum random walks with decoherent coins TA Brun, HA Carteret, A Ambainis Physical Review A 67 (3), 032304, 2003	140	2003
Quantum search algorithms A Ambainis ACM SIGACT News 35 (2), 22-35, 2004	131	2004
The quantum communication complexity of sampling A Ambainis, LJ Schulman, A Ta-Shma, U Vazirani, A Wigderson SIAM Journal on Computing 32 (6), 1570-1585, 2003	109	2003

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