Quantum channel learning with limited parallel access
This work derives sample-complexity bounds for estimating entries of the transfer matrix/map to additive accuracy $\epsilon$ with success probability $\ge1-\delta$, under different resources: access to the complex-conjugate channel $\mathcal{E}^*$ and/or parallel access to $c$ copies.