2 citations · 2 across the 3 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2026
Regev's reduction as a candidate quantum algorithm for the discrete logarithm problem in finite abelian groups
M. Isabel Franco Garrido, André Chailloux
We revisit the reduction of Cheng and Wan, which transforms instances of the discrete logarithm problem (DLOG) over finite fields into a decoding problem for Reed--Solomon codes, a…
quant-ph2025
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…
quant-ph2025
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…