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

Classical Shadows with Selective GHZ Measurements

Nicolas Faroß, Marc Wanner, Pingal Pratyush Nath, Akshay Gaikwad, Anton Frisk Kockum, Devdatt Dubhashi

quant-phSubmitted Sep 30, 2026• Announced Oct 1, 2026• 0 citations
arXivHTMLPDF

Abstract

Classical shadows allow the prediction of many quantum-state properties from measurement data, but their efficiency strongly depends on the underlying measurement ensemble. We introduce selective GHZ measurement (SGM) shadows, which perform Greenberger-Horne-Zeilinger (GHZ)-basis measurements on randomly selected subsets of qubits and computational-basis measurements on their complement. The corresponding quantum circuits are practically feasible, with their number of CNOT gates scaling linearly with the number of qubits. This is in stark contrast to global Clifford circuits, which are generally difficult to implement. Varying the subset distribution allows tuning the SGM shadow protocol for different classes of observables with prescribed X/Y support, allowing us to outperform local Pauli as well as global Clifford shadows in certain scenarios. We determine the exact shadow channel and its inverse for arbitrary subset distributions and prove an explicit bound on the shadow norm using methods from discrete Fourier analysis and Markov semigroup theory. For natural choices of subset distributions, this gives a polynomial scaling for observables with fixed X/Y-locality. Numerical simulations of up to 50 qubits support the predicted improvements for nonlocal observables and long-range systems, and demonstrate the practical benefits of our protocol's generality by showing how the subset distributions can be tailored to settings such as fermionic modes under the Jordan-Wigner transformation.

AI Summary

The paper asks whether structured, nonlocal observables can be estimated with classical shadows using simpler circuits than global Clifford measurements. It introduces selective GHZ measurements: sample a qubit subset $s$ from a distribution $p$, measure it in one of two GHZ bases, and measure its complement computationally. Circuits use $O(|s|)$ CNOTs and admit logarithmic depth with suitable connectivity. The shadow channel is computed exactly. For a Pauli $P_{a,b}$ with $X/Y$-support mask $a$, its eigenvalue is $p(a)/2$ when $a\ne0$, and $(1+\widehat p(b))/2$ otherwise. Strictly positive $p$ therefore ensures invertibility. For Hermitian $A$ supported on masks in $S$, the main bound is $\|A\|_{\mathrm{sh}}^2\le(6+\pi)\max_{s\in S}p(s)^{-1}\|A\|_\infty^2$. The proof combines a Pauli-sector decomposition with discrete Fourier analysis and a reverse Poincaré inequality for a graph heat semigroup. Independent subset inclusion with probability $1/(n+1)$ gives $\|A\|_{\mathrm{sh}}^2\le(6+\pi)e n^k\|A\|_\infty^2$ when each Pauli term has at most $k$ $X/Y$ factors, irrespective of its $Z$ support. Complementary support classes also receive polynomial guarantees, covering exponentially many Pauli observables. Simulations up to 50 qubits examine nonlocal observables; fermionic reduced-density-matrix examples use tailored distributions and retain $O(n^{2k})$ scaling. The protocol does not uniformly outperform Pauli or Clifford shadows. Stated open issues include sharper bounds and constants, possible benefits from $p(0)=0$, noise robustness, limited-connectivity implementation costs, and identifying further applications.

Little sign of AI-generated textAI use disclosedOverclaimsMissing comparison
ChatGPT 5.6 Sol was used for searching the literature, proofreading, improving wording and developing proof ideas.

Error found: The abstract claims a shadow-channel inverse for arbitrary subset distributions, although distributions concentrated on the empty subset give a noninvertible channel; the body's inverse and main shadow-norm guarantees explicitly require additional assumptions.

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

Comments
53 pages, 4 figures

Related papers

Real classical shadows

Maxwell T. West, Antonio Anna Mele, Martín Larocca +1 more

Abstract Efficiently learning expectation values of a quantum state using classical shadow tomography has become a fundamental task in quantum information theory. In a classical shadows protocol, one measures a state in a chosen basis W after it has evolved under a unitary transformation randomly sampled from a chosen distribution U . In this work we study the case where U corresponds to either local or global orthogonal Clifford gates, and W consists of real-valued vectors. Our results show that for various situations of interest, this ‘real’ classical shadow protocol improves the sample complexity over the standard scheme based on general Clifford unitaries. For example, when one is interested in estimating the expectation values of arbitrary real-valued observables, global orthogonal Cliffords typically decrease the required number of samples by a factor of two. More dramatically, for k -local observables composed only of real-valued Pauli operators, sampling local orthogonal Cliffords leads to a reduction by an exponential-in- k factor in the sample complexity over local unitary Cliffords. Finally, we show that by measuring in a basis containing complex-valued vectors, orthogonal shadows can, in the limit of large system size, exactly reproduce the original unitary shadows protocol.

