On the hardness of approximating minimum distances of quantum codes

Elena Grigorescu, Vatsal Jha, Eric Samperton

The problem of computing distances of error-correcting codes is fundamental in both the classical and quantum settings. While hardness for the classical version of these problems h…