Publications

G. Alagic, Majenz, C., Russell, A., and Song, F., “Quantum-Access-Secure Message Authentication via Blind-Unforgeability”, In: Canteaut A., Ishai Y. (eds) Advances in Cryptology – EUROCRYPT 2020. Lecture Notes in Computer Science, Springer, Cham, vol. 12-17, pp. 788-817 , 2020.

G. Alagic, Moore, C., and Russell, A., “Quantum Algorithms for Simon’s Problem over Nonabelian Groups”, ACM Trans. Algorithms, vol. 6, no. 1, 2010.

G. Alagic, Jeffery, S., Ozols, M., and Poremba, A., “On Quantum Chosen-Ciphertext Attacks and Learning with Errors”, Cryptography, vol. 4, no. 1, p. 10, 2020.

G. Alagic and Russell, A., “Quantum Computing and the Hunt for Hidden Symmetry”, Bulletin of the EATCS, vol. 93, pp. 53-75, 2007.

G. Alagic and Russell, A., “Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts”, In: Coron JS., Nielsen J. (eds) Advances in Cryptology – EUROCRYPT 2017. Lecture Notes in Computer Science, Springer, Cham, vol. 10212, 2017.

G. Alagic, Moore, C., and Russell, A., “Quantum Algorithms for Simon’s Problem over General Groups”, SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 1217–1224, 2007.

G. Alagic, Dulek, Y., Schaffner, C., and Speelman, F., “Quantum Fully Homomorphic Encryption With Verification”, Proceedings of ASIACRYPT 2017, pp. 438-467, 2017.

G. Alagic and Majenz, C., “Quantum Non-malleability and Authentication”, In: Katz J., Shacham H. (eds) Advances in Cryptology – CRYPTO 2017. Lecture Notes in Computer Science. Springer, Cham, vol. 10402, 2017.

G. Alagic and Fefferman, B., “On Quantum Obfuscation”, 2016.

G. Alagic, Majenz, C., Russell, A., and Song, F., “Quantum-secure message authentication via blind-unforgeability”, 2018.

G. Alagic and Bering, E. A., “Quantum Algorithms for Invariants of Triangulated Manifolds”, Quantum Info. Comput. Vol. , vol. 12, no. 9-10, pp. 843-863, 2012.

H. C. Alderete, Singh, S., Nguyen, N. H., Zhu, D., Balu, R., Monroe, C., Chandrashekar, C. M., and Linke, N. M., “Quantum walks and Dirac cellular automata on a programmable trapped-ion quantum computer”, 2020.

Y. Alexeev, Amsler, M., Baity, P., Barroca, M. Antonio, Bassini, S., Battelle, T., Camps, D., Casanova, D., Choi, Yjai, Chong, F. T., Chung, C., Codella, C., Corcoles, A. D., Cruise, J., Di Meglio, A., Dubois, J., Duran, I., Eckl, T., Economou, S., Eidenbenz, S., Elmegreen, B., Fare, C., Faro, I., Fernández, C. Sanz, Ferreira, R. Neumann Ba, Fuji, K., Fuller, B., Gagliardi, L., Galli, G., Glick, J. R., Gobbi, I., Gokhale, P., Gonzalez, Sde la Puen, Greiner, J., Gropp, B., Grossi, M., Gull, E., Healy, B., Huang, B., Humble, T. S., Ito, N., Izmaylov, A. F., Javadi-Abhari, A., Jennewein, D., Jha, S., Jiang, L., Jones, B., de Jong, W. Albert, Jurcevic, P., Kirby, W., Kister, S., Kitagawa, M., Klassen, J., Klymko, K., Koh, K., Kondo, M., Kurkcuoglu, D. Murat, Kurowski, K., Laino, T., Landfield, R., Leininger, M., Leyton-Ortega, V., Li, A., Lin, M., Liu, J., Lorente, N., Luckow, A., Martiel, S., Martin-Fernandez, F., Martonosi, M., Marvinney, C., Medina, A. Castaneda, Merten, D., Mezzacapo, A., Michielsen, K., Mitra, A., Mittal, T., Moon, K., Moore, J., Motta, M., Na, Y. - H., Nam, Y., Narang, P., Ohnishi, Y. -ya, Ottaviani, D., Otten, M., Pakin, S., Pascuzzi, V. R., Penault, E., Piontek, T., Pitera, J., Rall, P., Ravi, G. Subramania, Robertson, N., Rossi, M., Rydlichowski, P., Ryu, H., Samsonidze, G., Sato, M., Saurabh, N., Sharma, V., Sharma, K., Shin, S., Slessman, G., Steiner, M., Sitdikov, I., Suh, I. - S., Switzer, E., Tang, W., Thompson, J., Todo, S., Tran, M., Trenev, D., Trott, C., Tseng, H. - H., Tureci, E., Valinas, D. García, Vallecorsa, S., Wever, C., Wojciechowski, K., Wu, X., Yoo, S., Yoshioka, N., Yu, V. Wen-zhe, Yunoki, S., Zhuk, S., and Zubarev, D., “Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions”, 2023.

