Optimal classical shadow estimation of unitary channels at Heisenberg limit

Full tomography of an unknown quantum evolution is resource-intensive and often unnecessary when the goal is only to predict selected properties. This motivates the study of classical shadow estimation of unitary channels (CSEU), a task in which one queries an unknown d-dimensional unitary U and stores classical data that can later be used to predict expectation values tr\[O cdot UρU^dagger\] up to additive error varepsilon for arbitrary input states ρ and observables O. We propose a parallel, non-adaptive CSEU protocol using mathcal{O}\(dvarepsilon^-1\) queries when the input states or observables have constant rank. This achieves Heisenberg scaling with respect to varepsilon and is query-optimal, as we prove a matching Ω\(dvarepsilon^-1\) lower bound that remains valid even with stronger access to the unknown unitary. Our query-optimal CSEU protocol provides a versatile and powerful tool for quantum learning theory, pushing the performance limits of several fundamental learning tasks, including unitary channel tomography, Hamiltonian learning, boundary-regime quantum channel tomography, Pauli transfer matrix learning, inverse-free amplitude estimation, pure-state property estimation, and shallow-circuit learning. Remarkably, we show that optimal unitary channel tomography can be achieved using only parallel queries, closing the gap between the best achievable efficiency of parallel and sequential tomography protocols. Together, these applications establish our framework as a fundamental tool for learning properties of quantum processes, particularly for certain key tasks that require high precision.