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.12726 · npj Quantum Information

Error-mitigated fermionic classical shadows on noisy quantum devices

Bujiao Wu, Dax Enshan Koh

Published Apr 16, 2024• 30 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1038/s41534-024-00836-7

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

Error mitigated shadow estimation based on virtual distillation

Ruyu Yang, Sun, Xiaoming, Hongyi Zhou

Shadow estimation is a method for deducing numerous properties of an unknown quantum state through a limited set of measurements, which suffers from noises in quantum devices. In this paper, we introduce an error-mitigated shadow estimation approach based on virtual distillation, tailored for applications in near-term quantum devices. Our methodology leverages the qubit reset technique, thereby reducing the associated qubit overhead. Crucially, our approach ensures that the required qubit resources remain independent of the desired accuracy and avoid an exponential measurement overhead, marking a substantial advancement in practical applications. Furthermore, our technique accommodates a mixed Clifford and Pauli-type shadow, which can result in a reduction in the number of required measurements across various scenarios. We also study the trade-off between circuit depth and measurement overhead quantitatively. Through numerical simulations, we substantiate the efficacy of our error mitigation method, establishing its utility in enhancing the robustness of shadow estimations on near-term quantum devices.

arXiv:2402.18829•Feb 29, 2024•1 citation

Robust Shadow Estimation

Senrui Chen, Wenjun Yu, Pei Zeng +1 more

Efficiently estimating properties of large and strongly coupled quantum systems is a central focus in many-body physics and quantum information theory.While quantum computers promise speedups for many of these tasks, near-term devices are prone to noise that will generally reduce the accuracy of such estimates.Here, we propose a sample-efficient and noise-resilient protocol for learning properties of quantum states building on the shadow estimation scheme [Huang et al., Nature Physics 16, 1050-1057(2020)].By introducing an experimentally friendly calibration procedure, our protocol can efficiently characterize and mitigate noises in the shadow estimation scheme, given only minimal assumptions on the experimental conditions.When the strength of noises can be bounded, our protocol approximately retains the same order of sample efficiency as the standard shadow estimation scheme, while also possessing a provable noise resilience.We give rigorous bounds on the sample complexity of our protocol and demonstrate its performance with several numerical experiments, including estimations of quantum fidelity, correlation functions and energy expectations, etc., which highlight a wide spectrum of potential applications of our protocol on near-term devices.

arXiv:2011.09636•PRX Quantum•Sep 22, 2021•169 citations

Robust Shadow Estimation

Senrui Chen, Wenjun Yu, Pei Zeng +1 more

Efficiently estimating properties of large and strongly coupled quantum systems is a central focus in many-body physics and quantum information theory. While quantum computers promise speedups for many of these tasks, near-term devices are prone to noise that will generally reduce the accuracy of such estimates. Here, we propose a sample-efficient and noise-resilient protocol for learning properties of quantum states building on the shadow estimation scheme [Huang et al., Nature Physics 16, 1050-1057 (2020)]. By introducing an experimentally friendly calibration procedure, our protocol can efficiently characterize and mitigate noises in the shadow estimation scheme, given only minimal assumptions on the experimental conditions. When the strength of noises can be bounded, our protocol approximately retains the same order of sample efficiency as the standard shadow estimation scheme, while also possessing a provable noise resilience. We give rigorous bounds on the sample complexity of our protocol and demonstrate its performance with several numerical experiments, including estimations of quantum fidelity, correlation functions and energy expectations, etc., which highlight a wide spectrum of potential applications of our protocol on near-term devices.

•Sep 22, 2021•14 citations

Group-theoretic error mitigation enabled by classical shadows and symmetries

Andrew Zhao, Akimasa Miyake

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.

arXiv:2310.03071•npj Quantum Information•Jun 8, 2024•34 citations

Error-mitigated nonorthogonal quantum eigensolver via shadow tomography

Hang Ren, Yipei Zhang, W.M. Billings +5 more

