Automated Optimization of Quantum Circuits
Event details
| Date | 05.09.2018 |
| Hour | 11:00 › 13:00 |
| Speaker | Bruno Schmitt Antunes |
| Location | |
| Category | Conferences - Seminars |
EDIC candidacy exam
Exam president: Prof. Andreas Burg
Thesis advisor: Prof. Giovanni De Micheli
Co-examiner: Prof. Paolo Ienne
Abstract
The appearance of quantum devices with a larger number of qubits and longer coherence times marks the beginning of an exciting era in quantum technology. Finding applications for which a quantum algorithm offers a large scaling advantage in time-to-solution over classical algorithms is a crucial, but very challenging, task. The development of software toolchains hopes to lessen the burden on quantum algorithm researchers through the use of abstractions. In this context, I first present a work that offers an overview of today's quantum toolchains. Then, I focus on the quantum compilation process, i.e., the translation of a high-level description of a quantum algorithm to hardware-specific low-level operations. Specifically, I study techniques for the automated optimization of quantum circuits by presenting two papers on this topic. One paper focuses on optimizing with respect to a cost function that assumes the implementation of fault-tolerant quantum gates---using T-count and T-depth as metrics. The other paper, in striking resemblance to classical logic optimization, employs different circuit representations and orthogonal heuristic techniques to optimize quantum circuits. Finally, I show that by using the ideas from these three papers, it is possible to form an exciting direction for new research.
Background papers
Programming languages and compiler design for realistic quantum hardware, by Chong, F., et al.
Automated optimization of large quantum circuits with continuous parameters, by Nam, Y., et al.
Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning, by Amy, M., et al.
Exam president: Prof. Andreas Burg
Thesis advisor: Prof. Giovanni De Micheli
Co-examiner: Prof. Paolo Ienne
Abstract
The appearance of quantum devices with a larger number of qubits and longer coherence times marks the beginning of an exciting era in quantum technology. Finding applications for which a quantum algorithm offers a large scaling advantage in time-to-solution over classical algorithms is a crucial, but very challenging, task. The development of software toolchains hopes to lessen the burden on quantum algorithm researchers through the use of abstractions. In this context, I first present a work that offers an overview of today's quantum toolchains. Then, I focus on the quantum compilation process, i.e., the translation of a high-level description of a quantum algorithm to hardware-specific low-level operations. Specifically, I study techniques for the automated optimization of quantum circuits by presenting two papers on this topic. One paper focuses on optimizing with respect to a cost function that assumes the implementation of fault-tolerant quantum gates---using T-count and T-depth as metrics. The other paper, in striking resemblance to classical logic optimization, employs different circuit representations and orthogonal heuristic techniques to optimize quantum circuits. Finally, I show that by using the ideas from these three papers, it is possible to form an exciting direction for new research.
Background papers
Programming languages and compiler design for realistic quantum hardware, by Chong, F., et al.
Automated optimization of large quantum circuits with continuous parameters, by Nam, Y., et al.
Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning, by Amy, M., et al.
Practical information
- General public
- Free
Contact
- EDIC - [email protected]