Ashwin Nayak - Google Scholar Citations

Cited by

	All	Since 2014
Citations	2726	1177
h-index	25	18
i10-index	31	26

240

120

180

19981999200020012002200320042005200620072008200920102011201220132014201520162017201820198 9 24 43 68 63 84 87 90 120 158 118 146 167 163 171 207 179 163 193 205 229

Co-authors

Frédéric MagniezCNRSVerified email at irif.fr
Miklos SanthaSenior researcher in Computer Science, CNRS Paris and CQT SingaporeVerified email at liafa.univ-paris-diderot.fr
Andris AmbainisProfessor, University of LatviaVerified email at lu.lv
Rahul JainAssociate Professor, Computer Science, NUSVerified email at comp.nus.edu.sg
Hartmut KlauckAssistant Professor of Mathematics, Nanyang Technological UniversityVerified email at ntu.edu.sg
John WatrousUniversity of WaterlooVerified email at cs.uwaterloo.ca
David ZuckermanProfessor of Computer Science, University of Texas at AustinVerified email at cs.utexas.edu
Jérémie RolandQuIC - ULB - Ecole polytechnique de BruxellesVerified email at ulb.ac.be
Tzu-Chieh WeiCN Yang Institute for Theoretical Physics and Department of Physics and Astronomy, Stony Brook UniversityVerified email at stonybrook.edu
Julia SalzmanAssistant Professor, Stanford UniversityVerified email at stanford.edu
O MoussaPostdoctoral fellow, University of WaterlooVerified email at iqc.ca
Jonathan BaughAssociate Professor, University of WaterlooVerified email at uwaterloo.ca
r laflammeInstitute for Quantum Computing and Physics & Astro Dept, U of Waterloo and Perimeter InstituteVerified email at iqc.ca
Colm RyanRigetti ComputingVerified email at colmryan.org
Alain TappUdeM, MILA, DIRO, CRM, IVADO, RALI, LITQ, Université de MontréalVerified email at iro.umontreal.ca
Peter C. RichterDepartment of Computer Science, Rutgers UniversityVerified email at cs.rutgers.edu
Jamie SikoraPerimeter InstituteVerified email at perimeterinstitute.ca
Falk UngerVerified email at eecs.berkeley.edu
Gilles BrassardProfessor of computer science, Université de MontréalVerified email at iro.umontreal.ca
Uri ZwickTel Aviv UniversityVerified email at tau.ac.il

Ashwin Nayak

University of Waterloo

Verified email at uwaterloo.ca - Homepage

Quantum Computation Quantum Information Theoretical Computer Science


Title	Cited by	Year
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	477	2001
Optimal lower bounds for quantum automata and random access codes A Nayak 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999	279	1999
Search via quantum walk F Magniez, A Nayak, J Roland, M Santha SIAM journal on computing 40 (1), 142-164, 2011	273	2011
Quantum walk on the line A Nayak, A Vishwanath arXiv preprint quant-ph/0010117, 2000	201	2000
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	196	2002
The quantum query complexity of approximating the median and related statistics A Nayak, F Wu Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999	124	1999
Experimental implementation of heat-bath algorithmic cooling using solid-state nuclear magnetic resonance J Baugh, O Moussa, CA Ryan, A Nayak, R Laflamme Nature 438 (7067), 470-473, 2005	122	2005
Dense quantum coding and a lower bound for 1-way quantum automata A Ambainis, A Nayak, A Ta-Shma, U Vazirani Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999	121	1999
Comment on" Probabilistic Quantum Memories" T Brun, H Klauck, A Nayak, M Rotteler, C Zalka Physical review letters 91 (20), 209801-209801, 2003	103*	2003
Quantum complexity of testing group commutativity F Magniez, A Nayak Algorithmica 48 (3), 221-232, 2007	96	2007
Interaction in quantum communication and the complexity of set disjointness H Klauck, A Nayak, A Ta-Shma, D Zuckerman Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001	73	2001
On the hitting times of quantum versus random walks F Magniez, A Nayak, PC Richter, M Santha Algorithmica 63 (1-2), 91-116, 2012	72	2012
On the hitting times of quantum versus random walks F Magniez, A Nayak, PC Richter, M Santha Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 86--95, 2009	72	2009
Recognizing well-parenthesized expressions in the streaming model F Magniez, C Mathieu, A Nayak Proceedings of the forty-second ACM symposium on Theory of computing, 261-270, 2010	53*	2010
Bit-commitment-based quantum coin flipping A Nayak, P Shor Physical Review A 67 (1), 012304, 2003	50	2003
Direct product theorems for classical communication complexity via subdistribution bounds R Jain, H Klauck, A Nayak Proceedings of the fortieth annual ACM symposium on Theory of computing, 599-608, 2008	40	2008
Interaction in quantum communication H Klauck, A Nayak, A Ta-Shma, D Zuckerman IEEE Transactions on Information Theory 53 (6), 1970-1982, 2007	40	2007
Interacting boson problems can be QMA hard TC Wei, M Mosca, A Nayak Physical review letters 104 (4), 040501, 2010	38	2010
Spatial codes and the hardness of string folding problems A Nayak, A Sinclair, U Zwick Journal of Computational Biology 6 (1), 13-36, 1999	36	1999
Limits on the ability of quantum states to convey classical messages A Nayak, J Salzman Journal of the ACM (JACM) 53 (1), 184-206, 2006	32	2006

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