Подписаться
Andris Ambainis
Andris Ambainis
Professor, University of Latvia
Подтвержден адрес электронной почты в домене lu.lv - Главная страница
Название
Процитировано
Процитировано
Год
Quantum walk algorithm for element distinctness
A Ambainis
SIAM Journal on Computing 37 (1), 210-239, 2007
11632007
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
924*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
812*2001
Quantum walks and their algorithmic applications
A Ambainis
International Journal of Quantum Information 1 (04), 507-518, 2003
7852003
Quantum lower bounds by quantum arguments
A Ambainis
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
5372000
Coins make quantum walks faster
A Ambainis, J Kempe, A Rivosh
arXiv preprint quant-ph/0402107, 2004
497*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
443*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
3841998
Quantum search of spatial regions
S Aaronson, A Ambainis
44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003
3342003
Private quantum channels
A Ambainis, M Mosca, A Tapp, R De Wolf
Proceedings 41st Annual Symposium on Foundations of Computer Science, 547-553, 2000
2942000
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
256*2012
Upper bound on the communication complexity of private information retrieval
A Ambainis
International Colloquium on Automata, Languages, and Programming, 401-407, 1997
2561997
Quantum search algorithms
A Ambainis
ACM SIGACT News 35 (2), 22-35, 2004
2542004
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
2452010
Quantum to classical transition for random walks
TA Brun, HA Carteret, A Ambainis
Physical review letters 91 (13), 130602, 2003
2392003
Quantum walks driven by many coins
TA Brun, HA Carteret, A Ambainis
Physical Review A 67 (5), 052317, 2003
2352003
Polynomial degree vs. quantum query complexity
A Ambainis
Journal of Computer and System Sciences 72 (2), 220-238, 2006
2342006
Two-way finite automata with quantum and classical states
A Ambainis, J Watrous
Theoretical Computer Science 287 (1), 299-311, 2002
2332002
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
1972014
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
1942016
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20