203 citations · 369 across the 9 of their papers we have counts for
9 papers
Faster and shorter synthesis of Hamiltonian simulation circuits
Timothée Goubault de Brugière, Simon Martiel
We devise greedy heuristics tailored for synthesizing quantum circuits that implement a specified set of Pauli rotations. Our heuristics are designed to minimize either the count o…
Shallower CNOT circuits on realistic quantum hardware
Timothée Goubault de Brugière, Simon Martiel
We focus on the depth optimization of CNOT circuits on hardwares with limited connectivity. We adapt the algorithm from Kutin et al. that implements any -qubit CNOT circuit in d…
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…
Phase polynomials synthesis algorithms for NISQ architectures and beyond
Vivien Vandaele, Simon Martiel, Timothée Goubault de Brugière
We present a framework for the synthesis of phase polynomials that addresses both cases of full connectivity and partial connectivity for NISQ architectures. In most cases, our alg…
Architecture aware compilation of quantum circuits via lazy synthesis
Simon Martiel, Timothée Goubault de Brugière
Qubit routing is a key problematic related to quantum circuit compilation. It consists in rewriting a quantum circuit by adding the least possible number of instructions to make th…