202 citations · 613 across the 35 of their papers we have counts for
5 papers · 1 filter
A graph-state based synthesis framework for Clifford isometries
Timothée Goubault de Brugière, Simon Martiel, Christophe Vuillot
We tackle the problem of Clifford isometry compilation, i.e, how to synthesize a Clifford isometry into an executable quantum circuit. We propose a simple framework for synthesis t…
On constant-time quantum annealing and guaranteed approximations for graph optimization problems
Arthur Braida, Simon Martiel, Ioan Todinca
Quantum Annealing (QA) is a computational framework where a quantum system's continuous evolution is used to find the global minimum of an objective function over an unstructured s…
Gaussian Elimination versus Greedy Methods for the Synthesis of Linear Reversible Circuits
Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron +2
Linear reversible circuits represent a subclass of reversible circuits with many applications in quantum computing. These circuits can be efficiently simulated by classical compute…
Decoding techniques applied to the compilation of CNOT circuits for NISQ architectures
Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron +2
Current proposals for quantum compilers require the synthesis and optimization of linear reversible circuits and among them CNOT circuits. Since these circuits represent a signific…
Reducing the Depth of Linear Reversible Quantum Circuits
Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron +2
In quantum computing the decoherence time of the qubits determines the computation time available and this time is very limited when using current hardware. In this paper we minimi…