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:2310.03071 · npj Quantum Information

Group-theoretic error mitigation enabled by classical shadows and symmetries

Andrew Zhao, Akimasa Miyake

Published Jun 8, 2024• 34 citations
arXivHTMLPDF

Abstract

Abstract Estimating expectation values is a key subroutine in quantum algorithms. Near-term implementations face two major challenges: a limited number of samples required to learn a large collection of observables, and the accumulation of errors in devices without quantum error correction. To address these challenges simultaneously, we develop a quantum error-mitigation strategy called symmetry-adjusted classical shadows, by adjusting classical-shadow tomography according to how symmetries are corrupted by device errors. As a concrete example, we highlight global U(1) symmetry, which manifests in fermions as particle number and in spins as total magnetization, and illustrate their group-theoretic unification with respective classical-shadow protocols. We establish rigorous sampling bounds under readout errors obeying minimal assumptions, and perform numerical experiments with a more comprehensive model of gate-level errors derived from existing quantum processors. Our results reveal symmetry-adjusted classical shadows as a low-cost strategy to mitigate errors from noisy quantum experiments in the ubiquitous presence of symmetry.

DOI
10.1038/s41534-024-00854-5

Related papers

Quantum Error Mitigated Classical Shadows

Hamza Jnane, Jonathan Steinberg, Zhenyu Cai +2 more

Classical shadows enable us to learn many properties of a quantum state ρ with very few measurements. However, near-term and early fault-tolerant quantum computers will only be able to prepare noisy quantum states ρ and it is thus a considerable challenge to efficiently learn properties of an ideal, noise-free state ρ id . We consider error mitigation techniques, such as probabilistic error cancelation (PEC), zero noise extrapolation (ZNE), and symmetry verification (SV), which have been developed for mitigating errors in single expected value measurements and generalize them for mitigating errors in classical shadows. We find that PEC is the most natural candidate and thus develop a thorough theoretical framework for PEC shadows with the following rigorous theoretical guarantees: PEC shadows are an unbiased estimator for the ideal quantum state ρ id ; the sample complexity for simultaneously predicting many linear properties of ρ id is identical to that of the conventional shadows approach up to a multiplicative factor, which is the sample overhead due to error mitigation. Due to efficient postprocessing of shadows, this overhead does not depend directly on the number of qubits but rather grows exponentially with the number of noisy gates. The broad set of tools introduced in this work may be instrumental in exploiting near-term and early fault-tolerant quantum computers: we demonstrate in detailed numerical simulations a range of practical applications of quantum computers that will significantly benefit from our techniques. Published by the American Physical Society 2024

arXiv:2305.04956•PRX Quantum•Feb 9, 2024•50 citations

Provably Efficient Learning of Fermionic Correlations under Particle-Number Symmetry

Yuki Koizumi, Kaito Wada, Toshinori P. Takama +1 more

Predicting local fermionic correlations is a central task in quantum many-body physics, as these correlations encode many physically relevant local observables. The ubiquitous particle-number symmetry imposes strong structural constraints on quantum states, suggesting that local correlations should be learned with fewer samples than by symmetry-agnostic approaches. However, it has remained unclear whether such a provable advantage exists in collective learning of local correlations. Here, we develop a framework of number-conserving fermionic-shadow tomography based on random orbital rotations. We prove that, for every given order $k$, we can simultaneously estimate all $k$-body fermionic correlations of an $N$-mode $η$-particle state with a given variance $\varepsilon^2$ using only $O_k(η^k/\varepsilon^2)$ samples, which are independent of the system size $N$. We further establish a matching information-theoretic lower bound $Ω_k(η^k/\varepsilon^2)$ for any adaptive protocol based on single-copy measurements, showing that the $(η^k,\varepsilon)$-dependence is optimal up to constants depending only on $k$. Furthermore, numerical studies show a 20-fold query reduction for one-body correlation estimation at $N=200$, $η=20$, and $\varepsilon=10^{-2}$, compared with the best alternative including Heisenberg-limited estimation methods. Relative to fermionic Gaussian-unitary shadows, sample costs for the square-lattice Fermi-Hubbard model at $N=288$ are reduced by factors of $148$ for energy density and $161$ for spin structure factor estimation. For molecular energy derivatives with respect to atomic coordinates, our method reduces sample requirements by factors of $53$ for $\mathrm{Cr}_2$ and $18.5$ for $[\mathrm{Fe}_2\mathrm{S}_2]^{2-}$ at $N=128$. These results demonstrate the practical advantage of particle-number symmetry for fermionic observable estimation.

