Tolerant Testing of Stabilizer States with Mixed State Inputs

Learn about a novel quantum algorithm for tolerant testing of stabilizer states that accepts mixed state inputs in this 19-minute conference talk. Explore the first algorithm of its kind that can distinguish between mixed states with high fidelity to stabilizer pure states versus those with low fidelity to all such states. Discover how the algorithm achieves polynomial sample complexity in 1/ε1 and time complexity O(n * poly(1/ε1)) when given a mixed state ρ that either has fidelity at least ε1 with some stabilizer pure state or fidelity at most ε2 with all such states, where ε2 ≤ ε1^O(1). Gain insights into the theoretical foundations and practical implications of this breakthrough in quantum state testing, as presented by authors Daniel Liang and Vishnu Iyer at the Quantum Techniques in Machine Learning (QTML) 2025 conference in Singapore.