Complexity and Applications of Nearest Stabilizer Product State Problems
This work classifies problems related to finding how close an n-qubit stabilizer state is to a set of single-qubit product states. It shows that while some versions are easy (P), others are hard (NP-complete). The complexity depends on the structure of the target set, linking quantum computation to classical simulation and entanglement measures.