134 citations · 561 across the 34 of their papers we have counts for
36 papers · 1 filter
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…
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…
Finding many Collisions via Reusable Quantum Walks
Xavier Bonnetain, André Chailloux, André Schrottenloher +1
Given a random function with domain and codomain , with , a collision of is a pair of distinct inputs with the same image. Collision finding is an…
Relativistic zero-knowledge protocol for NP over the internet unconditionally secure against quantum adversaries
André Chailloux, Yann Barsamian
Relativistic cryptography is a proposal for achieving unconditional security that exploits the fact that no information carrier can travel faster than the speed of light. It is bas…