Andris Ambainis
TitleCited byYear
Quantum walk algorithm for element distinctness
A Ambainis
SIAM Journal on Computing 37 (1), 210-239, 2007
7132007
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
5522003
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
3882002
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
3191998
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
2492003
Upper bound on the communication complexity of private information retrieval
A Ambainis
International Colloquium on Automata, Languages, and Programming, 401-407, 1997
2041997
Private quantum channels
A Ambainis, M Mosca, A Tapp, R De Wolf
Proceedings 41st Annual Symposium on Foundations of Computer Science, 547-553, 2000
2022000
Two-way finite automata with quantum and classical states
A Ambainis, J Watrous
Theoretical Computer Science 287 (1), 299-311, 2002
1922002
Quantum to classical transition for random walks
TA Brun, HA Carteret, A Ambainis
Physical review letters 91 (13), 130602, 2003
1862003
Polynomial degree vs. quantum query complexity
A Ambainis
Journal of Computer and System Sciences 72 (2), 220-238, 2006
1772006
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
1742010
Quantum walks driven by many coins
TA Brun, HA Carteret, A Ambainis
Physical Review A 67 (5), 052317, 2003
1572003
A new protocol and lower bounds for quantum coin flipping
A Ambainis
Journal of Computer and System Sciences 68 (2), 398-416, 2004
1402004
Quantum random walks with decoherent coins
TA Brun, HA Carteret, A Ambainis
Physical Review A 67 (3), 032304, 2003
1402003
Quantum search algorithms
A Ambainis
ACM SIGACT News 35 (2), 22-35, 2004
1312004
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
1092003
The system can't perform the operation now. Try again later.
Articles 1–20