aiqbench analysis
This research presents a query-optimal protocol for classical shadow estimation of unitary channels, achieving Heisenberg scaling for predicting expectation values without full tomography. By establishing matching lower bounds, the study provides a versatile primitive that unifies and improves bounds for various quantum learning tasks, such as Hamiltonian learning. The work advances fundamental limits on resource-efficient characterization of unknown quantum evolutions.
Optimal classical shadow estimation of unitary channels at Heisenberg limit
arXiv:2606.13638v2 Announce Type: replace Abstract: 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 $\mathrm{tr}[O U\rho U^\dagger]$ for arbitrary input states $\rho$ and observables $O$. Here we propose a parallel and non-adaptive CSEU protocol that uses $\mathcal{O}(\min\{d\varepsilon^{-2},d^{3/2}\varepsilon^{-1}\})$ queries to $U$ when the observables have constant effective size. This achieves Heisenberg scaling with respect to the additive error $\varepsilon$ and is query-optimal, as we prove a matching lower bound $\Omega(\min\{d\varepsilon^{-2},d^{3/2}\varepsilon^{-1}\})$ for the query complexity, which remains valid even when stronger access to the unknown unitary is available. Our CSEU protocol is a versatile primitive with applications to several quantum learning tasks. In particular, it yields a near-optimal algorithm for learning an arbitrary Hamiltonian from its real-time evolution in the high-precision regime and recovers the best-known bounds for several tasks in a unified way.
Abstract: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 $\mathrm{tr}[O U\rho U^\dagger]$ for arbitrary input states $\rho$ and observables $O$. Here we propose a parallel and non-adaptive CSEU protocol that uses $\mathcal{O}(\min\{d\varepsilon^{-2},d^{3/2}\varepsilon^{-1}\})$ queries to $U$ when the observables have constant effective size. This achieves Heisenberg scaling with respect to the additive error $\varepsilon$ and is query-optimal, as we prove a matching lower bound $\Omega(\min\{d\varepsilon^{-2},d^{3/2}\varepsilon^{-1}\})$ for the query complexity, which remains valid even when stronger access to the unknown unitary is available. Our CSEU protocol is a versatile primitive with applications to several quantum learning tasks. In particular, it yields a near-optimal algorithm for learning an arbitrary Hamiltonian from its real-time evolution in the high-precision regime and recovers the best-known bounds for several tasks in a unified way.
arXiv:2606.13638 [quant-ph]
(or arXiv:2606.13638v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2606.13638 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 264 words
Related coverage
Optimal classical shadow estimation of unitary channels at Heisenberg limit
arXiv · Jun 12, 2026

Enhanced measurements on quantum computers via the simultaneous probing of non-commuting Pauli operators
Quantum Journal · Oct 7, 2026
Near-Optimal Learning of Local Lindbladians
arXiv · Jul 21, 2026

Quantum algorithms for general nonlinear dynamics based on the Carleman embedding
Quantum Journal · Oct 8, 2026