arXiv:2410.23481•Journal of Physics A Mathematical and Theoretical•Jun 2, 2025•25 citations

Scalable and Flexible Classical Shadow Tomography with Tensor Networks

Ahmed A. Akhtar, Hong-Ye Hu, Yi‐Zhuang You

Classical shadow tomography is a powerful randomized measurement protocol for predicting many properties of a quantum state with few measurements. Two classical shadow protocols have been extensively studied in the literature: the single-qubit (local) Pauli measurement, which is well suited for predicting local operators but inefficient for large operators; and the global Clifford measurement, which is efficient for low-rank operators but infeasible on near-term quantum devices due to the extensive gate overhead. In this work, we demonstrate a scalable classical shadow tomography approach for generic randomized measurements implemented with finite-depth local Clifford random unitary circuits, which interpolates between the limits of Pauli and Clifford measurements. The method combines the recently proposed locally-scrambled classical shadow tomography framework with tensor network techniques to achieve scalability for computing the classical shadow reconstruction map and evaluating various physical properties. The method enables classical shadow tomography to be performed on shallow quantum circuits with superior sample efficiency and minimal gate overhead and is friendly to noisy intermediate-scale quantum (NISQ) devices. We show that the shallow-circuit measurement protocol provides immediate, exponential advantages over the Pauli measurement protocol for predicting quasi-local operators. It also enables a more efficient fidelity estimation compared to the Pauli measurement.

arXiv:2209.02093•Quantum•Jun 1, 2023•76 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•30 citations

Finite-Sample Selected Covariance Spectra in Classical Shadows

Masahito Hayashi

Classical shadows use a single measurement snapshot to estimate many observables. These estimates are jointly distributed, and their covariance is not determined by their expectation values or individual variances. It also differs from physical correlations between observables because it depends on the measurement and reconstruction protocol. We study the covariance matrix for a fixed set of shadow estimates and its spectrum. For general shadow protocols, we give a finite-sample operator-norm bound for the empirical covariance computed using the sample mean. This bound also controls the eigenvalues and isolated spectral subspaces of the covariance matrix. For local product shadow protocols with fixed local dimension, observables supported on a bounded number of sites lead to bounds that do not depend on the total system size, provided that the number of selected observables and the relevant local reconstruction factors remain bounded. For biased local Pauli shadows, we obtain explicit finite-sample bounds and an exact covariance formula determined by Pauli compatibility and local basis probabilities. A comparison with global Clifford shadows shows that dimension-independent covariance estimation depends on the measurement protocol and does not follow from the general theory alone.

quant-pharXiv:2606.00527•Jun 2, 2026•1 citation

Efficient sampling for Pauli-measurement-based shadow tomography in direct fidelity estimation

Hyun-Ho Cha, Jungwoo Lee

A constant number of random Clifford measurements allows the classical shadow protocol to perform direct fidelity estimation (DFE) with high precision. However, estimating properties of an unknown quantum state is expected to be more feasible with random Pauli measurements than with random Clifford measurements in the near future. Inspired by the importance sampling technique applied to sampling Pauli measurements for DFE, we show that similar strategies can be derived from classical shadows. Specifically, we describe efficient methods using only local Pauli measurements to perform DFE with Greenberger-Horne-Zeilinger (GHZ), W , and Dicke states, establishing tighter bounds (by factors of 14.22 and 16 for GHZ and W /Dicke, respectively) on the number of measurements required for desired precision. These protocols are derived by adjusting the distribution of observables. Notably, they require no preprocessing steps other than the sampling algorithms.

arXiv:2501.03512•Physical Review A•Aug 13, 2025•4 citations

Phase shadow: A noise-tolerant path to global quantum property estimation

Qingyue Zhang, Dayue Qin, You Zhou +3 more

