دنبال کردن
Ashwin Nayak
عنوان
نقل شده توسط
نقل شده توسط
سال
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‏
7392001
Search via quantum walk‏
F Magniez, A Nayak, J Roland, M Santha‏
SIAM journal on computing 40 (1), 142-164, 2011‏
521*2011
Optimal lower bounds for quantum automata and random access codes‏
A Nayak‏
40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999‏
3561999
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‏
3222002
Quantum walk on the line‏
A Nayak, A Vishwanath‏
arXiv preprint quant-ph/0010117, 2000‏
2762000
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‏
2001999
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‏
2001999
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‏
1682005
Comment on" Probabilistic Quantum Memories"‏
T Brun, H Klauck, A Nayak, M Rotteler, C Zalka‏
Physical review letters 91 (20), 209801-209801, 2003‏
164*2003
On the hitting times of quantum versus random walks‏
F Magniez, A Nayak, PC Richter, M Santha‏
Algorithmica 63 (1-2), 91-116, 2012‏
1202012
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‏
1202009
Quantum complexity of testing group commutativity‏
F Magniez, A Nayak‏
Algorithmica 48 (3), 221-232, 2007‏
1162007
Online learning of quantum states‏
S Aaronson, X Chen, E Hazan, S Kale, A Nayak‏
Advances in Neural Information Processing Systems, 8962-8972, 2018‏
1092018
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‏
792001
Bit-commitment-based quantum coin flipping‏
A Nayak, P Shor‏
Physical Review A 67 (1), 012304, 2003‏
762003
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‏
712010
Interacting boson problems can be QMA hard‏
TC Wei, M Mosca, A Nayak‏
Physical review letters 104 (4), 040501, 2010‏
602010
Interaction in quantum communication‏
H Klauck, A Nayak, A Ta-Shma, D Zuckerman‏
IEEE Transactions on Information Theory 53 (6), 1970-1982, 2007‏
562007
Invertible quantum operations and perfect encryption of quantum states‏
A Nayak, P Sen‏
arXiv preprint quant-ph/0605041, 2006‏
542006
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‏
522008
سیستم در حال حاضر قادر به انجام عملکرد نیست. بعداً دوباره امتحان کنید.
مقاله‌ها 1–20