フォロー
Andris Ambainis
タイトル
引用先
引用先
年
Quantum walk algorithm for element distinctness
A Ambainis
SIAM Journal on Computing 37 (1), 210-239, 2007
9102007
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
748*2001
Quantum walks and their algorithmic applications
A Ambainis
International Journal of Quantum Information 1 (04), 507-518, 2003
6822003
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
661*2001
Quantum lower bounds by quantum arguments
A Ambainis
Journal of Computer and System Sciences 64 (4), 750-767, 2002
4542002
Coins make quantum walks faster
A Ambainis, J Kempe, A Rivosh
arXiv preprint quant-ph/0402107, 2004
409*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
367*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
3451998
Quantum search of spatial regions
S Aaronson, A Ambainis
44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003
2872003
Private quantum channels
A Ambainis, M Mosca, A Tapp, R De Wolf
Proceedings 41st Annual Symposium on Foundations of Computer Science, 547-553, 2000
2402000
Upper bound on the communication complexity of private information retrieval
A Ambainis
International Colloquium on Automata, Languages, and Programming, 401-407, 1997
2311997
Two-way finite automata with quantum and classical states
A Ambainis, J Watrous
Theoretical Computer Science 287 (1), 299-311, 2002
2162002
Quantum to classical transition for random walks
TA Brun, HA Carteret, A Ambainis
Physical review letters 91 (13), 130602, 2003
2152003
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
2132010
Polynomial degree vs. quantum query complexity
A Ambainis
Journal of Computer and System Sciences 72 (2), 220-238, 2006
2032006
Quantum walks driven by many coins
TA Brun, HA Carteret, A Ambainis
Physical Review A 67 (5), 052317, 2003
1892003
Quantum search algorithms
A Ambainis
ACM SIGACT News 35 (2), 22-35, 2004
1732004
Quantum random walks with decoherent coins
TA Brun, HA Carteret, A Ambainis
Physical Review A 67 (3), 032304, 2003
1722003
A new protocol and lower bounds for quantum coin flipping
A Ambainis
Journal of Computer and System Sciences 68 (2), 398-416, 2004
1592004
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
1382005
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20