Talks
Invited Academic Talks
Complexity Theory for Quantum Promise Problems
Invited talk at Texas Crytpo Day, Dec. 2024
Classical Verification of Quantum Depth
Invited talk at Texas Crytpo Day, April 2024
Invited talk at International Workshop on Quantum Information Processing and Applications, Dec. 2022
Invited talk at Quantum Computer System Lecture Series, Nov. 2022 (Online)
Invited talk at Academia Sinica, July 2022
Quantum Meets Minimum Circuit Size Problem
Invited talk at PCMI 2023 Graduate Summer School, July 2023
Invited talk at Lower Bounds, Learning, and Average-Case Complexity workshop, Simons Institute, UC Berkeley, Feb. 2023
Invited talk at Hon-Hai Research Institute, Sep. 2021 (Online)
Invited talk at Academia Sinica, Dec. 2020 (Online)
Quantum-inspired sampling-based low-rank matrix arithmetic framework for dequantizing quantum machine learning
Invited talk at Quantum Seminar at George Mason University, April 2023 (Online)
Invited talk at Coffee & Food for Thought at Rice University, Jan. 2023
Invited talk at SIAM Special Session on SIAM Minisymposium on Quantum Algorithms, Joint Mathematics Meetings (JMM), Jan. 2023
Quantum Rewinding for Zero-Knowledge
Invited talk in STOC 2022 Workshop: The Multiple Facets of Quantum Proofs, June 2022
Characterizing the Power of Quantum Computers and Their Impacts on Computer Science
Invited talk at UT Austin, March 2022
Invited talk at The University of British Columbia, March 2022 (Online)
Invited talk at Northeastern University, March 2022
Invited talk at Purdue University, Feb. 2022
Invited talk at Rice University, Feb. 2022 (Online)
Invited talk at Ohio State University, Dec. 2021
Quantum and Quantum-Inspired Algorithms for ML-Related Problems
Invited talk at Sorbonne University, May 2021 (Online)
Quantum Complexity Theory and Algorithm
Invited talk at Indiana-Sorbonne University quantum workshop, May 2021 (Online)
On the Need for Large Quantum Depth
Invited talk at QuICS Stakeholder Day, March 2021 (Online)
Invited talk at NCTS Annual Theory Meeting 2021: Quantum Physics, Quantum Information, and Quantum Technologies, Feb. 2021 (Online)
Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Round
Invited talk at Department of Computer Science, UMD, Dec. 2020 (Online)
The capabilities and limits of quantum algorithms
Invited talk at Department of Computer Science and Engineering, UCSD, March 2020 (Online)
Invited talk at Department of Computer Science, UIUC, Feb. 2020
Invited talk at Department of Computer Science, Indiana University, Jan. 2020
Invited talk at Academia Sinica, Dec. 2019
Invited talk at Department of Computer Science and Information Engineering, National Central University, Taiwan, Dec. 2019
Invited talk at Department of Physics, National Taiwan University, Dec. 2019
Invited talk at Department of Computer Science and Information Engineering, National Taiwan University, Dec. 2019
Quantum-inspired sublinear algorithms for solving low-rank linear systems
Invited talk at Department of Computer Science, Texas A&M, Jan. 2019
Invited talk at National Chiao Tung University, Taiwan, Jan. 2019
Invited talk at Academia Sinica, Dec. 2018
Quantum worst-case to average-case reductions for QMA-complete
Invited talk at Academia Sinica, December 2016
How hard is deciding trivial versus nontrivial in the dihedral coset problem?
Invited talk at IQC, University of Waterloo, Nov. 2015
Invited talk at Academia Sinica, December 2015
Conference Talks
Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Round
Contributed talk at Crypto 2021, August 2021 (Online)
Classical Verification of Quantum Computations with Efficient Verifier
Contributed talk at TCC'2020, November 2020 (Online)
Quantum-Inspired Sublinear Algorithms for Solving Low-Rank Semidefinite Programming
Contributed talk at MFCS'2020, August 2020 (Online)
On the Need for Large Quantum Depth
Contributed talk at STOC'2020, June 2020 (Online)
Contributed talk at QIP'2020, January 2020
Basing one-way permutations on NP-hard problems under quantum reductions
Contributed talk at QCRYPT'2018, Shanghai, August 2018
How hard is deciding trivial versus nontrivial in the dihedral coset problem?
Contributed talk at TQC'2016, Berlin, September 2016
Quantum Blind Computation with Teleportation-based Computation
Contributed talk at ITNG'2012, Las Vegas, 2012
Other Talks about Quantum Computing
Quantum Computation and Cyber Security
Invited talk at Kelly School of Business at IUB and Institute of Defense and Business, May 2021 (Online)
Introduction to quantum computing
Invited talk at Yahoo Taiwan, June 2016
Quantum computers -- a view from computer science
Invited talk at Innovation and Interdisciplinary Collaboration Community Workshop, The Pennsylvania State University, November 2013
Invited talk at Kaohsiung High School, July 2013