Abstract: With the rapid growth of quantum computing technology, programmers need new tools for debugging quantum programs. Recent works show that assertion is a promising way for debugging quantum programs. However, there are two main drawbacks with the existing schemes. First, the existing schemes 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.
Besides the runtime assertion, I’ll also discuss a quantum compiler optimization named “Relaxed Peephole Optimization”. The compiler optimization leads to fewer gate counts and lower compilation time than the state-of-the-art Qiskit compiler.
Bio: 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/
Please use this link to attend the virtual seminar.
Meeting ID: 484290679 / Participant passcode: 8519