6 citations · 12 across the 6 of their papers we have counts for
6 papers
Quantum adders: on the structural link between the ripple-carry and carry-lookahead techniques
Maxime Remaud
This paper is motivated by two key observations. First, Toffoli ladders can be implemented in three distinct ways: with linear or polylogarithmic depth using no ancilla, or with lo…
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…
Optimizing T and CNOT Gates in Quantum Ripple-Carry Adders and Comparators
Maxime Remaud
The state of the art of quantum circuits using the ripple-carry strategy for the addition and comparison of two n-bit numbers is presented, as well as optimizations in the Clifford…
Time and Query Complexity Tradeoffs for the Dihedral Coset Problem
Maxime Remaud, André Schrottenloher, Jean-Pierre Tillich
The Dihedral Coset Problem (DCP) in has been extensively studied in quantum computing and post-quantum cryptography, as for instance, the Learning with Errors problem reduces…
Quantum Reduction of Finding Short Code Vectors to the Decoding Problem
Thomas Debris-Alazard, Maxime Remaud, Jean-Pierre Tillich
We give a quantum reduction from finding short codewords in a random linear code to decoding for the Hamming metric. This is the first time such a reduction (classical or quantum)…
Practical implementation of a quantum backtracking algorithm
Simon Martiel, Maxime Remaud
In previous work, Montanaro presented a method to obtain quantum speedups for backtracking algorithms, a general meta-algorithm to solve constraint satisfaction problems (CSPs). In…