287 citations · 1.1k across the 48 of their papers we have counts for
14 papers · 1 filter
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…
Time and Query Complexity Tradeoffs for the Dihedral Coset Problem
Maxime Remaud, André Schrottenloher, Jean-Pierre Tillich
The Dihedral Coset Problem (DCP) in has been extensively studied in quantum computing and post-quantum cryptography, as for instance, the Learning with Errors problem reduces…
Towards low overhead magic state distillation
Anirudh Krishna, Jean-Pierre Tillich
Magic state distillation is a resource intensive sub-routine for quantum computation. The ratio of noisy input states to output states with error rate at most scales as $O(\log…
Magic state distillation with punctured polar codes
Anirudh Krishna, Jean-Pierre Tillich
We present a scheme for magic state distillation using punctured polar codes. Our results build on some recent work by Bardet et al. (ISIT, 2016) who discovered that polar codes ca…