
Recent developments in quantum algorithms, particularly the 2021 discovery of an apparent exponential quantum speedup for the SIS-infinity problem by filtering, and the 2024 discovery of an apparent exponential quantum speedup for the optimal polynomial intersection problem by decoded quantum interferometry, provide new motivation for the quantum decoding problem. Here, one is given a codeword from a classical error correcting code, which has been subjected to a coherent superposition of symbol-flip errors, and one wishes to recover the original codeword using an efficient quantum circuit. In this workshop we will survey the current state of the art in quantum decoding, present open problems in quantum decoding motivated by algorithmic applications, and then work on these problems together.