BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Automated Optimization of Quantum Circuits
DTSTART:20180905T110000
DTEND:20180905T130000
DTSTAMP:20260408T101517Z
UID:0c5cf32b86590fcc2c0a0d1c04086c3a3f0cd7f62f902ef9556be6f6
CATEGORIES:Conferences - Seminars
DESCRIPTION:Bruno Schmitt Antunes\nEDIC candidacy exam\nExam president: Pr
 of. Andreas Burg\nThesis advisor: Prof. Giovanni De Micheli\nCo-examiner:
  Prof. Paolo Ienne\n\nAbstract\nThe appearance of quantum devices with a l
 arger number of qubits and longer coherence times marks the beginning of a
 n exciting era in quantum technology. Finding applications for which a qua
 ntum algorithm offers a large scaling advantage in time-to-solution over c
 lassical algorithms is a crucial\, but very challenging\, task. The develo
 pment of software toolchains hopes to lessen the burden on quantum algorit
 hm 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-l
 evel operations. Specifically\, I study techniques for the automated optim
 ization of quantum circuits by presenting two papers on this topic. One pa
 per focuses on optimizing with respect to a cost function that assumes the
  implementation of fault-tolerant quantum gates---using T-count and T-dept
 h as metrics. The other paper\, in striking resemblance to classical logic
  optimization\, employs different circuit representations and orthogonal h
 euristic techniques to optimize quantum circuits. Finally\, I show that by
  using the ideas from these three papers\, it is possible to form an excit
 ing direction for new research.\n\nBackground papers\nProgramming language
 s and compiler design for realistic quantum hardware\, by Chong\, F.\, et 
 al.\nAutomated optimization of large quantum circuits with continuous para
 meters\, by Nam\, Y.\, et al.\nPolynomial-time T-depth Optimization of Cli
 fford+T circuits via Matroid Partitioning\, by Amy\, M.\, et al.\n 
LOCATION:INF 328 https://plan.epfl.ch/?room=INF328
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR