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

Quantum-enhanced metrology with classical shadows

Luca Ion, Manuel Gessner

quant-phSubmitted Oct 26, 2026• Announced Oct 27, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks how much metrological sensitivity can be extracted from fixed, uniformly randomized local Pauli measurements, without tailoring the readout observable to the probe. It combines classical-shadow estimates of all Pauli strings up to weight $K$ using generalized least squares, assuming known moment responses and covariance near a working point. An exact single-shot shadow covariance $\Gamma$ defines the “shadow information” $\mathcal I_K=\boldsymbol s_K^T\Gamma_K^{-1}\boldsymbol s_K$, giving local estimator variance $1/(n\mathcal I_K)$. Bernstein bounds yield small-error sample complexity $O([\eta^2\mathcal I_K]^{-1}\log(1/\delta))$. For collective single-qubit phase encoding, covariance and added-noise arguments establish $\mathcal I_K\le F_{\rm cs}\le2NF_Q/(2N+F_Q)\le2N$, where $F_{\rm cs}$ describes the complete measurement record. Thus this readout cannot retain Heisenberg scaling. Product-state calculations and convexity give the tight separable moment-estimator benchmark $\mathcal I_K\le N/3$; exceeding it witnesses entanglement. Quantum improvement over this benchmark is bounded by a factor below six, and weight-one moments obey the stronger ceiling $\mathcal I_1\le N/2$. State-vector calculations for one-axis-twisted probes with $4\le N\le12$ and $K\le3$ demonstrate entanglement-enhanced sensitivity, with about 15% improvement at $N=12$, mostly accessible through linear moments. Higher-weight moments help more for non-Gaussian probes. The guarantees are local and exclude calibration and covariance-learning costs. Numerics do not simulate finite-shot records or calibration errors. The separate-measurement comparison uses equal allocation rather than optimized readout, and even the full Pauli-moment estimator need not attain the record’s Fisher information.

Little sign of AI-generated textStrong assumptionsMissing comparison

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

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

Variance reduction methods in the estimation of Pauli sums

Søren Fuglede Jørgensen, Rafael Emilio Barfknecht, Patrick Ettenhuber +1 more

Accurately estimating expectation values of quantum observables with as few measurements as possible is crucial to many quantum computing applications. We introduce a framework that covers many of existing measurement strategies and introduce heuristics that can be used to enhance randomized schemes, including those based on Pauli grouping with inverse probability weighting and variants of the classical shadow algorithm. We show how to maximize information gain from such schemes, while carefully optimizing the distribution of possible measurements, and show that simple grouping algorithms can get close to, and in some cases exceed, state-of-the-art accuracy for unbiased estimation of expectation values on a standard quantum chemistry benchmark. We show how these randomized methods may be compared to more recent measurement schemes, such as shadow grouping, derandomized shadow, and overlapped grouping measurement, we show how the same strategies can be used to augment these schemes, and we demonstrate that we can reduce measurement costs by up to a factor of two by allowing Clifford measurement circuits for otherwise Clifford-less methods.

quant-pharXiv:2603.20029•Mar 23, 2026•0 citations

Classical shadows based on locally-entangled measurements

Matteo Ippoliti

We study classical shadows protocols based on randomized measurements in n -qubit entangled bases, generalizing the random Pauli measurement protocol ( n=1 ). We show that entangled measurements ( n≥2 ) enable nontrivial and potentially advantageous trade-offs in the sample complexity of learning Pauli expectation values. This is sharply illustrated by shadows based on two-qubit Bell measurements: the scaling of sample complexity with Pauli weight k improves quadratically (from ∼3k down to ∼3k/2 ) for many operators, while others become impossible to learn. Tuning the amount of entanglement in the measurement bases defines a family of protocols that interpolate between Pauli and Bell shadows, retaining some of the benefits of both. For large n , we show that randomized measurements in n -qubit GHZ bases further improve the best scaling to ∼(3/2)k , albeit on an increasingly restricted set of operators. Despite their simplicity and lower hardware requirements, these protocols can match or outperform recently-introduced "shallow shadows" in some practically-relevant Pauli estimation tasks.