We present a shadow-tomography-enhanced nonorthogonal quantum eigensolver (NOQE) for more efficient and accurate electronic structure calculations on near-term quantum devices. By integrating shadow tomography into the NOQE, the measurement cost scales linearly rather than quadratically with the number of reference states, while also reducing the required qubits and circuit depth by half. This approach enables extraction of all matrix elements via randomized measurements and classical postprocessing. We analyze its sample complexity and show that, for small systems, it remains constant in the high-precision regime, while for larger systems, it scales linearly with the system size. We further apply shadow-based error mitigation to suppress noise-induced bias without increasing quantum resources. Demonstrations on the hydrogen molecule in the strongly correlated regime achieve chemical accuracy under realistic noise, showing that our method is both resource-efficient and noise-resilient for practical quantum chemistry simulations in the near term.

arXiv:2504.16008•Physical Review Research•Dec 30, 2025•3 citations
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.
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
Shadow estimation is a method for deducing numerous properties of an unknown quantum state through a limited set of measurements, which suffers from noises in quantum devices. In this paper, we introduce an error-mitigated shadow estimation approach based on virtual distillation, tailored for applications in near-term quantum devices. Our methodology leverages the qubit reset technique, thereby reducing the associated qubit overhead. Crucially, our approach ensures that the required qubit resources remain independent of the desired accuracy and avoid an exponential measurement overhead, marking a substantial advancement in practical applications. Furthermore, our technique accommodates a mixed Clifford and Pauli-type shadow, which can result in a reduction in the number of required measurements across various scenarios. We also study the trade-off between circuit depth and measurement overhead quantitatively. Through numerical simulations, we substantiate the efficacy of our error mitigation method, establishing its utility in enhancing the robustness of shadow estimations on near-term quantum devices.
Efficiently estimating properties of large and strongly coupled quantum systems is a central focus in many-body physics and quantum information theory.While quantum computers promise speedups for many of these tasks, near-term devices are prone to noise that will generally reduce the accuracy of such estimates.Here, we propose a sample-efficient and noise-resilient protocol for learning properties of quantum states building on the shadow estimation scheme [Huang et al., Nature Physics 16, 1050-1057(2020)].By introducing an experimentally friendly calibration procedure, our protocol can efficiently characterize and mitigate noises in the shadow estimation scheme, given only minimal assumptions on the experimental conditions.When the strength of noises can be bounded, our protocol approximately retains the same order of sample efficiency as the standard shadow estimation scheme, while also possessing a provable noise resilience.We give rigorous bounds on the sample complexity of our protocol and demonstrate its performance with several numerical experiments, including estimations of quantum fidelity, correlation functions and energy expectations, etc., which highlight a wide spectrum of potential applications of our protocol on near-term devices.
Efficiently estimating properties of large and strongly coupled quantum systems is a central focus in many-body physics and quantum information theory. While quantum computers promise speedups for many of these tasks, near-term devices are prone to noise that will generally reduce the accuracy of such estimates. Here, we propose a sample-efficient and noise-resilient protocol for learning properties of quantum states building on the shadow estimation scheme [Huang et al., Nature Physics 16, 1050-1057 (2020)]. By introducing an experimentally friendly calibration procedure, our protocol can efficiently characterize and mitigate noises in the shadow estimation scheme, given only minimal assumptions on the experimental conditions. When the strength of noises can be bounded, our protocol approximately retains the same order of sample efficiency as the standard shadow estimation scheme, while also possessing a provable noise resilience. We give rigorous bounds on the sample complexity of our protocol and demonstrate its performance with several numerical experiments, including estimations of quantum fidelity, correlation functions and energy expectations, etc., which highlight a wide spectrum of potential applications of our protocol on near-term devices.
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.
We present a shadow-tomography-enhanced nonorthogonal quantum eigensolver (NOQE) for more efficient and accurate electronic structure calculations on near-term quantum devices. By integrating shadow tomography into the NOQE, the measurement cost scales linearly rather than quadratically with the number of reference states, while also reducing the required qubits and circuit depth by half. This approach enables extraction of all matrix elements via randomized measurements and classical postprocessing. We analyze its sample complexity and show that, for small systems, it remains constant in the high-precision regime, while for larger systems, it scales linearly with the system size. We further apply shadow-based error mitigation to suppress noise-induced bias without increasing quantum resources. Demonstrations on the hydrogen molecule in the strongly correlated regime achieve chemical accuracy under realistic noise, showing that our method is both resource-efficient and noise-resilient for practical quantum chemistry simulations in the near term.