quant-pharXiv:2606.30601•Jun 30, 2026•5 citations

Error-mitigated fermionic classical shadows on noisy quantum devices

Bujiao Wu, Dax Enshan Koh

Abstract Efficiently estimating fermionic Hamiltonian expectation values is vital for simulating various physical systems. Classical shadow (CS) algorithms offer a solution by reducing the number of quantum state copies needed, but noise in quantum devices poses challenges. We propose an error-mitigated CS algorithm assuming gate-independent, time-stationary, and Markovian (GTM) noise. For n -qubit systems, our algorithm, which employs the easily prepared initial state $$\left\vert {0}^{n}\right\rangle \,\left\langle {0}^{n}\right\vert$$ 0 n 0 n assumed to be noiseless, efficiently estimates k -RDMs with $$\widetilde{{{{\mathcal{O}}}}}(k{n}^{k})$$ O ̃ ( k n k ) state copies and $$\widetilde{{{{\mathcal{O}}}}}(\sqrt{n})$$ O ̃ ( n ) calibration measurements for GTM noise with constant fidelities. We show that our algorithm is robust against noise types like depolarizing, damping, and X -rotation noise with constant strengths, showing scalings akin to prior CS algorithms for fermions but with better noise resilience. Numerical simulations confirm our algorithm’s efficacy in noisy settings, suggesting its viability for near-term quantum devices.

arXiv:2310.12726•npj Quantum Information•Apr 16, 2024•30 citations

Fermionic Partial Tomography via Classical Shadows

Andrew Zhao, Nicholas C. Rubin, Akimasa Miyake

We propose a tomographic protocol for estimating any k-body reduced density matrix (k-RDM) of an n-mode fermionic state, a ubiquitous step in near-term quantum algorithms for simulating many-body physics, chemistry, and materials. Our approach extends the framework of classical shadows, a randomized approach to learning a collection of quantum-state properties, to the fermionic setting. Our sampling protocol uses randomized measurement settings generated by a discrete group of fermionic Gaussian unitaries, implementable with linear-depth circuits. We prove that estimating all k-RDM elements to additive precision ϵ requires on the order of (n/k)k^{3/2}log(n)/ϵ^{2} repeated state preparations, which is optimal up to the logarithmic factor. Furthermore, numerical calculations show that our protocol offers a substantial improvement in constant overheads for k≥2, as compared to prior deterministic strategies. We also adapt our method to particle-number symmetry, wherein the additional circuit depth may be halved at the cost of roughly 2-5 times more repetitions.

arXiv:2010.16094•Physical Review Letters•Sep 9, 2021•172 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

Logical shadow tomography: Efficient estimation of error-mitigated observables

Hong-Ye Hu, Ryan LaRose, Yi‐Zhuang You +2 more

We introduce a technique to estimate error-mitigated expectation values on noisy quantum computers. Our technique performs shadow tomography on a logical state to produce a memory-efficient classical reconstruction of the noisy density matrix. Using efficient classical post-processing, one can mitigate errors by projecting a general nonlinear function of the noisy density matrix into the codespace. The subspace expansion and virtual distillation can be viewed as special cases of the new framekwork. We show our method is favorable in the quantum and classical resources overhead. Relative to subspace expansion which requires $O\left(2^{N} \right)$ samples to estimate a logical Pauli observable with $[[N, k]]$ error correction code, our technique requires only $O\left(4^{k} \right)$ samples. Relative to virtual distillation, our technique can compute powers of the density matrix without additional copies of quantum states or quantum memory. We present numerical evidence using logical states encoded with up to sixty physical qubits and show fast convergence to error-free expectation values with only $10^5$ samples under 1% depolarizing noise.

