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:2311.14622 · Physical Review Research

Resource-efficient shadow tomography using equatorial stabilizer measurements

Guedong Park, Yong Siah Teo, Hyunseok Jeong

Published Jun 25, 2025• 7 citations
arXivHTMLPDF

Abstract

We propose a resource-efficient shadow-tomography scheme using equatorial-stabilizer measurements generated from subsets of Clifford unitaries. For n -qubit systems, equatorial-stabilizer-based shadow-tomography schemes can estimate M observables (up to an additive error ɛ ) using O ( log ( M ) , poly ( n ) , 1 / ɛ 2 ) sampling copies for a large class of observables, including those with traceless parts possessing polynomially bounded Frobenius norms. For arbitrary quantum-state observables with a constant Frobenius norm, sampling complexity becomes n independent. Our scheme only requires an n -depth controlled- Z (CZ) circuit [ O ( n 2 ) CZ gates] and Pauli measurements per sampling copy. Alternatively, our scheme is realizable with 2 n -depth circuits comprising n 2 nearest-neighboring gates, exhibiting a smaller maximal gate count relative to previously known randomized-Clifford-based proposals. We numerically confirm our theoretically derived shadow-tomographic sampling complexities with random pure states and multiqubit graph states. Finally, we demonstrate that equatorial-stabilizer-based shadow tomography is more noise tolerant than randomized-Clifford-based schemes in terms of fidelity estimation for the Greenberger–Horne–Zeilinger state and W state.

DOI
10.1103/9pbp-jzr9

Related papers

Triply efficient shadow tomography

Robbie King, David Gosset, Robin Kothari +1 more

Given copies of a quantum state ρ, a shadow tomography protocol aims to learn all expectation values from a fixed set of observables, to within a given precision ε. We say that a shadow tomography protocol is triply efficient if it is sample- and time-efficient, and only employs measurements that entangle a constant number of copies of ρ at a time. The classical shadows protocol based on random single-copy measurements is triply efficient for the set of local Pauli observables. This and other protocols based on random singlecopy Clifford measurements can be understood as arising from fractional colorings of a graph G that encodes the commutation structure of the set of observables. Here we describe a framework for two-copy shadow tomography that uses an initial round of Bell measurements to reduce to a fractional coloring problem in an induced subgraph of G with bounded clique number. This coloring problem can be addressed using techniques from graph theory known as chi-boundedness. Using this framework we give the first triply efficient shadow tomography scheme for the set of local fermionic observables, which arise in a broad class of interacting fermionic systems in physics and chemistry. We also give a triply efficient scheme for the set of all n-qubit Pauli observables. Our protocols for these tasks use two-copy measurements, which is necessary: sample- efficient schemes are provably impossible using only single-copy measurements. Finally, we give a shadow tomography protocol that compresses an n-qubit quantum state into a poly(n )-sized classical representation, from which one can extract the expected value of any of the 4n Pauli observables in poly(n ) time, up to a small constant error.

Society for Industrial and Applied Mathematics eBooks•Jan 1, 2025•11 citations

Optimal strategies for shadow tomography with limited resources

Zhen-Peng Xu, Qi Ye, Jie Wang +3 more

Shadow tomography addresses the task of efficiently predicting many expectation values of an unknown quantum state from randomized measurements on comparatively few copies. Existing analyses promise large scaling advantages, but the optimal strategies realizing these guarantees are not always known, and the required measurements are potentially challenging to implement on current hardware. We address this gap for Pauli observables by computing optimal sample-complexity parameters and constructing optimal measurement strategies under realistic resource constraints. We focus on memoryless protocols, where each copy is measured only once, and on measurements with bounded interaction range. Our approach reduces the problem to the analysis of graph parameters of the frustration graph encoding the Pauli anticommutation relations. We provide efficient numerical methods for the general case and analytically prove that Clifford measurements are optimal in many situations. This includes all perfect graphs, all single-qubit, all two-qubit measurement scenarios, and more. Applied to Hamiltonian energy estimation, our framework yields constructive strategies and improved variance bounds for molecular benchmarks.

quant-pharXiv:2608.08429•Aug 11, 2026•3 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

One, Two, Three: One Empirical Evaluation of a Two-Copy Shadow Tomography Scheme with Triple Efficiency

