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:2608.18935

Real Classical Shadows with Noise

Atharva Hingane, Dax Enshan Koh

On Aqora:Koh Enshan, DaxKoh Enshan, Dax
quant-phmath-phSubmitted Aug 19, 2026• Announced Aug 20, 2026• 1 citation
arXivHTMLPDF

Abstract

The real classical shadows protocol of West et al. replaces the unitary (Clifford) ensemble of the Huang--Kueng--Preskill scheme by the orthogonal (real Clifford) ensemble, and for symmetric observables achieves strictly smaller estimator variances: a factor approaching two for global evolution and an exponential factor $(3/2)^k$ for $k$-local real Pauli observables. Real hardware, however, never implements the ideal evolution. Building on the noisy classical shadows framework of Koh and Grewal, we give a complete theory of the real classical shadows protocol in the presence of a known completely positive trace-preserving noise channel acting after the orthogonal evolution. We derive the noisy global and local orthogonal shadow channels from first principles using the Weingarten calculus of the orthogonal group, prove that each is a depolarizing channel acting on the symmetric (respectively locally symmetric) component of its input, and derive from it the exact single-shot variance in closed form, together with the associated shadow seminorm, two-sided bounds on it, and the resulting sample-complexity guarantees. We prove that the noiseless sample-complexity advantages survive intact under noise. Because the variances are exact rather than bounded, the ratio is controlled by a single dimensionless parameter, which gives a closed-form criterion for when the factor of two is attainable: both the second-moment and the variance ratio reach it exactly when the observable's norm profile grows, and the noise enters that limit only through a factor lying within $2/(d+2)$ of two, so the advantage is uniform in the noise. For rank-one targets it is provably unattainable, saturating strictly below two. The local real-Pauli advantage remains $(3/2)^k$. We treat complex measurement bases through a reality parameter and a transposed-noise scalar, recovering unitary shadows in the appropriate limit.

Comments
70 pages, 10 figures

Related papers

Classical Shadows With Noise

Dax Enshan Koh, Sabee Grewal

The classical shadows protocol, recently introduced by Huang, Kueng, and Preskill [Nat. Phys. 16, 1050 (2020)], is a quantum-classical protocol to estimate properties of an unknown quantum state. Unlike full quantum state tomography, the protocol can be implemented on near-term quantum hardware and requires few quantum measurements to make many predictions with a high success probability. In this paper, we study the effects of noise on the classical shadows protocol. In particular, we consider the scenario in which the quantum circuits involved in the protocol are subject to various known noise channels and derive an analytical upper bound for the sample complexity in terms of a shadow seminorm for both local and global noise. Additionally, by modifying the classical post-processing step of the noiseless protocol, we define a new estimator that remains unbiased in the presence of noise. As applications, we show that our results can be used to prove rigorous sample complexity upper bounds in the cases of depolarizing noise and amplitude damping.

arXiv:2011.11580•Quantum•Aug 16, 2022•130 citations

Quantum-enhanced metrology with classical shadows

Luca Ion, Manuel Gessner

Quantum metrology relies on observables that maximize information about the parameter of interest, but are often hard to access. We develop a protocol that combines Pauli moments estimated from a fixed ensemble of randomized local measurements into an optimized method-of-moments estimator. For local Pauli classical shadows, we derive the shadow information which determines estimator variance and sample-complexity guarantees. Identifying the separable-state sensitivity limit, we show that entanglement can lead to a constant-factor sensitivity enhancement, as illustrated with one-axis-twisted probes. This protocol allows for efficient circuit-based metrology without choosing an observable.

quant-pharXiv:2610.35632•Oct 27, 2026•0 citations

Classical shadows with Pauli-invariant unitary ensembles

Kaifeng Bu, Dax Enshan Koh, Roy J. Garcia +1 more

Abstract Classical shadows provide a noise-resilient and sample-efficient method for learning quantum system properties, relying on a user-specified unitary ensemble. What is the weakest assumption on this ensemble that can still yield meaningful results? To address this, we focus on Pauli-invariant unitary ensembles—those invariant under multiplication by Pauli operators. For these ensembles, we present explicit formulas for the reconstruction map and sample complexity bounds and extend our results to the case when noise impacts the protocol implementation. Two applications are explored: one for locally scrambled unitary ensembles, where we present formulas for the reconstruction map and sample complexity bounds that circumvent the need to solve an exponential-sized linear system, and another for the classical shadows of quantum channels. Our results establish a unified framework for classical shadows with Pauli-invariant unitary ensembles, applicable to both noisy and noiseless scenarios for states and channels and primed for implementation on near-term quantum devices.

arXiv:2202.03272•npj Quantum Information•Jan 8, 2024•66 citations

Sample Complexity for Embedded Multipartite Entanglement Witness via Pauli and Clifford Classical Shadows

Ziran Zhang

