Posted

Ryan O'Donnell, Samvitti Sharma (Oct 02 2025).
Abstract: The Pauli channel is a fundamental model of noise in quantum systems, motivating the task of Pauli error estimation. We present an algorithm that builds on the reduction to Population Recovery introduced in [FO21]. Addressing an open question from that work, our algorithm has the key advantage of robustness against even severe state preparation and measurement (SPAM) errors. To tolerate SPAM, we must analyze Population Recovery on a combined erasure/bit-flip channel, which necessitates extending the complex analysis techniques from [PSW17, DOS17]. For nn-qubit channels, our Pauli error estimation algorithm requires only exp(n1/3)\exp(n^{1/3}) unentangled state preparations and measurements, improving on previous SPAM-tolerant algorithms that had 2n2^n-dependence even for restricted families of Pauli channels. We also give evidence that no SPAM-tolerant method can make asymptotically fewer than exp(n1/3)\exp(n^{1/3}) uses of the channel.

Order by:

Want to join this discussion?

Join our community today and start discussing with our members by participating in exciting events, competitions, and challenges. Sign up now to engage with quantum experts!