Measuring global quantum properties-such as the fidelity to complex multipartite states-is both an essential and experimentally challenging task. Classical shadow estimation offers favorable sample complexity, but typically relies on many-qubit circuits that are difficult to realize on current platforms. We propose the robust phase shadow scheme, a measurement framework based on random circuits with controlled-$Z$ as the unique entangling gate type, tailored to architectures such as trapped ions and neutral atoms. Leveraging tensor diagrammatic reasoning, we rigorously analyze the induced circuit ensemble and show that phase shadows match the performance of full Clifford-based ones. Importantly, our approach supports a noise-robust extension via purely classical post-processing, enabling reliable estimation under gate-dependent noise where existing techniques often fail. Additionally, by exploiting structural properties of random stabilizer states, we design an efficient post-processing algorithm that resolves a key computational bottleneck in previous shadow protocols. Our results enhance the practicality of shadow-based techniques, providing a robust and scalable route for estimating global properties in noisy quantum systems.

arXiv:2507.13237•Jul 17, 2025•4 citations
Classical shadows allow the prediction of many quantum-state properties from measurement data, but their efficiency strongly depends on the underlying measurement ensemble. We introduce selective GHZ measurement (SGM) shadows, which perform Greenberger-Horne-Zeilinger (GHZ)-basis measurements on randomly selected subsets of qubits and computational-basis measurements on their complement. The corresponding quantum circuits are practically feasible, with their number of CNOT gates scaling linearly with the number of qubits. This is in stark contrast to global Clifford circuits, which are generally difficult to implement. Varying the subset distribution allows tuning the SGM shadow protocol for different classes of observables with prescribed X/Y support, allowing us to outperform local Pauli as well as global Clifford shadows in certain scenarios. We determine the exact shadow channel and its inverse for arbitrary subset distributions and prove an explicit bound on the shadow norm using methods from discrete Fourier analysis and Markov semigroup theory. For natural choices of subset distributions, this gives a polynomial scaling for observables with fixed X/Y-locality. Numerical simulations of up to 50 qubits support the predicted improvements for nonlocal observables and long-range systems, and demonstrate the practical benefits of our protocol's generality by showing how the subset distributions can be tailored to settings such as fermionic modes under the Jordan-Wigner transformation.
The paper asks whether structured, nonlocal observables can be estimated with classical shadows using simpler circuits than global Clifford measurements. It introduces selective GHZ measurements: sample a qubit subset sss from a distribution ppp, measure it in one of two GHZ bases, and measure its complement computationally. Circuits use O(∣s∣)O(|s|)O(∣s∣) CNOTs and admit logarithmic depth with suitable connectivity.
The shadow channel is computed exactly. For a Pauli Pa,bP_{a,b}Pa,b​ with X/YX/YX/Y-support mask aaa, its eigenvalue is p(a)/2p(a)/2p(a)/2 when a≠0a\ne0a=0, and (1+p^(b))/2(1+\widehat p(b))/2(1+p​(b))/2 otherwise. Strictly positive ppp therefore ensures invertibility. For Hermitian AAA supported on masks in SSS, the main bound is ∥A∥sh2≤(6+π)max⁡s∈Sp(s)−1∥A∥∞2\|A\|_{\mathrm{sh}}^2\le(6+\pi)\max_{s\in S}p(s)^{-1}\|A\|_\infty^2∥A∥sh2​≤(6+π)maxs∈S​p(s)−1∥A∥∞2​. The proof combines a Pauli-sector decomposition with discrete Fourier analysis and a reverse Poincaré inequality for a graph heat semigroup.
Independent subset inclusion with probability 1/(n+1)1/(n+1)1/(n+1) gives ∥A∥sh2≤(6+π)enk∥A∥∞2\|A\|_{\mathrm{sh}}^2\le(6+\pi)e n^k\|A\|_\infty^2∥A∥sh2​≤(6+π)enk∥A∥∞2​ when each Pauli term has at most kkk X/YX/YX/Y factors, irrespective of its ZZZ support. Complementary support classes also receive polynomial guarantees, covering exponentially many Pauli observables. Simulations up to 50 qubits examine nonlocal observables; fermionic reduced-density-matrix examples use tailored distributions and retain O(n2k)O(n^{2k})O(n2k) scaling.
The protocol does not uniformly outperform Pauli or Clifford shadows. Stated open issues include sharper bounds and constants, possible benefits from p(0)=0p(0)=0p(0)=0, noise robustness, limited-connectivity implementation costs, and identifying further applications.
Abstract Efficiently learning expectation values of a quantum state using classical shadow tomography has become a fundamental task in quantum information theory. In a classical shadows protocol, one measures a state in a chosen basis W after it has evolved under a unitary transformation randomly sampled from a chosen distribution U . In this work we study the case where U corresponds to either local or global orthogonal Clifford gates, and W consists of real-valued vectors. Our results show that for various situations of interest, this ‘real’ classical shadow protocol improves the sample complexity over the standard scheme based on general Clifford unitaries. For example, when one is interested in estimating the expectation values of arbitrary real-valued observables, global orthogonal Cliffords typically decrease the required number of samples by a factor of two. More dramatically, for k -local observables composed only of real-valued Pauli operators, sampling local orthogonal Cliffords leads to a reduction by an exponential-in- k factor in the sample complexity over local unitary Cliffords. Finally, we show that by measuring in a basis containing complex-valued vectors, orthogonal shadows can, in the limit of large system size, exactly reproduce the original unitary shadows protocol.
Classical shadow tomography is a powerful randomized measurement protocol for predicting many properties of a quantum state with few measurements. Two classical shadow protocols have been extensively studied in the literature: the single-qubit (local) Pauli measurement, which is well suited for predicting local operators but inefficient for large operators; and the global Clifford measurement, which is efficient for low-rank operators but infeasible on near-term quantum devices due to the extensive gate overhead. In this work, we demonstrate a scalable classical shadow tomography approach for generic randomized measurements implemented with finite-depth local Clifford random unitary circuits, which interpolates between the limits of Pauli and Clifford measurements. The method combines the recently proposed locally-scrambled classical shadow tomography framework with tensor network techniques to achieve scalability for computing the classical shadow reconstruction map and evaluating various physical properties. The method enables classical shadow tomography to be performed on shallow quantum circuits with superior sample efficiency and minimal gate overhead and is friendly to noisy intermediate-scale quantum (NISQ) devices. We show that the shallow-circuit measurement protocol provides immediate, exponential advantages over the Pauli measurement protocol for predicting quasi-local operators. It also enables a more efficient fidelity estimation compared to the Pauli measurement.
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.
Classical shadows use a single measurement snapshot to estimate many observables. These estimates are jointly distributed, and their covariance is not determined by their expectation values or individual variances. It also differs from physical correlations between observables because it depends on the measurement and reconstruction protocol. We study the covariance matrix for a fixed set of shadow estimates and its spectrum. For general shadow protocols, we give a finite-sample operator-norm bound for the empirical covariance computed using the sample mean. This bound also controls the eigenvalues and isolated spectral subspaces of the covariance matrix. For local product shadow protocols with fixed local dimension, observables supported on a bounded number of sites lead to bounds that do not depend on the total system size, provided that the number of selected observables and the relevant local reconstruction factors remain bounded. For biased local Pauli shadows, we obtain explicit finite-sample bounds and an exact covariance formula determined by Pauli compatibility and local basis probabilities. A comparison with global Clifford shadows shows that dimension-independent covariance estimation depends on the measurement protocol and does not follow from the general theory alone.
A constant number of random Clifford measurements allows the classical shadow protocol to perform direct fidelity estimation (DFE) with high precision. However, estimating properties of an unknown quantum state is expected to be more feasible with random Pauli measurements than with random Clifford measurements in the near future. Inspired by the importance sampling technique applied to sampling Pauli measurements for DFE, we show that similar strategies can be derived from classical shadows. Specifically, we describe efficient methods using only local Pauli measurements to perform DFE with Greenberger-Horne-Zeilinger (GHZ), W , and Dicke states, establishing tighter bounds (by factors of 14.22 and 16 for GHZ and W /Dicke, respectively) on the number of measurements required for desired precision. These protocols are derived by adjusting the distribution of observables. Notably, they require no preprocessing steps other than the sampling algorithms.
Measuring global quantum properties-such as the fidelity to complex multipartite states-is both an essential and experimentally challenging task. Classical shadow estimation offers favorable sample complexity, but typically relies on many-qubit circuits that are difficult to realize on current platforms. We propose the robust phase shadow scheme, a measurement framework based on random circuits with controlled-ZZZ as the unique entangling gate type, tailored to architectures such as trapped ions and neutral atoms. Leveraging tensor diagrammatic reasoning, we rigorously analyze the induced circuit ensemble and show that phase shadows match the performance of full Clifford-based ones. Importantly, our approach supports a noise-robust extension via purely classical post-processing, enabling reliable estimation under gate-dependent noise where existing techniques often fail. Additionally, by exploiting structural properties of random stabilizer states, we design an efficient post-processing algorithm that resolves a key computational bottleneck in previous shadow protocols. Our results enhance the practicality of shadow-based techniques, providing a robust and scalable route for estimating global properties in noisy quantum systems.