25 citations · 47 across the 8 of their papers we have counts for
8 papers
Asymptotically Optimal Quantum Circuits for Comparators and Incrementers
Vivien Vandaele
We present quantum circuits for comparison and increment operations that achieve an asymptotically optimal gate count of and depth of over the Clifford+Toffoli g…
Quantum binary field multiplication with subquadratic Toffoli gate count and low space-time cost
Vivien Vandaele
Multiplication over binary fields is a crucial operation in quantum algorithms designed to solve the discrete logarithm problem for elliptic curve defined over . In this p…
Ancilla-free Quantum Adder with Sublinear Depth
Maxime Remaud, Vivien Vandaele
We present the first exact quantum adder with sublinear depth and no ancilla qubits. Our construction is based on classical reversible logic only and employs low-depth implementati…
Qubit-count optimization using ZX-calculus
Vivien Vandaele
We propose several methods for optimizing the number of qubits in a quantum circuit while preserving the number of non-Clifford gates. One of our approaches consists in reversing,…
Optimal number of parametrized rotations and Hadamard gates in parametrized Clifford circuits with non-repeated parameters
Vivien Vandaele, Simon Perdrix, Christophe Vuillot
We present an efficient algorithm to reduce the number of non-Clifford gates in quantum circuits and the number of parametrized rotations in parametrized quantum circuits. The meth…
Lower T-count with faster algorithms
Vivien Vandaele
Among the cost metrics characterizing a quantum circuit, the -count stands out as one of the most crucial as its minimization is particularly important in various areas of quant…
Optimal Hadamard gate count for Clifford synthesis of Pauli rotations sequences
Vivien Vandaele, Simon Martiel, Simon Perdrix +1
The Clifford gate set is commonly used to perform universal quantum computation. In such setup the gate is typically much more expensive to implement in a fault-tolerant wa…
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…