On the hardness of approximating minimum distances of quantum codes
The study proves that approximating minimum distances for both classical and quantum codes, specifically CSS codes and graph states, is NP-hard. By using hypergraph product codes and specific graph constructions, the research establishes new hardness results. This suggests a 'new kind of square root barrier' in quantum coding theory regarding approximation limits.