Does there exists super-polynomial quantum advantage for decoding certain linear codes?

Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers. Stack Overflow for Teams is now called Stack Internal. Bring the best of human thought and AI automation together at your work. Bring the best of human thought and AI automation together at your work. Learn more Stack InternalKnowledge at workBring the best of human thought and AI automation together at your work.Syndrome decoding is NP-complete problem. [page 6 of this reference] There are some special linear codes for which we know efficient classical decoding algorithms, such as Reed-Solomon, LDPC and etc.Is there some linear codes for which we know there exists an efficient quantum decoding algorithm, but there is no known classical algorithm for it?Thanks for contributing an answer to Quantum Computing Stack Exchange!But avoid …Use MathJax to format equations. MathJax reference.To learn more, see our tips on writing great answers.Required, but never shown By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy. Start asking to get answersFind the answer to your question by asking.Explore related questionsSee similar questions with these tags.To subscribe to this RSS feed, copy and paste this URL into your RSS reader. Site design / logo © 2025 Stack Exchange Inc; user contributions licensed under CC BY-SA . rev 2025.11.27.37399