Skip to Main content Skip to Navigation

Methods for optimizing the synthesis of quantum circuits

Abstract : To run an abstract algorithm on a quantum computer, the algorithm must be compiled into a sequence of low-level instructions that can be executed by the processor. The compilation step is crucial because it determines the quantity of resources necessary for the execution of an algorithm. Therefore, the compilation stage must be optimized. In this thesis, we are interested in a brick of compilation: the synthesis of quantum circuits from an abstract specification of an operator.First, we study the case where the unitary matrix of a quantum operator is given to us and we explore the minimization of both quantum resources and classical resources. Even if the simultaneous optimization of these two types of resources seems difficult, we propose better compromises improving the literature.Secondly, we are interested in the class of so-called reversible linear operators. This time we are exclusively interested in the optimization of quantum resources and we improve the state of the art in various cases of quantum metrics (circuit size, circuit depth) and processors (NISQ, fully-connected processors).
Complete list of metadata
Contributor : ABES STAR :  Contact
Submitted on : Monday, February 1, 2021 - 11:59:08 AM
Last modification on : Sunday, June 26, 2022 - 3:04:01 AM
Long-term archiving on: : Sunday, May 2, 2021 - 7:09:39 PM


Version validated by the jury (STAR)


  • HAL Id : tel-03127089, version 1


Timothée Goubault de Brugière. Methods for optimizing the synthesis of quantum circuits. Quantum Physics [quant-ph]. Université Paris-Saclay, 2020. English. ⟨NNT : 2020UPASG018⟩. ⟨tel-03127089⟩



Record views


Files downloads