2 citations · 2 across the 6 of their papers we have counts for
6 papers
Regev's reduction as a candidate quantum algorithm for the discrete logarithm problem in finite abelian groups
M. Isabel Franco Garrido, André Chailloux
In this article, we investigate whether combining Regev's reduction with the Cheng-Wan reduction can yield an alternative quantum algorithm for the discrete logarithm problem (DLOG…
Optimization Using Locally-Quantum Decoders
Noah Shutty, Avijit Mandal, Seyoon Ragavan +8
It was pointed out in [JSW+25] that widely-studied optimization problems such as D-regular max-k-XORSAT can be reduced to decoding of LDPC codes, using quantum algorithms related t…
OPI x Soft Decoders
André Chailloux
In recent years, a particularly interesting line of research has focused on designing quantum algorithms for code and lattice problems inspired by Regev's reduction. The core idea…
Fine-Grained Unambiguous Measurements
Quentin Buzet, André Chailloux
Unambiguous measurements play an important role in quantum information, with applications ranging from quantum key distribution to quantum state reconstruction. Recently, such meas…
On the Quantum Equivalence between and
André Chailloux, Paul Hermouet
Chen, Liu, and Zhandry [CLZ22] introduced the problems and as quantum analogues of the Learning with Errors problem, designed to construct quantum alg…
On the (In)security of optimized Stern-like signature schemes
André Chailloux, Simona Etinski
Stern's signature scheme is a historically important code-based signature scheme. A crucial optimization of this scheme is to generate pseudo-random vectors and a permutation inste…