Y. Alexeev, Bacon, D., Brown, K. R., Calderbank, R., Carr, L. D., Chong, F. T., DeMarco, B., Englund, D., Farhi, E., Fefferman, B., Gorshkov, A. V., Houck, A., Kim, J., Kimmel, S., Lange, M., Lloyd, S., Lukin, M. D., Maslov, D., Maunz, P., Monroe, C., Preskill, J., Roetteler, M., Savage, M., Thompson, J., and Vazirani, U., “Quantum Computer Systems for Scientific Discovery”, 2019.

E. Altman, Brown, K. R., Carleo, G., Carr, L. D., Demler, E., Chin, C., DeMarco, B., Economou, S. E., Eriksson, M. A., Fu, K. - M. C., Greiner, M., Hazzard, K. R. A., Hulet, R. G., Kollár, A. J., Lev, B. L., Lukin, M. D., Ma, R., Mi, X., Misra, S., Monroe, C., Murch, K., Nazario, Z., Ni, K. - K., Potter, A. C., and Roushan, P., “Quantum Simulators: Architectures and Opportunities”, 2019.

A. Ambainis, Childs, A. M., Le Gall, F., and Tani, S., “The quantum query complexity of certification”, 2009.

A. Ambainis, Childs, A. M., and Liu, Y. - K., “Quantum property testing for bounded-degree graphs”, Proc. RANDOM, pp. 365-376, 2010.

D. An, Linden, N., Liu, J. - P., Montanaro, A., Shao, C., and Wang, J., “Quantum-accelerated multilevel Monte Carlo methods for stochastic differential equations in mathematical finance”, Quantum 5, 481 (2021), vol. 5, p. 481, 2021.

D. An, Childs, A. M., and Lin, L., “Quantum algorithm for linear non-unitary dynamics with near-optimal dependence on all parameters”, 2023.

A. Singh Arora, Coladangelo, A., Coudron, M., Gheorghiu, A., Singh, U., and Waldner, H., “Quantum Depth in the Random Oracle Model”, 2022.

S. Arunachalam, Belovs, A., Childs, A. M., Kothari, R., Rosmanis, A., and de Wolf, R., “Quantum Coupon Collector”, Proceedings of the 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020), Leibniz International Proceedings in Informatics, vol. 158, pp. 10:1-10:17, 2020.

S. Arunachalam, Grilo, A. B., and Sundaram, A., “Quantum hardness of learning shallow classical circuits”, 2019.

D. R. M. Arvidsson-Shukur, McConnell, A. G., and Halpern, N. Yunger, “Quantum simulations of time travel can power nonclassical metrology”, Phys. Rev. Lett., vol. 131, no. 150202, 2023.

B. Augustino, Leng, J., Nannicini, G., Terlaky, T., and Wu, X., “A quantum central path algorithm for linear optimization”, 2023.