206 citations · 289 across the 10 of their papers we have counts for
10 papers
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…
Synthesizing quantum circuits via numerical optimization
Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron +1
We provide a simple framework for the synthesis of quantum circuits based on a numerical optimization algorithm. This algorithm is used in the context of the trapped-ions technolog…
Quantum circuit synthesis using Householder transformations
Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron +1
The synthesis of a quantum circuit consists in decomposing a unitary matrix into a series of elementary operations. In this paper, we propose a circuit synthesis method based on th…
A contribution to the conditioning of the total least squares problem
Marc Baboulin, Serge Gratton
We derive closed formulas for the condition number of a linear function of the total least squares solution. Given an over determined linear system Ax=b, we show that this conditio…
Accelerating Scientific Computations with Mixed Precision Algorithms
Marc Baboulin, Alfredo Buttari, Jack Dongarra +5
On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit f…
Computing the Conditioning of the Components of a Linear Least Squares Solution
Marc Baboulin, Jack Dongarra, Serge Gratton +1
In this paper, we address the accuracy of the results for the overdetermined full rank linear least squares problem. We recall theoretical results obtained in Arioli, Baboulin and…