Detecting multipartite entanglement in many qubit systems is measurement-intensive, motivating protocols that estimate only selected observables with provable efficiency. In this work we use the classical shadow protocol to study the sample complexity required to estimate a family of subsystem $n$-partite entanglement witness embedded in an larger $N$-qubit system. We derive ensemble dependent variance bounds that lead to qualitatively distinct scaling for the snapshots cost at fixed additive error $ε$ with numerical simulations confirm these trends, exhibiting a clear crossover from Pauli favorable performance for local witness to Clifford favorable performance as the witness becomes more global.

quant-pharXiv:2601.00859•Dec 31, 2025•0 citations

Exact Clifford Optimality for Two-Sided Locally Randomized Classical Shadows

Xiaotian Nie, Tao Zhang, Yadong Wu +1 more

Entangling measurements can reduce the cost of learning many-body correlations. We consider classical shadows in which a fixed unitary on a $k$-qubit region is sandwiched between two layers of random single-qubit Clifford gates, and ask which middle unitary best estimates Pauli strings with full support on the region. Combining symplectic support counting with a constraint from operator-size parity, we prove that within this architecture the minimum squared shadow norm over all Clifford middle unitaries is $C_k^{\rm opt}=4\cdot 9^k/(3\cdot 5^k+3^k-6)$ for odd $k$ and $C_k^{\rm opt}=4\cdot 9^k/(3\cdot 5^k-3^k+2)$ for even $k$. A dual-axis rotation circuit $U_*$ attains this minimum for every $k$. Asymptotically $C_k^{\rm opt}\simeq(4/3)\cdot(9/5)^k$: the exponential base of Wu et al.'s contractive unitary is optimal, and the prefactor improves from $2$ to $4/3$. For $1\leq k\leq7$, exact certificates show that $U_*$ is optimal over the entire unitary group $\mathrm U(2^k)$, and we conjecture that this holds for every $k$.

quant-pharXiv:2610.04621•Oct 6, 2026•0 citations

Closed-form analytic expressions for shadow estimation with brickwork circuits

Mirko Arienzo, Markus Heinrich, Ingo Roth +1 more

Properties of quantum systems can be estimated using classical shadows, which implement measurements based on random ensembles of unitaries. Originally derived for global Clifford unitaries and products of single-qubit Clifford gates, practical implementations are limited to the latter scheme for moderate numbers of qubits. Beyond local gates, the accurate implementation of very short random circuits with two-local gates is still experimentally feasible and, therefore, interesting for implementing measurements in near-term applications. In this work, we derive closed-form analytical expressions for shadow estimation using brickwork circuits with two layers of parallel two-local Haar-random (or Clifford) unitaries. Besides the construction of the classical shadow, our results give rise to sample-complexity guarantees for estimating Pauli observables.We then compare the performance of shadow estimation with brickwork circuits to the established approach using local Clifford unitaries and find improved sample complexity in the estimation of observables supported on sufficiently many qubits.

