Quantum advantages for Pauli channel estimation
Senrui Chen, Sisi Zhou, Alireza Seif, Liang Jiang

TL;DR
This paper demonstrates that entangled measurements significantly reduce the number of samples needed to estimate Pauli channels in quantum computing, showing exponential advantages over traditional methods.
Contribution
It introduces an entangled measurement protocol that exponentially outperforms ancilla-free methods for Pauli channel estimation, with tight bounds and practical benchmarking applications.
Findings
Entangled measurements achieve exponential sample complexity reduction.
Ancilla-assisted protocol requires only O(n/ε²) samples, versus exponential rounds without ancillas.
Practical noise-resilient benchmarking benefits from the proposed estimation method.
Abstract
We show that entangled measurements provide an exponential advantage in sample complexity for Pauli channel estimation, which is both a fundamental problem and a practically important subroutine for benchmarking near-term quantum devices. The specific task we consider is to simultaneously learn all the eigenvalues of an -qubit Pauli channel to precision. We give an estimation protocol with an -qubit ancilla that succeeds with high probability using only copies of the Pauli channel, while prove that any ancilla-free protocol (possibly with adaptive control and channel concatenation) would need at least rounds of measurement. We further study the advantages provided by a small number of ancillas. For the case that a -qubit ancilla () is available, we obtain a sample complexity lower bound of …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
