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

arXiv:2309.08426 · Journal of Mathematical Physics

Classical shadows meet quantum optimal mass transport

Giacomo De Palma, Tristan Klein, Davide Pastorello

Published Sep 1, 2024• 8 citations
arXivHTMLPDF

Abstract

Classical shadows constitute a protocol to estimate the expectation values of a collection of M observables acting on O(1) qubits of an unknown n-qubit state with a number of measurements that is independent of n and that grows only logarithmically with M. We propose a local variant of the quantum Wasserstein distance of order 1 of De Palma et al. [IEEE Trans. Inf. Theory 67, 6627–6643 (2021)] and prove that the classical shadow obtained measuring O(log n) copies of the state to be learned constitutes an accurate estimate with respect to the proposed distance. We apply the results to quantum generative adversarial networks, showing that quantum access to the state to be learned can be useful only when some prior information on such state is available.

DOI
10.1063/5.0178897

Related papers

Nearly Query-Optimal Classical Shadow Estimation of Unitary Channels

Zihao Li, Changhao Yi, You Zhou +1 more

Classical shadow estimation (CSE) is a powerful tool for learning the properties of quantum states and quantum processes. Here we consider the CSE task for quantum unitary channels. By querying an unknown unitary channel U multiple times in quantum experiments, the goal is to learn a classical description from which one can accurately predict many different linear properties of the channel, i.e., the expectation values of arbitrary observables measured on the output of U upon arbitrary input states. Based on collective measurements on multiple systems, we propose a query-efficient protocol for this task, whose query complexity has a quadratic advantage over the previous best approach for this problem, and almost saturates the information-theoretic lower bound. To further enhance practicality, we also present a variant protocol using only single-copy measurements, which still offers much better query performance than previous protocols that do not use quantum memory, and can serve as a key subroutine for learning an arbitrary unknown Hamiltonian from dynamics. In addition to linear properties of unitary channels, our protocol can also be applied to simultaneously predict many nonlinear properties, such as out-of-time-ordered correlators.

arXiv:2410.14538•PRX Quantum•Aug 1, 2025•6 citations

Classical shadows over symmetric spaces

Rebecca Chang, Maureen Krumtünger, Martin Larocca +1 more

Efficiently learning expectation values of unknown quantum states via classical shadows has become an important primitive in both theoretical and experimental aspects of quantum computation. Typically, classical shadow protocols involve randomised measurements induced by sampling uniformly randomly from a compact group, a situation which is now quite well understood. In this work we go beyond this standard assumption, studying the classical shadow protocols occasioned by sampling uniformly randomly from the so-called compact symmetric spaces. We uncover a unifying theory of such protocols, extending the extent to which the general theory of classical shadows is understood at a mathematical level. Interestingly, for the estimation of observables sampled from certain distributions we further find that some of these protocols allow for slight improvements in sample-complexity over existing shadow schemes. As part of our technical analysis we obtain $\varepsilon$-approximate relative-error $k$-designs over the $n$-qubit symplectic group in depth $\mathcal{O}(nk+\log(1/\varepsilon))$, which is optimal with respect to $n$, and may be of some independent interest.

quant-pharXiv:2605.05518•May 8, 2026•4 citations

Shadow measurements for feedback-based quantum optimization

Letícia Bertuzzi, João P. Engster, Evandro C. R. Rosa +1 more

Improving the performance of quantum algorithms is a fundamental task to achieve quantum advantage. In many cases, extracting information from quantum systems poses an important challenge for practical implementations of real-world quantum computers, given the high resource cost of performing state tomography. In this scenario, randomized measurements have emerged as a promising tool. In particular, the classical shadow protocol allows one to retrieve expected values of low-weight Pauli observables by performing only local measurements. In this paper, we present an implementation of the recently introduced feedback-based algorithm for quantum optimization using the Ket quantum programming platform to solve the MaxCut optimization problem. We employ classical shadows for the feedback routine of parameter estimation and compare this approach with the direct estimation of observables. Our results show that depending on the graph geometry of the MaxCut problem, the number of measurements required to estimate expected values of observables with classical shadows can be up to 16 times lower than with direct-observable estimation. Furthermore, by analyzing complete graphs, we numerically confirm logarithmic growth in the required number of measurements relative to the number of observables, reinforcing that classical shadows can be a useful tool for estimating low-locality Pauli observables in quantum algorithms.

arXiv:2502.20366•Physical Review A•Jul 28, 2025•5 citations

Improving shadow estimation with locally-optimal dual frames

Keijo Korhonen, Stefano Mangini, Joonas Malmi +2 more

Accurate estimation of observables in quantum systems is a central challenge in quantum information science, yet practical implementations are fundamentally constrained by the limited number of measurement shots. In this work we explore a variation of the classical shadows protocol in which the measurements are kept local while allowing the resulting classical shadows themselves to be correlated. By constructing locally optimal shadows, we obtain unbiased estimators that are competitive with state-of-the-art methods in terms of measurement overhead, while requiring only single-qubit measurements and allowing for the estimation of any observable in pure post-processing, reducing estimation errors by orders of magnitude over standard classical shadows. We validate our approach through numerical experiments on molecular Hamiltonians with up to 40 qubits consistently observing significant reductions in estimation errors, including for estimations of multiple chemically relevant observables simultaneously.

