Shih-Han Hung

shihhan-hung's picture
Graduate Student (2015-2021)
3100M Atlantic Building
(301) 314-1839

Shih-Han was a doctoral student in computer science from 2015 to 2021.  He received his PhD in Computer Science from the University of Maryland. His adviser was Andrew Childs.  Shih-Han will be a postdoc at UT Austin.

Publications

2021

A. M. Childs, Hung, S. - H., and Li, T., Quantum query complexity with matrix-vector products, Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Leibniz International Proceedings in Informatics, vol. 198, pp. 55:1-55:19, 2021.
K. Hietala, Rand, R., Hung, S. - H., Wu, X., and Hicks, M., A Verified Optimizer for Quantum Circuits, Proceedings of the ACM on Programming Languages, vol. 5, no. POPL, 2021.

2020

G. Alagic, Childs, A. M., Grilo, A. B., and Hung, S. - H., Non-interactive classical verification of quantum computation, Theory of Cryptography Conference (TCC), vol. Lecture Notes in Computer Science 12552, pp. 153-180, 2020.

2019

2018

J. Chen, Childs, A. M., and Hung, S. - H., Quantum algorithm for multivariate polynomial interpolation, Proceedings of The Royal Society A, vol. 474, no. 2209, 2018.

2016

A. M. Childs, van Dam, W., Hung, S. - H., and Shparlinski, I. E., Optimal quantum algorithm for polynomial interpolation, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), vol. 55, p. 16:1--16:13, 2016.