Quantum advantage from soft decoders
Andr\'e Chailloux, Jean-Pierre Tillich

TL;DR
This paper demonstrates quantum advantage in decoding problems by leveraging a soft decoder for Reed-Solomon codes, improving algorithms for the Optimal Polynomial Interpolation problem and related cryptographic challenges.
Contribution
It introduces a novel reduction from syndrome decoding to coset sampling and applies the Koetter-Vardy soft decoding algorithm to achieve improvements in quantum decoding algorithms.
Findings
Enhanced quantum algorithms for OPI and ISIS_infinity problems
Development of a generic reduction from syndrome decoding to coset sampling
Extensive analysis of OPI using Koetter-Vardy decoding
Abstract
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 authors of [JSW+24] have recently come up with a quantum algorithm called Decoded Quantum Interferometry that is able to solve in polynomial time several optimization problems. They study in particular the Optimal Polynomial Interpolation (OPI) problem, which can be seen as a decoding problem on Reed-Solomon codes. In this work, we provide strong improvements for some instantiations of the OPI problem. The most notable improvements are for the problem (originating from lattice-based cryptography) on Reed-Solomon codes but we also study different constraints for OPI. Our results provide natural and convincing decoding problems for which we believe to have a quantum advantage. Our proof…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