quant-pharXiv:2511.02555•Physical Review A•Nov 5, 2025•4 citations

Principal eigenstate classical shadows

Daniel Grier, Hakop Pashayan, Luke Schaeffer

Given many copies of an unknown quantum state $ρ$, we consider the task of learning a classical description of its principal eigenstate. Namely, assuming that $ρ$ has an eigenstate $|ϕ\rangle$ with (unknown) eigenvalue $λ> 1/2$, the goal is to learn a (classical shadows style) classical description of $|ϕ\rangle$ which can later be used to estimate expectation values $\langle ϕ|O| ϕ\rangle$ for any $O$ in some class of observables. We consider the sample-complexity setting in which generating a copy of $ρ$ is expensive, but joint measurements on many copies of the state are possible. We present a protocol for this task scaling with the principal eigenvalue $λ$ and show that it is optimal within a space of natural approaches, e.g., applying quantum state purification followed by a single-copy classical shadows scheme. Furthermore, when $λ$ is sufficiently close to $1$, the performance of our algorithm is optimal--matching the sample complexity for pure state classical shadows.

arXiv:2405.13939•May 22, 2024•8 citations

Dimension-Free Polylogarithmic Quantum Shadow Tomography

Fernando Granha Jeronimo, Qizhao Huang, Lenny Liu

Shadow Tomography is a fundamental problem in quantum information theory. Given multiple copies of an unknown $d$-dimensional quantum state $ρ$ and a known collection of observables $E_1,\ldots,E_M$, the goal is to estimate all expectation values $\{\text{Tr}(ρE_i)\}_{i=1}^M$ to additive accuracy $\varepsilon$ with probability at least $1-δ$. An elusive open question from the seminal shadow tomography work of Aaronson is whether this task admits a dimension-independent sample complexity with only polylogarithmic dependence on $M$, as suggested by the best-known lower bounds. In this work, we propose two different quantum protocols for shadow tomography with the best sample complexity \[ O\left( \frac{\log(M)\log(M/δ)}{\varepsilon^2} \right), \] which is polylogarithmic in the number of observables and independent of the dimension of the unknown state, thereby answering Aaronson's original question while also providing an exponential improvement in the prior best dimension independent sample complexity of shadow tomography from Sinha (STOC 2025) and, more recently, Chen, O'Donnell, Pelecanos, and Wright. Our approach first reduces the general shadow tomography problem to a finite-ensemble estimation problem via a minimax argument. We then develop an observable-independent protocol that repeatedly applies the pretty-good measurement while updating the prior distribution over the finite ensemble according to the measurement outcomes. A tail analysis of the resulting estimation error yields simultaneous accuracy guarantees for all observables and a cubic-logarithmic upper bound. We also introduce a refined recovery-label measurement for the same finite ensemble, which yields the bound in our main theorem.

