134 citations · 561 across the 34 of their papers we have counts for
40 papers
IQP circuits for 2-Forrelation
Quentin Buzet, André Chailloux
The -Forrelation problem provides an optimal separation between classical and quantum query complexity and is also the problem used for separating and $\mathsf{PH…
The Quantum Decoding Problem : Tight Achievability Bounds and Application to Regev's Reduction
Agathe Blanvillain, André Chailloux, Jean-Pierre Tillich
We consider the quantum decoding problem. It consists in recovering a codeword given a superposition of noisy versions of this codeword. By measuring the superposition, we get back…
Quantum advantage from soft decoders
André Chailloux, Jean-Pierre Tillich
In the last years, Regev's reduction has been used as a quantum algorithmic tool for providing a quantum advantage for variants of the decoding problem. Following this line of work…
New Solutions to Delsarte's Dual Linear Programs
André Chailloux, Thomas Debris-Alazard
Understanding the maximum size of a code with a given minimum distance is a major question in computer science and discrete mathematics. The most fruitful approach for finding asym…
The Quantum Decoding Problem
André Chailloux, Jean-Pierre Tillich
One of the founding results of lattice based cryptography is a quantum reduction from the Short Integer Solution problem to the Learning with Errors problem introduced by Regev. It…
Compressing integer lists with Contextual Arithmetic Trits
Yann Barsamian, André Chailloux
Inverted indexes allow to query large databases without needing to search in the database at each query. An important line of research is to construct the most efficient inverted i…