Lower Bounds on Learning Pauli Channels - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2023

Lower Bounds on Learning Pauli Channels

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 with unentangled measurements. We consider both adaptive and non-adaptive strategies. In the non-adaptive setting, we show a lower bound of $\Omega(2^{3n}\eps^{-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}\eps^{-2})$ for $\eps=\mathcal{O}(2^{-n})$, and a lower bound of $\Omega(2^{2n}\eps^{-2} )$ for any $\eps > 0$. This last lower bound even applies for arbitrarily many sequential uses of the channel, as long as they are only interspersed with other unital operations.
Fichier principal
Vignette du fichier
PIT.pdf (537.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03953931 , version 1 (24-01-2023)

Licence

Attribution

Identifiers

  • HAL Id : hal-03953931 , version 1

Cite

Omar Fawzi, Aadil Oufkir, Daniel Stilck Franca. Lower Bounds on Learning Pauli Channels. 2023. ⟨hal-03953931⟩
29 View
41 Download

Share

Gmail Facebook X LinkedIn More