Abstract: Syndrome decoding and the minimum distance problem are arguably the two most important problems in coding theory. In this talk, we will try to describe these problems for quantum analogues of linear error-correcting codes. We will show that similar to classical codes, finding the minimum distance of stabilizer codes is NP-hard as well. The talk is based on the following paper: https://ieeexplore.ieee.org/document/10154053