Tolerant Testing of Stabilizer States with Mixed State Inputs

We study the problem of tolerant testing of stabilizer states. In particular, we give the first such algorithm that accepts mixed state inputs. Formally, given a mixed state $\rho$ that either has fidelity at least ${\epsilon }_1$ with some stabilizer pure state or fidelity at most ${\epsilon }_2$ with all such states, where ${\epsilon }_2\le {\epsilon }_1^{O(1)}$, our algorithm distinguishes the two cases with sample complexity $\text{poly}(1\mathrm{/}{\epsilon }_1)$ and time complexity $O(n\cdot \text{poly}(1\mathrm{/}{\epsilon }_1))$.