quant-pharXiv:2608.06345•Aug 7, 2026•6 citations
Classical shadows constitute a protocol to estimate the expectation values of a collection of M observables acting on O(1) qubits of an unknown n-qubit state with a number of measurements that is independent of n and that grows only logarithmically with M. We propose a local variant of the quantum Wasserstein distance of order 1 of De Palma et al. [IEEE Trans. Inf. Theory 67, 6627–6643 (2021)] and prove that the classical shadow obtained measuring O(log n) copies of the state to be learned constitutes an accurate estimate with respect to the proposed distance. We apply the results to quantum generative adversarial networks, showing that quantum access to the state to be learned can be useful only when some prior information on such state is available.
Classical shadow estimation (CSE) is a powerful tool for learning the properties of quantum states and quantum processes. Here we consider the CSE task for quantum unitary channels. By querying an unknown unitary channel U multiple times in quantum experiments, the goal is to learn a classical description from which one can accurately predict many different linear properties of the channel, i.e., the expectation values of arbitrary observables measured on the output of U upon arbitrary input states. Based on collective measurements on multiple systems, we propose a query-efficient protocol for this task, whose query complexity has a quadratic advantage over the previous best approach for this problem, and almost saturates the information-theoretic lower bound. To further enhance practicality, we also present a variant protocol using only single-copy measurements, which still offers much better query performance than previous protocols that do not use quantum memory, and can serve as a key subroutine for learning an arbitrary unknown Hamiltonian from dynamics. In addition to linear properties of unitary channels, our protocol can also be applied to simultaneously predict many nonlinear properties, such as out-of-time-ordered correlators.
Efficiently learning expectation values of unknown quantum states via classical shadows has become an important primitive in both theoretical and experimental aspects of quantum computation. Typically, classical shadow protocols involve randomised measurements induced by sampling uniformly randomly from a compact group, a situation which is now quite well understood. In this work we go beyond this standard assumption, studying the classical shadow protocols occasioned by sampling uniformly randomly from the so-called compact symmetric spaces. We uncover a unifying theory of such protocols, extending the extent to which the general theory of classical shadows is understood at a mathematical level. Interestingly, for the estimation of observables sampled from certain distributions we further find that some of these protocols allow for slight improvements in sample-complexity over existing shadow schemes. As part of our technical analysis we obtain ε\varepsilonε-approximate relative-error kkk-designs over the nnn-qubit symplectic group in depth O(nk+log⁡(1/ε))\mathcal{O}(nk+\log(1/\varepsilon))O(nk+log(1/ε)), which is optimal with respect to nnn, and may be of some independent interest.
Improving the performance of quantum algorithms is a fundamental task to achieve quantum advantage. In many cases, extracting information from quantum systems poses an important challenge for practical implementations of real-world quantum computers, given the high resource cost of performing state tomography. In this scenario, randomized measurements have emerged as a promising tool. In particular, the classical shadow protocol allows one to retrieve expected values of low-weight Pauli observables by performing only local measurements. In this paper, we present an implementation of the recently introduced feedback-based algorithm for quantum optimization using the Ket quantum programming platform to solve the MaxCut optimization problem. We employ classical shadows for the feedback routine of parameter estimation and compare this approach with the direct estimation of observables. Our results show that depending on the graph geometry of the MaxCut problem, the number of measurements required to estimate expected values of observables with classical shadows can be up to 16 times lower than with direct-observable estimation. Furthermore, by analyzing complete graphs, we numerically confirm logarithmic growth in the required number of measurements relative to the number of observables, reinforcing that classical shadows can be a useful tool for estimating low-locality Pauli observables in quantum algorithms.
Accurate estimation of observables in quantum systems is a central challenge in quantum information science, yet practical implementations are fundamentally constrained by the limited number of measurement shots. In this work we explore a variation of the classical shadows protocol in which the measurements are kept local while allowing the resulting classical shadows themselves to be correlated. By constructing locally optimal shadows, we obtain unbiased estimators that are competitive with state-of-the-art methods in terms of measurement overhead, while requiring only single-qubit measurements and allowing for the estimation of any observable in pure post-processing, reducing estimation errors by orders of magnitude over standard classical shadows. We validate our approach through numerical experiments on molecular Hamiltonians with up to 40 qubits consistently observing significant reductions in estimation errors, including for estimations of multiple chemically relevant observables simultaneously.
Given many copies of an unknown quantum state ρρρ, we consider the task of learning a classical description of its principal eigenstate. Namely, assuming that ρρρ has an eigenstate ∣ϕ⟩|ϕ\rangle∣ϕ⟩ with (unknown) eigenvalue λ>1/2λ> 1/2λ>1/2, the goal is to learn a (classical shadows style) classical description of ∣ϕ⟩|ϕ\rangle∣ϕ⟩ which can later be used to estimate expectation values ⟨ϕ∣O∣ϕ⟩\langle ϕ|O| ϕ\rangle⟨ϕ∣O∣ϕ⟩ for any OOO in some class of observables. We consider the sample-complexity setting in which generating a copy of ρρρ is expensive, but joint measurements on many copies of the state are possible. We present a protocol for this task scaling with the principal eigenvalue λλλ and show that it is optimal within a space of natural approaches, e.g., applying quantum state purification followed by a single-copy classical shadows scheme. Furthermore, when λλλ is sufficiently close to 111, the performance of our algorithm is optimal--matching the sample complexity for pure state classical shadows.
Shadow Tomography is a fundamental problem in quantum information theory. Given multiple copies of an unknown ddd-dimensional quantum state ρρρ and a known collection of observables E1,…,EME_1,\ldots,E_ME1​,…,EM​, the goal is to estimate all expectation values {Tr(ρEi)}i=1M\{\text{Tr}(ρE_i)\}_{i=1}^M{Tr(ρEi​)}i=1M​ to additive accuracy ε\varepsilonε with probability at least 1−δ1-δ1−δ. An elusive open question from the seminal shadow tomography work of Aaronson is whether this task admits a dimension-independent sample complexity with only polylogarithmic dependence on MMM, as suggested by the best-known lower bounds. In this work, we propose two different quantum protocols for shadow tomography with the best sample complexity O(log⁡(M)log⁡(M/δ)ε2), O\left( \frac{\log(M)\log(M/δ)}{\varepsilon^2} \right), O(ε2log(M)log(M/δ)​), which is polylogarithmic in the number of observables and independent of the dimension of the unknown state, thereby answering Aaronson's original question while also providing an exponential improvement in the prior best dimension independent sample complexity of shadow tomography from Sinha (STOC 2025) and, more recently, Chen, O'Donnell, Pelecanos, and Wright. Our approach first reduces the general shadow tomography problem to a finite-ensemble estimation problem via a minimax argument. We then develop an observable-independent protocol that repeatedly applies the pretty-good measurement while updating the prior distribution over the finite ensemble according to the measurement outcomes. A tail analysis of the resulting estimation error yields simultaneous accuracy guarantees for all observables and a cubic-logarithmic upper bound. We also introduce a refined recovery-label measurement for the same finite ensemble, which yields the bound in our main theorem.