Curator's Take
This article tackles a fundamental challenge in quantum computing: efficiently learning the underlying structure of quantum states, specifically their stabilizer groups which encode important symmetries. The breakthrough here is demonstrating that logarithmic-depth circuits can learn most stabilizer structures using single quantum state copies, a dramatic improvement over previous linear-depth requirements that makes the approach far more practical for near-term quantum devices. However, the research also reveals fundamental limits by proving that worst-case scenarios still require exponentially many measurements, highlighting an intriguing trade-off between average and worst-case performance. Most significantly, their findings suggest a genuine quantum advantage for learning Pauli symmetries when comparing single-copy versus two-copy protocols, adding to the growing evidence that quantum systems can fundamentally outperform classical approaches in certain learning tasks.
— Mark Eatherly
Summary
We study single-copy stabilizer learning, the problem of identifying a stabilizer group of dimension $n-t$ from an $n$-qubit quantum state $ρ$. We obtain two complementary results. First, in the average case, logarithmic-depth local Clifford circuits suffice to efficiently learn almost all stabilizer groups with $t=O(\log n)$, instead of the linear-depth measurements required in previous approaches. We support this result with numerical simulations for systems of up to 100 qubits. Second, we show that, in the worst case, any adaptive single-copy measurement scheme requires a number of samples that scales exponentially in $t$. Together with existing results on two-copy learning, our findings suggest that, for large $t$, identifying Pauli symmetries of a quantum system exhibits a quantum advantage in the learning setting.