4 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…
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…
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…
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…