Publications

Google Scholar profile

• Certified Randomness Using a Trapped-Ion Quantum Processor
  Minzhao Liu, Ruslan Shaydulin, Pradeep Niroula, Matthew DeCross, Shih-Han Hung, Wen Yu Kon, Enrique Cervero-Martín, Kaushik Chakraborty, Omar Amer, Scott Aaronson, Atithi Acharya, Yuri Alexeev, K. Jordan Berg, Shouvanik Chakrabarti, Florian J. Curchod, Joan M. Dreiling, Neal Erickson, Cameron Foltz, Michael Foss-Feig, David Hayes, Travis S. Humble, Niraj Kumar, Jeffrey Larson, Danylo Lykov, Michael Mills, Steven A. Moses, Brian Neyenhuis, Shaltiel Eloul, Peter Siegfried, James Walker, Charles Lim, Marco Pistoia
  • arXiv:2503.20498
  • Nature 640, 343-348 (2025)
  • Coverage in Scientific American, Shtetl-Optimized, JPMorgan Chase, and Quantinuum
• Quantum Data Management in the NISQ Era
  Rihan Hai, Shih-Han Hung, Tim Coopmans, Floris Geerts
  • arXiv:2409.14111
  • To appear in the proceedings of the 51st International Conference on Very Large Data Bases (VLDB 2025).
• 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.

• 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

Preprints

• Certified Randomness Amplification by Dynamically Probing Remote Random Quantum States
  Minzhao Liu, Pradeep Niroula, Matthew DeCross, Cameron Foreman, Wen Yu Kon, Ignatius William Primaatmaja, M.S. Allman, J.P. Campora III, Akhil Isanaka, Kartik Singhal, Omar Amer, Shouvanik Chakrabarti, Kaushik Chakraborty, Samuel F. Cooper, Robert D. Delaney, Joan M. Dreiling, Brian Estey, Caroline Figgatt, Cameron Foltz, John P. Gaebler, Alex Hall, Zichang He, Craig A. Holliman, Travis S. Humble, Shih-Han Hung, Ali A. Husain, Yuwei Jin, Fatih Kaleoglu, Colin J. Kennedy, Nikhil Kotibhaskar, Nathan K. Lysne, Ivaylo S. Madjarov, Michael Mills, Alistair R. Milne, Kevin Milner, Louis Narmour, Sivaprasad Omanakuttan, Annie J. Park, Michael A. Perlin, Adam P. Reed, Chris N. Self, Matthew Steinberg, David T. Stephen, Joseph Sullivan, Alex Chernoguzov, Florian J. Curchod, Anthony Ransford, Justin G. Bohnet, Brian Neyenhuis, Michael Foss-Feig, Rob Otter, Ruslan Shaydulin
  • arXiv:2511.03686
• Efficient Closest Matrix Product State Learning in Logarithmic Depth
  Chia-Yin Lin, Nai-Hui Chia, Shih-Han Hung
  • arXiv:2510.07798
• Oracle Separation between Noisy Quantum Polynomial Time and the Polynomial Hierarchy
  Nai-Hui Chia, Min-Hsiu Hsieh, Shih-Han Hung, En-Jui Kuo
  • arXiv:2405.07137
• Non-Interactive Classical Verification of Quantum Depth: A Fine-Grained Characterization
  Nai-Hui Chia, Shih-Han Hung
  • ePrint 2023/1911
  • Subsumes arXiv:2205.04656
• 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)