206 citations · 289 across the 10 of their papers we have counts for
5 papers · 1 filter
A mixed-precision quantum-classical algorithm for solving linear systems
Océane Koska, Marc Baboulin, Arnaud Gazda
We address the problem of solving a system of linear equations via the Quantum Singular Value Transformation (QSVT). One drawback of the QSVT algorithm is that it requires huge qua…
A tree-approach Pauli decomposition algorithm with application to quantum computing
Océane Koska, Marc Baboulin, Arnaud Gazda
The Pauli matrices are 2-by-2 matrices that are very useful in quantum computing. They can be used as elementary gates in quantum circuits but also to decompose any matrix of $\mat…
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…