Lower Bounds on Learning Pauli Channels with Individual Measurements

Abstract

Understanding the noise affecting a quantum device is of fundamental importance for scaling quantum technologies. A particularly important class of noise models is that of Pauli channels, as randomized compiling techniques can effectively bring any quantum channel to this form and are significantly more structured than general quantum channels. In this paper, we show fundamental lower bounds on the sample complexity for learning Pauli channels in diamond norm. We consider strategies that may not use auxiliary systems entangled with the input to the unknown channel and have to perform a measurement before reusing the channel. For non-adaptive algorithms, we show a lower bound of $\Omega (2^{3n}{\epsilon }^{-2})$ to learn an $n$-qubit Pauli channel. In particular, this shows that the recently introduced learning procedure by Flammia and Wallman is essentially optimal. In the adaptive setting, we show a lower bound of $\Omega (2^{2.5n}{\epsilon }^{-2})$ for $\epsilon =\mathcal{O}(2^{-n})$, and a lower bound of $\Omega (2^{2n}{\epsilon }^{-2})$ for any $\epsilon >0$. This last lower bound holds even in a stronger model where in each step, before performing the measurement, the unknown channel may be used arbitrarily many times sequentially interspersed with unital operations.

31+5 pages

References in corpus (18)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational advantage using photons
• Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator
• Programmable quantum simulation of 2D antiferromagnets with hundreds of Rydberg atoms
• Noise tailoring for scalable quantum computation via randomized compiling
• Characterizing Quantum Gates via Randomized Benchmarking
• Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators
• Quantum certification and benchmarking
• Efficient learning of quantum noise
• A general framework for randomized benchmarking
• Efficient estimation of Pauli channels
• Unital Quantum Channels - Convex Structure and Revivals of Birkhoff's Theorem
• Recovering quantum gates from few average gate fidelities
• Quantum advantages for Pauli channel estimation
• Projected Least-Squares Quantum Process Tomography
• Pauli error estimation via Population Recovery
• Approximate Randomized Benchmarking for Finite Groups
• Sample-Optimal Quantum Process Tomography with Non-Adaptive Incoherent Measurements

Cited by in corpus (3)

• Efficient self-consistent learning of gate set Pauli noise
• Agnostic Process Tomography
• Adaptivity is not helpful for Pauli channel learning