Viet T. Tran, Richard Kueng

Shadow tomography protocols have recently emerged as powerful tools for efficient quantum state learning, aiming to reconstruct expectation values of observables with considerably fewer resources than traditional quantum state tomography. For the particular case of estimating Pauli observables, entangling two-copy measurement schemes can offer an exponential improvement in sample complexity over any single-copy strategy conceivable [1, Huang, Kueng, Preskill, PRL (2021)]. A recent refinement of these ideas by King et al. [2, King, Gosset, Kothari, Babbush, SODA (2025)] does not only achieve polynomial sample complexity, but also maintains reasonable computational demands and utilizes joint measurements on only a small constant number of state copies. This 'triple efficiency' is achievable for any subset of$n$-qubit Pauli observables, whereas single-copy strategies can only be efficient if the Pauli observables in question have advantageous structure. In this work, we complement existing theoretical performance guarantees with the empirical evaluation of triply efficient shadow tomography using classical, noise-free simulations. Our findings indicate that the empirical sample complexity aligns closely with theoretical predictions for stabilizer states and, notably, demonstrates slightly improved scaling for random Gibbs states compared to established theoretical bounds. In addition, we improve a central subroutine in the triply-efficient shadow protocol by leveraging insights from a refined quantum and quantum-inspired convex optimization algorithm [3, Henze et al. arXiv:2502.15426 (2025)] [Henze et al. arXiv:2502.15426 (2025)]. To summarize, our empirical sample complexity studies of triply efficient shadow tomography not only confirm existing theoretical scaling behavior, but also showcase that the actual constants involved are comparatively benign. Hence, this protocol has the potential to also be very sample-efficient in practice.

arXiv:2508.11744•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•3 citations

Dimension Independent and Computationally Efficient Shadow Tomography

Pulkit Sinha

We describe a new shadow tomography algorithm that uses n =Θ(√ m log m /є 2 ) samples, for m measurements and additive error є, which is independent of the dimension of the quantum state being learned. This stands in contrast to all previously known algorithms that improve upon the naive approach. The sample complexity also has optimal dependence on є. Due to its dimension independent nature, this algorithm has the best known sample complexity in the regime m = o (log 2 d ) (when є is chosen independently from d ). Additionally, this algorithm is efficient in various aspects, including quantum memory usage (possibly even O (1)), gate complexity, classical computation, all of which are also do not have any dimension dependence. This algorithm is also robust against qubit measurement noise, by which we mean that the qubit measurement errors can only affect the accuracy of the estimates, and small noise leads to small additive error in the estimates. Apart from this, the algorithm can be modified to also be implementable as a read-once quantum circuit with low quantum memory usage, i.e., it will hold only one copy of ρ in memory, and discard it before asking for a new one, with the additional quantum memory needed being O ( m log n ) qubits. Our approach builds on the idea of using noisy measurements, but instead of focusing on gentleness in trace distance, we focus on the gentleness in shadows, i.e., we show that the noisy measurements do not significantly perturb the expected values. To work with this, we think of noisy measurements as measuring a noisy encoding of the quantity we are trying to noisily measure. In our case, these are the observables corresponding to sample means of the m POVMs. We see that the product state structure of the samples is effectively maintained (with possibly some additional randomness) even after the creation and tracing out of the specific noisy encodings we work with.

arXiv:2411.01420•ACM Symposium on Theory of Computing (STOC)•Jun 15, 2025•4 citations

A computationally efficient approach to quantum state reconstruction using robust classical shadows

Sanjay Sharma, Shyam Akashe, Govind Murari Upadhyay +1 more

