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.
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.
S. - H. Hung, Hietala, K., Zhu, S., Ying, M., Hicks, M., and Wu, X.,
“Quantitative Robustness Analysis of Quantum Programs (Extended Version)”,
Proc. ACM Program. Lang., vol. 3, no. POPL, p. Article 31, 2018.
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.