Algorithmic Applications of Regev's Reduction

André Chailloux is a researcher at Inria Paris, working on quantum computing and post-quantum cryptography. His current focus is on quantum algorithms for problems used in post-quantum cryptography, particularly code-based and lattice-based problems.

Originating from the work of Chen, Liu, and Zhandry, a new family of quantum algorithms inspired by Regev’s reduction has been developed for lattice-based problems in post-quantum cryptography. These quantum algorithms are also at the heart of the Decoded Quantum Interferometry framework. In this tutorial, André Chailloux will present this family of quantum algorithms, the state of the art and recent developments, with a focus on applications to code-based problems and optimization problems.