Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Predicting Features of Quantum Systems using Classical Shadows.

Hsin-Yuan Huang, Richard Kueng

Published Aug 23, 2019• 4 citations
OpenAlex

Related papers

Learning quantum states from their classical shadows

Hsin-Yuan Huang

Nature Reviews Physics•Jan 10, 2022•45 citations

Predicting Features of Quantum Systems from Very Few Measurements

Hsin-Yuan Huang, Richard Kueng

Predicting features of complex, large-scale quantum systems is essential to the characterization and engineering of quantum architectures. We present an efficient approach for constructing an approximate classical description, called the classical shadow, of a quantum system from very few quantum measurements that can later be used to predict a large collection of features. This approach is guaranteed to accurately predict M linear functions with bounded Hilbert-Schmidt norm from only order of log(M) measurements. This is completely independent of the system size and saturates fundamental lower bounds from information theory. We support our theoretical findings with numerical experiments over a wide range of problem sizes (2 to 162 qubits). These highlight advantages compared to existing machine learning approaches.

arXiv:1908.08909•Aug 23, 2019•14 citations

Classical shadows for non-iid quantum sources

Leonardo Zambrano

Classical shadow tomography has emerged as a powerful framework for predicting properties of quantum many-body systems with favorable sample complexity. Standard theoretical guarantees, however, rely on the assumption that experimental rounds are independent and identically distributed (i.i.d.). This idealization is often violated in practice, where parameter drift, environmental noise, and active feedback generate history-dependent sequences of states or channels. To address this, we introduce a robust classical shadow protocol based on a truncated mean estimator. We prove that its sample complexity for predicting properties of the time-averaged state or channel matches the standard i.i.d. scaling governed by the shadow norm, even when experimental rounds depend arbitrarily on the past. Our results establish the robustness of the shadow formalism beyond the i.i.d. regime.

quant-pharXiv:2603.05137•Mar 6, 2026•3 citations

Quantum Simulations of Classical Systems

Rolando D. Somma, Gerardo Ortíz, Cristian D. Batista +1 more

Bulletin of the American Physical Society•Mar 8, 2007•0 citations

Quantum Circuit Cutting for Classical Shadows

Daniel T. Chen, Zain H. Saleem, Michael A. Perlin

Classical shadow tomography is a sample-efficient technique for characterizing quantum systems and predicting many of their properties. Circuit cutting is a technique for dividing large quantum circuits into smaller fragments that can be executed more robustly using fewer quantum resources. We introduce a divide-and-conquer circuit cutting method for estimating the expectation values of observables using classical shadows. We derive a general formula for making predictions using the classical shadows of circuit fragments from arbitrarily cut circuits and provide the sample complexity analysis for the case when observables factorize across fragments. Then, we numerically show that our divide-and-conquer method outperforms traditional uncut shadow tomography when estimating high-weight observables that act non-trivially on many qubits and discuss the mechanisms for this advantage.

arXiv:2212.00761•ACM Transactions on Quantum Computing•May 21, 2024•13 citations

IDENTIFICATION OF QUANTUM SYSTEMS

Robert L. Kosut, HERSCHEL A. RABITZ

IFAC Proceedings Volumes•Jan 1, 2002•10 citations
Predicting features of complex, large-scale quantum systems is essential to the characterization and engineering of quantum architectures. We present an efficient approach for constructing an approximate classical description, called the classical shadow, of a quantum system from very few quantum measurements that can later be used to predict a large collection of features. This approach is guaranteed to accurately predict M linear functions with bounded Hilbert-Schmidt norm from only order of log(M) measurements. This is completely independent of the system size and saturates fundamental lower bounds from information theory. We support our theoretical findings with numerical experiments over a wide range of problem sizes (2 to 162 qubits). These highlight advantages compared to existing machine learning approaches.
Classical shadow tomography has emerged as a powerful framework for predicting properties of quantum many-body systems with favorable sample complexity. Standard theoretical guarantees, however, rely on the assumption that experimental rounds are independent and identically distributed (i.i.d.). This idealization is often violated in practice, where parameter drift, environmental noise, and active feedback generate history-dependent sequences of states or channels. To address this, we introduce a robust classical shadow protocol based on a truncated mean estimator. We prove that its sample complexity for predicting properties of the time-averaged state or channel matches the standard i.i.d. scaling governed by the shadow norm, even when experimental rounds depend arbitrarily on the past. Our results establish the robustness of the shadow formalism beyond the i.i.d. regime.
Classical shadow tomography is a sample-efficient technique for characterizing quantum systems and predicting many of their properties. Circuit cutting is a technique for dividing large quantum circuits into smaller fragments that can be executed more robustly using fewer quantum resources. We introduce a divide-and-conquer circuit cutting method for estimating the expectation values of observables using classical shadows. We derive a general formula for making predictions using the classical shadows of circuit fragments from arbitrarily cut circuits and provide the sample complexity analysis for the case when observables factorize across fragments. Then, we numerically show that our divide-and-conquer method outperforms traditional uncut shadow tomography when estimating high-weight observables that act non-trivially on many qubits and discuss the mechanisms for this advantage.