arXiv:2305.10723•Quantum•Mar 21, 2024•20 citations

Real Classical Shadows with Noise

Atharva Hingane, Dax Enshan Koh

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.

quant-pharXiv:2608.18935•Aug 20, 2026•0 citations

Demonstration of robust and efficient quantum property learning with shallow shadows

Hong-Ye Hu, Andi Gu, Swarnadeep Majumder +7 more

Extracting information efficiently from quantum systems is crucial for quantum information processing. Classical shadows enable predicting many properties of arbitrary quantum states using few measurements. While random single-qubit measurements are experimentally friendly and suitable for learning low-weight Pauli observables, they perform poorly for nonlocal observables. Introducing a shallow random quantum circuit before measurements improves sample efficiency for high-weight Pauli observables and low-rank properties. However, in practice, these circuits can be noisy and bias the measurement results. Here, we propose the robust shallow shadows, which employs Bayesian inference to learn and mitigate noise in postprocessing. We analyze noise effects on sample complexity and the optimal circuit depth. We provide theoretical guarantees for the success of error mitigation under a wide class of noise processes. Experimental validation on a superconducting quantum processor confirms the advantage of our method, even in the presence of realistic noise, over single-qubit measurements for predicting diverse state properties, such as fidelity and entanglement entropy. Our protocol thus offers a scalable, robust, and sample-efficient method for quantum state characterization on near-term quantum devices. Fast and reliable characterisation of quantum systems is a key part of quantum technologies development. Here, the authors propose and demonstrate a way to embed noise characterisation in classical shadow estimation of nonlocal properties, enabling an efficient way to extract information from noisy quantum systems.

arXiv:2402.17911•Nature Communications•Mar 26, 2025•28 citations

Instance-optimal high-precision shadow tomography with few-copy measurements: A metrological approach

Senrui Chen, Weiyuan Gong, Sisi Zhou

We study the sample complexity of shadow tomography in the high-precision regime under realistic measurement constraints. Given an unknown $d$-dimensional quantum state $ρ$ and a known set of observables $\{O_i\}_{i=1}^m$, the goal is to estimate expectation values $\{\mathrm{tr}(O_iρ)\}_{i=1}^m$ to accuracy $ε$ in $L_p$-norm, using possibly adaptive measurements that act on $O(\mathrm{polylog}(d))$ number of copies of $ρ$ at a time. We focus on the regime where $ε$ is below an instance-dependent threshold. Our main contribution is an instance-optimal characterization of the sample complexity as $\tildeΘ(Γ_p/ε^2)$, where $Γ_p$ is a function of $\{O_i\}_{i=1}^m$ defined via an optimization formula involving the inverse Fisher information matrix. Previously, tight bounds were known only in special cases, e.g. Pauli shadow tomography with $L_\infty$-norm error. Concretely, we first analyze a simpler oblivious variant where the goal is to estimate an observable of the form $\sum_{i=1}^m α_i O_i$ with $\|α\|_q = 1$ (where $q$ is dual to $p$) revealed after the measurement. For single-copy measurements, we obtain a sample complexity of $Θ(Γ^{\mathrm{ob}}_p/ε^2)$. We then show $\tildeΘ(Γ_p/ε^2)$ is necessary and sufficient for the original problem, with the lower bound applying to unbiased, bounded estimators. Our upper bounds rely on a two-step algorithm combining coarse tomography with local estimation. Notably, $Γ^{\mathrm{ob}}_\infty = Γ_\infty$. In both cases, allowing $c$-copy measurements improves the sample complexity by at most $Ω(1/c)$. Our results establish a quantitative correspondence between quantum learning and metrology, unifying asymptotic metrological limits with finite-sample learning guarantees.