Quantum state tomography is a fundamental technique for characterizing quantum systems, but its scalability remains a significant challenge. This paper investigates an efficient alternative using classical shadows to reconstruct a Bell state with high fidelity. Classical shadows provide a compressed representation of a quantum state using randomized measurements, reducing the measurement complexity compared to full quantum tomography when full state reconstruction is not required. We employed a quantum circuit to generate a Bell state and utilize 1000 snapshots to construct its classical shadow. The reconstructed density matrix is evaluated using fidelity and norm difference metrics against the ideal Bell state. Our analysis demonstrates that as the number of snapshots increases, the fidelity of reconstruction stabilizes around 0.98-1.0, with the norm difference decreasing accordingly. The results also confirm the convergence of reconstructed states towards the ideal Bell state, highlighting the efficiency and accuracy of classical shadows in quantum state estimation. Shallow shadow tomography uses shallow random circuits to estimate global quantum state properties on noisy hardware. By combining low-depth entangling gates with randomized measurements and noise-aware postprocessing, it reduces sample complexity compared to Pauli shadows while remaining experimentally feasible. Recent experiments on superconducting processors confirmed up to fivefold measurement savings.

Scientific Reports•Feb 2, 2026•0 citations
We propose a resource-efficient shadow-tomography scheme using equatorial-stabilizer measurements generated from subsets of Clifford unitaries. For n -qubit systems, equatorial-stabilizer-based shadow-tomography schemes can estimate M observables (up to an additive error ɛ ) using O ( log ( M ) , poly ( n ) , 1 / ɛ 2 ) sampling copies for a large class of observables, including those with traceless parts possessing polynomially bounded Frobenius norms. For arbitrary quantum-state observables with a constant Frobenius norm, sampling complexity becomes n independent. Our scheme only requires an n -depth controlled- Z (CZ) circuit [ O ( n 2 ) CZ gates] and Pauli measurements per sampling copy. Alternatively, our scheme is realizable with 2 n -depth circuits comprising n 2 nearest-neighboring gates, exhibiting a smaller maximal gate count relative to previously known randomized-Clifford-based proposals. We numerically confirm our theoretically derived shadow-tomographic sampling complexities with random pure states and multiqubit graph states. Finally, we demonstrate that equatorial-stabilizer-based shadow tomography is more noise tolerant than randomized-Clifford-based schemes in terms of fidelity estimation for the Greenberger–Horne–Zeilinger state and W state.
Given copies of a quantum state ρ, a shadow tomography protocol aims to learn all expectation values from a fixed set of observables, to within a given precision ε. We say that a shadow tomography protocol is triply efficient if it is sample- and time-efficient, and only employs measurements that entangle a constant number of copies of ρ at a time. The classical shadows protocol based on random single-copy measurements is triply efficient for the set of local Pauli observables. This and other protocols based on random singlecopy Clifford measurements can be understood as arising from fractional colorings of a graph G that encodes the commutation structure of the set of observables. Here we describe a framework for two-copy shadow tomography that uses an initial round of Bell measurements to reduce to a fractional coloring problem in an induced subgraph of G with bounded clique number. This coloring problem can be addressed using techniques from graph theory known as chi-boundedness. Using this framework we give the first triply efficient shadow tomography scheme for the set of local fermionic observables, which arise in a broad class of interacting fermionic systems in physics and chemistry. We also give a triply efficient scheme for the set of all n-qubit Pauli observables. Our protocols for these tasks use two-copy measurements, which is necessary: sample- efficient schemes are provably impossible using only single-copy measurements. Finally, we give a shadow tomography protocol that compresses an n-qubit quantum state into a poly(n )-sized classical representation, from which one can extract the expected value of any of the 4n Pauli observables in poly(n ) time, up to a small constant error.
Shadow tomography addresses the task of efficiently predicting many expectation values of an unknown quantum state from randomized measurements on comparatively few copies. Existing analyses promise large scaling advantages, but the optimal strategies realizing these guarantees are not always known, and the required measurements are potentially challenging to implement on current hardware. We address this gap for Pauli observables by computing optimal sample-complexity parameters and constructing optimal measurement strategies under realistic resource constraints. We focus on memoryless protocols, where each copy is measured only once, and on measurements with bounded interaction range. Our approach reduces the problem to the analysis of graph parameters of the frustration graph encoding the Pauli anticommutation relations. We provide efficient numerical methods for the general case and analytically prove that Clifford measurements are optimal in many situations. This includes all perfect graphs, all single-qubit, all two-qubit measurement scenarios, and more. Applied to Hamiltonian energy estimation, our framework yields constructive strategies and improved variance bounds for molecular benchmarks.
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.
Shadow tomography protocols have recently emerged as powerful tools for efficient quantum state learning, aiming to reconstruct expectation values of observables with considerably fewer resources than traditional quantum state tomography. For the particular case of estimating Pauli observables, entangling two-copy measurement schemes can offer an exponential improvement in sample complexity over any single-copy strategy conceivable [1, Huang, Kueng, Preskill, PRL (2021)]. A recent refinement of these ideas by King et al. [2, King, Gosset, Kothari, Babbush, SODA (2025)] does not only achieve polynomial sample complexity, but also maintains reasonable computational demands and utilizes joint measurements on only a small constant number of state copies. This 'triple efficiency' is achievable for any subset ofnnn-qubit Pauli observables, whereas single-copy strategies can only be efficient if the Pauli observables in question have advantageous structure. In this work, we complement existing theoretical performance guarantees with the empirical evaluation of triply efficient shadow tomography using classical, noise-free simulations. Our findings indicate that the empirical sample complexity aligns closely with theoretical predictions for stabilizer states and, notably, demonstrates slightly improved scaling for random Gibbs states compared to established theoretical bounds. In addition, we improve a central subroutine in the triply-efficient shadow protocol by leveraging insights from a refined quantum and quantum-inspired convex optimization algorithm [3, Henze et al. arXiv:2502.15426 (2025)] [Henze et al. arXiv:2502.15426 (2025)]. To summarize, our empirical sample complexity studies of triply efficient shadow tomography not only confirm existing theoretical scaling behavior, but also showcase that the actual constants involved are comparatively benign. Hence, this protocol has the potential to also be very sample-efficient in practice.
We describe a new shadow tomography algorithm that uses n =Θ(√ m log m /є 2 ) samples, for m measurements and additive error є, which is independent of the dimension of the quantum state being learned. This stands in contrast to all previously known algorithms that improve upon the naive approach. The sample complexity also has optimal dependence on є. Due to its dimension independent nature, this algorithm has the best known sample complexity in the regime m = o (log 2 d ) (when є is chosen independently from d ). Additionally, this algorithm is efficient in various aspects, including quantum memory usage (possibly even O (1)), gate complexity, classical computation, all of which are also do not have any dimension dependence. This algorithm is also robust against qubit measurement noise, by which we mean that the qubit measurement errors can only affect the accuracy of the estimates, and small noise leads to small additive error in the estimates. Apart from this, the algorithm can be modified to also be implementable as a read-once quantum circuit with low quantum memory usage, i.e., it will hold only one copy of ρ in memory, and discard it before asking for a new one, with the additional quantum memory needed being O ( m log n ) qubits. Our approach builds on the idea of using noisy measurements, but instead of focusing on gentleness in trace distance, we focus on the gentleness in shadows, i.e., we show that the noisy measurements do not significantly perturb the expected values. To work with this, we think of noisy measurements as measuring a noisy encoding of the quantity we are trying to noisily measure. In our case, these are the observables corresponding to sample means of the m POVMs. We see that the product state structure of the samples is effectively maintained (with possibly some additional randomness) even after the creation and tracing out of the specific noisy encodings we work with.
Quantum state tomography is a fundamental technique for characterizing quantum systems, but its scalability remains a significant challenge. This paper investigates an efficient alternative using classical shadows to reconstruct a Bell state with high fidelity. Classical shadows provide a compressed representation of a quantum state using randomized measurements, reducing the measurement complexity compared to full quantum tomography when full state reconstruction is not required. We employed a quantum circuit to generate a Bell state and utilize 1000 snapshots to construct its classical shadow. The reconstructed density matrix is evaluated using fidelity and norm difference metrics against the ideal Bell state. Our analysis demonstrates that as the number of snapshots increases, the fidelity of reconstruction stabilizes around 0.98-1.0, with the norm difference decreasing accordingly. The results also confirm the convergence of reconstructed states towards the ideal Bell state, highlighting the efficiency and accuracy of classical shadows in quantum state estimation. Shallow shadow tomography uses shallow random circuits to estimate global quantum state properties on noisy hardware. By combining low-depth entangling gates with randomized measurements and noise-aware postprocessing, it reduces sample complexity compared to Pauli shadows while remaining experimentally feasible. Recent experiments on superconducting processors confirmed up to fivefold measurement savings.