Talks

Invited Academic Talks 

Quantum Meets Minimum Circuit Size Problem

Quantum-inspired sampling-based low-rank matrix arithmetic framework for dequantizing quantum machine learning

Classical Verification of Quantum Depth

Quantum Rewinding for Zero-Knowledge

Characterizing the Power of Quantum Computers and Their Impacts on Computer Science

Quantum and Quantum-Inspired Algorithms for ML-Related Problems

Quantum Complexity Theory and Algorithm 

On the Need for Large Quantum Depth

Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Round

The capabilities and limits of quantum algorithms

Quantum-inspired sublinear algorithms for solving low-rank linear systems

Quantum worst-case to average-case reductions for QMA-complete

How hard is deciding trivial versus nontrivial in the dihedral coset problem?

Conference Talks

Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Round

Classical Verification of Quantum Computations with Efficient Verifier 

Quantum-Inspired Sublinear Algorithms for Solving Low-Rank Semidefinite Programming

On the Need for Large Quantum Depth

Basing one-way permutations on NP-hard problems under quantum reductions

How hard is deciding trivial versus nontrivial in the dihedral coset problem?

Quantum Blind Computation with Teleportation-based Computation

Other Talks about Quantum Computing

Quantum Computation and Cyber Security

Introduction to quantum computing

Quantum computers -- a view from computer science