arXiv:2203.07263•Mar 14, 2022•49 citations
Abstract Estimating expectation values is a key subroutine in quantum algorithms. Near-term implementations face two major challenges: a limited number of samples required to learn a large collection of observables, and the accumulation of errors in devices without quantum error correction. To address these challenges simultaneously, we develop a quantum error-mitigation strategy called symmetry-adjusted classical shadows, by adjusting classical-shadow tomography according to how symmetries are corrupted by device errors. As a concrete example, we highlight global U(1) symmetry, which manifests in fermions as particle number and in spins as total magnetization, and illustrate their group-theoretic unification with respective classical-shadow protocols. We establish rigorous sampling bounds under readout errors obeying minimal assumptions, and perform numerical experiments with a more comprehensive model of gate-level errors derived from existing quantum processors. Our results reveal symmetry-adjusted classical shadows as a low-cost strategy to mitigate errors from noisy quantum experiments in the ubiquitous presence of symmetry.
Classical shadows enable us to learn many properties of a quantum state ρ with very few measurements. However, near-term and early fault-tolerant quantum computers will only be able to prepare noisy quantum states ρ and it is thus a considerable challenge to efficiently learn properties of an ideal, noise-free state ρ id . We consider error mitigation techniques, such as probabilistic error cancelation (PEC), zero noise extrapolation (ZNE), and symmetry verification (SV), which have been developed for mitigating errors in single expected value measurements and generalize them for mitigating errors in classical shadows. We find that PEC is the most natural candidate and thus develop a thorough theoretical framework for PEC shadows with the following rigorous theoretical guarantees: PEC shadows are an unbiased estimator for the ideal quantum state ρ id ; the sample complexity for simultaneously predicting many linear properties of ρ id is identical to that of the conventional shadows approach up to a multiplicative factor, which is the sample overhead due to error mitigation. Due to efficient postprocessing of shadows, this overhead does not depend directly on the number of qubits but rather grows exponentially with the number of noisy gates. The broad set of tools introduced in this work may be instrumental in exploiting near-term and early fault-tolerant quantum computers: we demonstrate in detailed numerical simulations a range of practical applications of quantum computers that will significantly benefit from our techniques. Published by the American Physical Society 2024
Predicting local fermionic correlations is a central task in quantum many-body physics, as these correlations encode many physically relevant local observables. The ubiquitous particle-number symmetry imposes strong structural constraints on quantum states, suggesting that local correlations should be learned with fewer samples than by symmetry-agnostic approaches. However, it has remained unclear whether such a provable advantage exists in collective learning of local correlations. Here, we develop a framework of number-conserving fermionic-shadow tomography based on random orbital rotations. We prove that, for every given order kkk, we can simultaneously estimate all kkk-body fermionic correlations of an NNN-mode ηηη-particle state with a given variance ε2\varepsilon^2ε2 using only Ok(ηk/ε2)O_k(η^k/\varepsilon^2)Ok​(ηk/ε2) samples, which are independent of the system size NNN. We further establish a matching information-theoretic lower bound Ωk(ηk/ε2)Ω_k(η^k/\varepsilon^2)Ωk​(ηk/ε2) for any adaptive protocol based on single-copy measurements, showing that the (ηk,ε)(η^k,\varepsilon)(ηk,ε)-dependence is optimal up to constants depending only on kkk. Furthermore, numerical studies show a 20-fold query reduction for one-body correlation estimation at N=200N=200N=200, η=20η=20η=20, and ε=10−2\varepsilon=10^{-2}ε=10−2, compared with the best alternative including Heisenberg-limited estimation methods. Relative to fermionic Gaussian-unitary shadows, sample costs for the square-lattice Fermi-Hubbard model at N=288N=288N=288 are reduced by factors of 148148148 for energy density and 161161161 for spin structure factor estimation. For molecular energy derivatives with respect to atomic coordinates, our method reduces sample requirements by factors of 535353 for Cr2\mathrm{Cr}_2Cr2​ and 18.518.518.5 for [Fe2S2]2−[\mathrm{Fe}_2\mathrm{S}_2]^{2-}[Fe2​S2​]2− at N=128N=128N=128. These results demonstrate the practical advantage of particle-number symmetry for fermionic observable estimation.
Abstract Efficiently estimating fermionic Hamiltonian expectation values is vital for simulating various physical systems. Classical shadow (CS) algorithms offer a solution by reducing the number of quantum state copies needed, but noise in quantum devices poses challenges. We propose an error-mitigated CS algorithm assuming gate-independent, time-stationary, and Markovian (GTM) noise. For n -qubit systems, our algorithm, which employs the easily prepared initial state ∣0n⟩ ⟨0n∣\left\vert {0}^{n}\right\rangle \,\left\langle {0}^{n}\right\vert∣0n⟩⟨0n∣ 0 n 0 n assumed to be noiseless, efficiently estimates k -RDMs with O~(knk)\widetilde{{{{\mathcal{O}}}}}(k{n}^{k})O(knk) O ̃ ( k n k ) state copies and O~(n)\widetilde{{{{\mathcal{O}}}}}(\sqrt{n})O(n​) O ̃ ( n ) calibration measurements for GTM noise with constant fidelities. We show that our algorithm is robust against noise types like depolarizing, damping, and X -rotation noise with constant strengths, showing scalings akin to prior CS algorithms for fermions but with better noise resilience. Numerical simulations confirm our algorithm’s efficacy in noisy settings, suggesting its viability for near-term quantum devices.
We propose a tomographic protocol for estimating any k-body reduced density matrix (k-RDM) of an n-mode fermionic state, a ubiquitous step in near-term quantum algorithms for simulating many-body physics, chemistry, and materials. Our approach extends the framework of classical shadows, a randomized approach to learning a collection of quantum-state properties, to the fermionic setting. Our sampling protocol uses randomized measurement settings generated by a discrete group of fermionic Gaussian unitaries, implementable with linear-depth circuits. We prove that estimating all k-RDM elements to additive precision ϵ requires on the order of (n/k)k^{3/2}log(n)/ϵ^{2} repeated state preparations, which is optimal up to the logarithmic factor. Furthermore, numerical calculations show that our protocol offers a substantial improvement in constant overheads for k≥2, as compared to prior deterministic strategies. We also adapt our method to particle-number symmetry, wherein the additional circuit depth may be halved at the cost of roughly 2-5 times more repetitions.
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.
We introduce a technique to estimate error-mitigated expectation values on noisy quantum computers. Our technique performs shadow tomography on a logical state to produce a memory-efficient classical reconstruction of the noisy density matrix. Using efficient classical post-processing, one can mitigate errors by projecting a general nonlinear function of the noisy density matrix into the codespace. The subspace expansion and virtual distillation can be viewed as special cases of the new framekwork. We show our method is favorable in the quantum and classical resources overhead. Relative to subspace expansion which requires O(2N)O\left(2^{N} \right)O(2N) samples to estimate a logical Pauli observable with [[N,k]][[N, k]][[N,k]] error correction code, our technique requires only O(4k)O\left(4^{k} \right)O(4k) samples. Relative to virtual distillation, our technique can compute powers of the density matrix without additional copies of quantum states or quantum memory. We present numerical evidence using logical states encoded with up to sixty physical qubits and show fast convergence to error-free expectation values with only 10510^5105 samples under 1% depolarizing noise.