quant-pharXiv:2602.04952•Feb 6, 2026•0 citations
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.
The paper asks how much metrological sensitivity can be extracted from fixed, uniformly randomized local Pauli measurements, without tailoring the readout observable to the probe. It combines classical-shadow estimates of all Pauli strings up to weight KKK using generalized least squares, assuming known moment responses and covariance near a working point.
An exact single-shot shadow covariance Γ\GammaΓ defines the “shadow information” IK=sKTΓK−1sK\mathcal I_K=\boldsymbol s_K^T\Gamma_K^{-1}\boldsymbol s_KIK​=sKT​ΓK−1​sK​, giving local estimator variance 1/(nIK)1/(n\mathcal I_K)1/(nIK​). Bernstein bounds yield small-error sample complexity O([η2IK]−1log⁡(1/δ))O([\eta^2\mathcal I_K]^{-1}\log(1/\delta))O([η2IK​]−1log(1/δ)). For collective single-qubit phase encoding, covariance and added-noise arguments establish IK≤Fcs≤2NFQ/(2N+FQ)≤2N\mathcal I_K\le F_{\rm cs}\le2NF_Q/(2N+F_Q)\le2NIK​≤Fcs​≤2NFQ​/(2N+FQ​)≤2N, where FcsF_{\rm cs}Fcs​ describes the complete measurement record. Thus this readout cannot retain Heisenberg scaling. Product-state calculations and convexity give the tight separable moment-estimator benchmark IK≤N/3\mathcal I_K\le N/3IK​≤N/3; exceeding it witnesses entanglement. Quantum improvement over this benchmark is bounded by a factor below six, and weight-one moments obey the stronger ceiling I1≤N/2\mathcal I_1\le N/2I1​≤N/2.
State-vector calculations for one-axis-twisted probes with 4≤N≤124\le N\le124≤N≤12 and K≤3K\le3K≤3 demonstrate entanglement-enhanced sensitivity, with about 15% improvement at N=12N=12N=12, mostly accessible through linear moments. Higher-weight moments help more for non-Gaussian probes.
The guarantees are local and exclude calibration and covariance-learning costs. Numerics do not simulate finite-shot records or calibration errors. The separate-measurement comparison uses equal allocation rather than optimized readout, and even the full Pauli-moment estimator need not attain the record’s Fisher information.
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.
Accurately estimating expectation values of quantum observables with as few measurements as possible is crucial to many quantum computing applications. We introduce a framework that covers many of existing measurement strategies and introduce heuristics that can be used to enhance randomized schemes, including those based on Pauli grouping with inverse probability weighting and variants of the classical shadow algorithm. We show how to maximize information gain from such schemes, while carefully optimizing the distribution of possible measurements, and show that simple grouping algorithms can get close to, and in some cases exceed, state-of-the-art accuracy for unbiased estimation of expectation values on a standard quantum chemistry benchmark. We show how these randomized methods may be compared to more recent measurement schemes, such as shadow grouping, derandomized shadow, and overlapped grouping measurement, we show how the same strategies can be used to augment these schemes, and we demonstrate that we can reduce measurement costs by up to a factor of two by allowing Clifford measurement circuits for otherwise Clifford-less methods.
We study classical shadows protocols based on randomized measurements in n -qubit entangled bases, generalizing the random Pauli measurement protocol ( n=1 ). We show that entangled measurements ( n≥2 ) enable nontrivial and potentially advantageous trade-offs in the sample complexity of learning Pauli expectation values. This is sharply illustrated by shadows based on two-qubit Bell measurements: the scaling of sample complexity with Pauli weight k improves quadratically (from ∼3k down to ∼3k/2 ) for many operators, while others become impossible to learn. Tuning the amount of entanglement in the measurement bases defines a family of protocols that interpolate between Pauli and Bell shadows, retaining some of the benefits of both. For large n , we show that randomized measurements in n -qubit GHZ bases further improve the best scaling to ∼(3/2)k , albeit on an increasingly restricted set of operators. Despite their simplicity and lower hardware requirements, these protocols can match or outperform recently-introduced "shallow shadows" in some practically-relevant Pauli estimation tasks.
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.
Extracting information efficiently from quantum systems is crucial for quantum information processing. Classical shadows enable predicting many properties of arbitrary quantum states using few measurements. While random single-qubit measurements are experimentally friendly and suitable for learning low-weight Pauli observables, they perform poorly for nonlocal observables. Introducing a shallow random quantum circuit before measurements improves sample efficiency for high-weight Pauli observables and low-rank properties. However, in practice, these circuits can be noisy and bias the measurement results. Here, we propose the robust shallow shadows, which employs Bayesian inference to learn and mitigate noise in postprocessing. We analyze noise effects on sample complexity and the optimal circuit depth. We provide theoretical guarantees for the success of error mitigation under a wide class of noise processes. Experimental validation on a superconducting quantum processor confirms the advantage of our method, even in the presence of realistic noise, over single-qubit measurements for predicting diverse state properties, such as fidelity and entanglement entropy. Our protocol thus offers a scalable, robust, and sample-efficient method for quantum state characterization on near-term quantum devices. Fast and reliable characterisation of quantum systems is a key part of quantum technologies development. Here, the authors propose and demonstrate a way to embed noise characterisation in classical shadow estimation of nonlocal properties, enabling an efficient way to extract information from noisy quantum systems.
We study the sample complexity of shadow tomography in the high-precision regime under realistic measurement constraints. Given an unknown ddd-dimensional quantum state ρρρ and a known set of observables {Oi}i=1m\{O_i\}_{i=1}^m{Oi​}i=1m​, the goal is to estimate expectation values {tr(Oiρ)}i=1m\{\mathrm{tr}(O_iρ)\}_{i=1}^m{tr(Oi​ρ)}i=1m​ to accuracy εεε in LpL_pLp​-norm, using possibly adaptive measurements that act on O(polylog(d))O(\mathrm{polylog}(d))O(polylog(d)) number of copies of ρρρ at a time. We focus on the regime where εεε is below an instance-dependent threshold. Our main contribution is an instance-optimal characterization of the sample complexity as Θ~(Γp/ε2)\tildeΘ(Γ_p/ε^2)Θ~(Γp​/ε2), where ΓpΓ_pΓp​ is a function of {Oi}i=1m\{O_i\}_{i=1}^m{Oi​}i=1m​ defined via an optimization formula involving the inverse Fisher information matrix. Previously, tight bounds were known only in special cases, e.g. Pauli shadow tomography with L∞L_\inftyL∞​-norm error. Concretely, we first analyze a simpler oblivious variant where the goal is to estimate an observable of the form ∑i=1mαiOi\sum_{i=1}^m α_i O_i∑i=1m​αi​Oi​ with ∥α∥q=1\|α\|_q = 1∥α∥q​=1 (where qqq is dual to ppp) revealed after the measurement. For single-copy measurements, we obtain a sample complexity of Θ(Γpob/ε2)Θ(Γ^{\mathrm{ob}}_p/ε^2)Θ(Γpob​/ε2). We then show Θ~(Γp/ε2)\tildeΘ(Γ_p/ε^2)Θ~(Γp​/ε2) is necessary and sufficient for the original problem, with the lower bound applying to unbiased, bounded estimators. Our upper bounds rely on a two-step algorithm combining coarse tomography with local estimation. Notably, Γ∞ob=Γ∞Γ^{\mathrm{ob}}_\infty = Γ_\inftyΓ∞ob​=Γ∞​. In both cases, allowing ccc-copy measurements improves the sample complexity by at most Ω(1/c)Ω(1/c)Ω(1/c). Our results establish a quantitative correspondence between quantum learning and metrology, unifying asymptotic metrological limits with finite-sample learning guarantees.