Andris Ambainis, Ph.D.
Affiliations: | 2001 | University of California, Berkeley, Berkeley, CA, United States |
Area:
Security (SEC); Theory (THY), Complexity theoryGoogle:
"Andris Ambainis"Parents
Sign in to add mentor| Umesh Vazirani | grad student | 2001 | UC Berkeley | |
| (Quantum entanglement, quantum communication and the limits of quantum computing.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Ambainis A, Banik M, Chaturvedi A, et al. (2019) Parity oblivious d-level random access codes and class of noncontextuality inequalities Quantum Information Processing. 18 |
| Ambainis A, Balodis K, Belovs A, et al. (2017) Separations in Query Complexity Based on Pointer Functions Journal of the Acm. 64: 1-24 |
| Chakraborty S, Novo L, Ambainis A, et al. (2016) Publisher's Note: Spatial Search by Quantum Walk is Optimal for Almost All Graphs [Phys. Rev. Lett. 116, 100501 (2016)]. Physical Review Letters. 116: 249901 |
| Chakraborty S, Novo L, Ambainis A, et al. (2016) Spatial Search by Quantum Walk is Optimal for Almost all Graphs. Physical Review Letters. 116: 100501 |
| Ambainis A, Iraids J. (2016) Optimal One-shot Quantum Algorithm for EQUALITY and AND Baltic Journal of Modern Computing. 4 |
| Ambainis A. (2016) Superlinear advantage for exact quantum algorithms Siam Journal On Computing. 45: 617-631 |
| Ambainis A, Prūsis K, Vihrovs J, et al. (2016) Oscillatory localization of quantum walks analyzed by classical electric circuits Physical Review A. 94 |
| Ambainis A, Iwama K, Nakanishi M, et al. (2016) Quantum Query Complexity of Almost All Functions with Fixed On-set Size Computational Complexity. 25: 723-735 |
| Ambainis A, Belovs A, Regev O, et al. (2016) Efficient quantum algorithms for (Gapped) group testing and junta testing Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 2: 903-922 |
| Ambainis A, Gasarch W, Srinivasan A, et al. (2015) Lower bounds on the deterministic and quantum communication complexity of hamming-distance problems Acm Transactions On Computation Theory. 7 |