### Research Talks

*The Quantum Complexity of the Closest Pair Problem*
- CFCS Quantum Day, Peking University, May 2021 (Remote)
- Logic Seminar, Department of Mathematics, Pennsylvania State University, February 2021

*A quantum landscape for computer scientists: Toward optimization, machine learning, and studying physical systems*
- CSE Colloquium, Penn State University, March 2020 (Remote)
- CS Colloquium, Simon Fraser University, Canada, March 2020 (Remote)
- CS Colloquium, UT Dallas, March 2020
- Quantum Computing Colloquium, UC San Diego, March 2020
- CS Colloquium, CU Boulder, March, 2020
- Special Seminar, UIUC, February, 2020
- CS Colloquium, Indiana University, February, 2020

*Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning*
*Quantum-inspired sublinear algorithms for solving low-rank linear systems and SDPs*
- IQC Seminar, University of Waterloo, Canada, June 20, 2019

*A quantum algorithm for simulating non-sparse Hamiltonians*
- PhD Seminar, University of Waterloo, Canada, April 24, 2018

*Dissipative quantum search*
- PhD Seminar, University of Waterloo, Canada, April 24, 2018
- The 1st IRIF-IQC Workshop on Quantum Information Processing, IRIF, Paris, France, December 8, 2017

*Simulating the evolution of Markovian open quantum systems on quantum
computers*
- QUICS Seminar, University of Maryland, November 8, 2017
- IQST Seminar, University of Calgary, Canada, October 11, 2017

*Efficient Quantum Algorithms for Simulating Lindblad Evolution*
- Quantum Computing Seminar, Texas Tech University, April, 2021 (Remote)
- ICALP 2017, Warsaw, Poland, July 11, 2017
- PhD Seminar, University of Waterloo, Canada, November 28, 2016

*Open quantum system simulation*
- IQC Student Seminar, University of Waterloo, Canada, October 11, 2015

*Near-linear constructions of exact unitary 2-designs*
- IQC Student Seminar, University of Waterloo, Canada, October 8, 2014

*Computational study on bidimensionality theory based algorithm for longest path problem*