News: I will join the Department of Electrical Engineering at National Taiwan University as an Assistant Professor in 2024.

I was a postdoc at Academia Sinica, hosted by Kai-Min Chung. Previously, I was a postdoc at the University of Texas at Austin, hosted by Scott Aaronson. I earned my Ph.D. degree in Computer Science at the University of Maryland, advised by Andrew Childs. I received a bachelor’s degree in Electrical Engineering and a master’s degree in Physics at National Taiwan University, advised by Shih-I Chu.

I am broadly interested in quantum information science, with recent focus on demonstrating quantum advantage, verification of quantum devices, and their applications. I have been working on various problems in quantum query complexity, computational complexity theory, (post-)quantum cryptography, and quantum programming languages.

Contact

Emails: shung3@ntu.edu.tw, shung@cs.utexas.edu
Twitter: @hungshihhan

Selected Papers

Google Scholar profile

• Non-Interactive Classical Verification of Quantum Depth: A Fine-Grained Characterization
  Nai-Hui Chia, Shih-Han Hung
  • ePrint 2023/1911
  • Subsumes arXiv:2205.04656
• Certified Randomness from Quantum Supremacy
  Scott Aaronson, Shih-Han Hung
  • ECCC TR23-020
  • arXiv:2303.01625
  • TCS+ Talk by Scott Aaronson
  • Proceedings of the 55th ACM Symposium on Theory of Computing (STOC 2023), pp. 933-944.

• Classical Verification of Quantum Depth
  Nai-Hui Chia, Shih-Han Hung
  • arXiv:2205.04656
  • Presented at the 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)
  • Presented at 12th International Conference on Quantum Cryptography (QCrypt 2022)
• EasyPQC: Verifying Post-Quantum Cryptography
  Manuel Barbosa, Gilles Barthe, Xiong Fan, Benjamin Grégoire,
  Shih-Han Hung, Jonathan Katz, Pierre-Yves Strub, Xiaodi Wu
  • ePrint 2021/1253
  • github.com/EasyCrypt
  • Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 2564–2586 (CCS 2021)
• Quantum Query Complexity with Matrix-Vector Products
  Andrew M. Childs, Tongyang Li, Shih-Han Hung
  • arXiv:2102.11349
  • 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)
• Proving Quantum Programs Correct
  Kesha Hietala, Robert Rand, Shih-Han Hung, Liyi Li, Michael Hicks
  • arXiv:2010.01240
  • github.com/inQWIRE/SQIR
  • Proceeding of the 12th International Conference on Interactive Theorem Proving (ITP 2021), Leibniz International Proceedings in Informatics, vol. 193, pp. 21:1-21:19 (2021)
• On the Principles of Differentiable Quantum Programming Languages
  Shaopeng Zhu, Shih-Han Hung, Shouvanik Chakrabarti, Xiaodi Wu
  • arXiv:2004.01122
  • github.com/LibertasSpZ/adcompile
  • Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2020), no. 37, pp. 272-285
• A Verified Optimizer for Quantum Circuits
  Kesha Hietala, Robert Rand, Shih-Han Hung, Xiaodi Wu, Michael Hicks
  • arXiv:1912.02250
  • github.com/inQWIRE/SQIR
  • The 48th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2021), Proceedings of the ACM on Programming Languages, vol. 5, no. 37, pp. 1–29
  • Distinguished Paper of POPL 2021
  • ACM Transactions on Programming Languages and Systems (TOPLAS), 45, 3, Article 18
• Non-Interactive Classical Verification of Quantum Computation
  Gorjan Alagic, Andrew M. Childs, Alex B. Grilo, Shih-Han Hung
  • arXiv:1911.08101
  • Presented at the 10th International Conference on Quantum Cryptography (QCrypt 2020)
  • Presented at the 24th Annual Conference on Quantum Information Processing (QIP 2021)
  • Theory of Cryptography Conference (TCC), Lecture Notes in Computer Science 12552, 153–180
• Quantum Algorithm for Estimating Volumes of Convex Bodies
  Shouvanik Chakrabarti, Andrew M. Childs, Shih-Han Hung,
  Tongyang Li, Chunhao Wang, Xiaodi Wu
  • arXiv:1908.03903
  • Presented at the 23rd Annual Conference on Quantum Information Processing (QIP 2020)
  • ACM Transactions on Quantum Computing 4, 3, Article 20
• Quantitative Robustness Analysis of Quantum Programs
  Shih-Han Hung, Kesha Hietala, Shaopeng Zhu, Mingsheng Ying, Michael Hicks, Xiaodi Wu
  • arXiv:1811.03585
  • The 46th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2019), Proceedings of the ACM on Programming Languages, vol 3, no. 31, pp. 1-29
• Quantum Algorithm for Multivariate Polynomial Interpolation
  Jianxin Chen, Andrew M. Childs, Shih-Han Hung
  • arXiv:1701.03990
  • Proceedings of the Royal Society A, 474(2209):20170480
• Optimal Quantum Algorithm for Polynomial Interpolation
  Andrew M. Childs, Wim van Dam, Shih-Han Hung, Igor E. Shparlinski
  • arXiv:1509.09271
  • Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), pp. 16:1–16:13