arXiv:2211.09835•Quantum Information and Computation•Sep 1, 2023•34 citations
The real classical shadows protocol of West et al. replaces the unitary (Clifford) ensemble of the Huang--Kueng--Preskill scheme by the orthogonal (real Clifford) ensemble, and for symmetric observables achieves strictly smaller estimator variances: a factor approaching two for global evolution and an exponential factor (3/2)k(3/2)^k(3/2)k for kkk-local real Pauli observables. Real hardware, however, never implements the ideal evolution. Building on the noisy classical shadows framework of Koh and Grewal, we give a complete theory of the real classical shadows protocol in the presence of a known completely positive trace-preserving noise channel acting after the orthogonal evolution. We derive the noisy global and local orthogonal shadow channels from first principles using the Weingarten calculus of the orthogonal group, prove that each is a depolarizing channel acting on the symmetric (respectively locally symmetric) component of its input, and derive from it the exact single-shot variance in closed form, together with the associated shadow seminorm, two-sided bounds on it, and the resulting sample-complexity guarantees. We prove that the noiseless sample-complexity advantages survive intact under noise. Because the variances are exact rather than bounded, the ratio is controlled by a single dimensionless parameter, which gives a closed-form criterion for when the factor of two is attainable: both the second-moment and the variance ratio reach it exactly when the observable's norm profile grows, and the noise enters that limit only through a factor lying within 2/(d+2)2/(d+2)2/(d+2) of two, so the advantage is uniform in the noise. For rank-one targets it is provably unattainable, saturating strictly below two. The local real-Pauli advantage remains (3/2)k(3/2)^k(3/2)k. We treat complex measurement bases through a reality parameter and a transposed-noise scalar, recovering unitary shadows in the appropriate limit.
The classical shadows protocol, recently introduced by Huang, Kueng, and Preskill [Nat. Phys. 16, 1050 (2020)], is a quantum-classical protocol to estimate properties of an unknown quantum state. Unlike full quantum state tomography, the protocol can be implemented on near-term quantum hardware and requires few quantum measurements to make many predictions with a high success probability. In this paper, we study the effects of noise on the classical shadows protocol. In particular, we consider the scenario in which the quantum circuits involved in the protocol are subject to various known noise channels and derive an analytical upper bound for the sample complexity in terms of a shadow seminorm for both local and global noise. Additionally, by modifying the classical post-processing step of the noiseless protocol, we define a new estimator that remains unbiased in the presence of noise. As applications, we show that our results can be used to prove rigorous sample complexity upper bounds in the cases of depolarizing noise and amplitude damping.
Quantum metrology relies on observables that maximize information about the parameter of interest, but are often hard to access. We develop a protocol that combines Pauli moments estimated from a fixed ensemble of randomized local measurements into an optimized method-of-moments estimator. For local Pauli classical shadows, we derive the shadow information which determines estimator variance and sample-complexity guarantees. Identifying the separable-state sensitivity limit, we show that entanglement can lead to a constant-factor sensitivity enhancement, as illustrated with one-axis-twisted probes. This protocol allows for efficient circuit-based metrology without choosing an observable.
Abstract Classical shadows provide a noise-resilient and sample-efficient method for learning quantum system properties, relying on a user-specified unitary ensemble. What is the weakest assumption on this ensemble that can still yield meaningful results? To address this, we focus on Pauli-invariant unitary ensembles—those invariant under multiplication by Pauli operators. For these ensembles, we present explicit formulas for the reconstruction map and sample complexity bounds and extend our results to the case when noise impacts the protocol implementation. Two applications are explored: one for locally scrambled unitary ensembles, where we present formulas for the reconstruction map and sample complexity bounds that circumvent the need to solve an exponential-sized linear system, and another for the classical shadows of quantum channels. Our results establish a unified framework for classical shadows with Pauli-invariant unitary ensembles, applicable to both noisy and noiseless scenarios for states and channels and primed for implementation on near-term quantum devices.
Detecting multipartite entanglement in many qubit systems is measurement-intensive, motivating protocols that estimate only selected observables with provable efficiency. In this work we use the classical shadow protocol to study the sample complexity required to estimate a family of subsystem nnn-partite entanglement witness embedded in an larger NNN-qubit system. We derive ensemble dependent variance bounds that lead to qualitatively distinct scaling for the snapshots cost at fixed additive error εεε with numerical simulations confirm these trends, exhibiting a clear crossover from Pauli favorable performance for local witness to Clifford favorable performance as the witness becomes more global.
Entangling measurements can reduce the cost of learning many-body correlations. We consider classical shadows in which a fixed unitary on a kkk-qubit region is sandwiched between two layers of random single-qubit Clifford gates, and ask which middle unitary best estimates Pauli strings with full support on the region. Combining symplectic support counting with a constraint from operator-size parity, we prove that within this architecture the minimum squared shadow norm over all Clifford middle unitaries is Ckopt=4⋅9k/(3⋅5k+3k−6)C_k^{\rm opt}=4\cdot 9^k/(3\cdot 5^k+3^k-6)Ckopt​=4⋅9k/(3⋅5k+3k−6) for odd kkk and Ckopt=4⋅9k/(3⋅5k−3k+2)C_k^{\rm opt}=4\cdot 9^k/(3\cdot 5^k-3^k+2)Ckopt​=4⋅9k/(3⋅5k−3k+2) for even kkk. A dual-axis rotation circuit U∗U_*U∗​ attains this minimum for every kkk. Asymptotically Ckopt≃(4/3)⋅(9/5)kC_k^{\rm opt}\simeq(4/3)\cdot(9/5)^kCkopt​≃(4/3)⋅(9/5)k: the exponential base of Wu et al.'s contractive unitary is optimal, and the prefactor improves from 222 to 4/34/34/3. For 1≤k≤71\leq k\leq71≤k≤7, exact certificates show that U∗U_*U∗​ is optimal over the entire unitary group U(2k)\mathrm U(2^k)U(2k), and we conjecture that this holds for every kkk.
Properties of quantum systems can be estimated using classical shadows, which implement measurements based on random ensembles of unitaries. Originally derived for global Clifford unitaries and products of single-qubit Clifford gates, practical implementations are limited to the latter scheme for moderate numbers of qubits. Beyond local gates, the accurate implementation of very short random circuits with two-local gates is still experimentally feasible and, therefore, interesting for implementing measurements in near-term applications. In this work, we derive closed-form analytical expressions for shadow estimation using brickwork circuits with two layers of parallel two-local Haar-random (or Clifford) unitaries. Besides the construction of the classical shadow, our results give rise to sample-complexity guarantees for estimating Pauli observables.We then compare the performance of shadow estimation with brickwork circuits to the established approach using local Clifford unitaries and find improved sample complexity in the estimation of observables supported on sufficiently many qubits.