Time：Apr 23 2021 9:30-10:30
Tencent Meeting ID: 499680837；

Password：0423

Title：Quantum State Runtime Assertion and Quantum Compiler Optimization

Host：Dong Liu，Department of Physics， Tsinghua University

Abstract：

With the rapid growth of quantum computing technology, programmers need new tools for debugging quantum programs. Recent works show that assertions are a promising way for debugging quantum programs. However, there are two main drawbacks with the existing schemes. First, the existing schemes, including both statistical and dynamic assertions are only capable of asserting limited types of states. Second, the use cases of these assertions are limited, since the programmer has to know the exact/precise state to assert.

In this talk, I will primarily discuss the systematic approaches for quantum state runtime assertion. I will introduce the idea of approximate assertion in quantum computation. The systematic approaches can assert a wide range of states without additional architectural support. This talk is largely based on a research paper ("Systematic Approaches for Precise and Approximate Quantum State Runtime Assertion") that appeared in HPCA 2021.  

Besides the runtime assertion, I’ll also discuss a quantum compiler optimization named “Relaxed Peephole Optimization”. The compiler optimization leads to fewer CNOT gate counts and lower compilation time than the state-of-the-art Qiskit compiler. The relaxed research paper (“Relaxed Peephole Optimization: A Novel Compiler Optimization for Quantum Circuits”) appeared in CGO 2021.

About the Speaker：

Ji Liu is a Ph.D. candidate in the Electrical and Computer Engineering Department at North Carolina State University. His dissertation work under Dr. Huiyang Zhou focuses on the areas of quantum computing, computer architecture, and compiler optimizations. In 2014, he graduated from the University of Science and Technology of China with a BS in Applied Physics. 

Website: http://programinquantum.com/