Group-theoretic error mitigation enabled by classical shadows and symmetries

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 $\mathrm{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 comment24+28 pages, 9+3 figures. Reflects final version published in npj Quantum Information. Open-source code available at https://github.com/zhao-andrew/symmetry-adjusted-classical-shadows

References in corpus (86)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Surface codes: Towards practical large-scale quantum computation
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Quantum Simulation
• Quantum computational advantage using photons
• The theory of variational hybrid quantum-classical algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• Error mitigation for short-depth quantum circuits
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Suppressing quantum errors by scaling a surface code logical qubit
• The Variational Quantum Eigensolver: a review of methods and best practices
• The ITensor Software Library for Tensor Network Calculations
• State preservation by repetitive error detection in a superconducting quantum circuit
• Extending the computational reach of a noisy superconducting quantum processor
• Quantum algorithms for quantum chemistry and quantum materials science
• Hartree-Fock on a superconducting qubit quantum computer
• Towards Practical Quantum Variational Algorithms
• Quantum Error Mitigation
• Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
• Quantum advantage in learning from experiments
• Noise tailoring for scalable quantum computation via randomized compiling
• Hybrid quantum-classical algorithms and quantum error mitigation
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Robust determination of molecular spectra on a quantum processor
• Theory of variational quantum simulation
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Real-time quantum error correction beyond break-even
• Cloud Quantum Computing of an Atomic Nucleus
• The randomized measurement toolbox
• Realization of an Error-Correcting Surface Code with Superconducting Qubits
• Classical simulation of noninteracting-fermion quantum circuits
• Mixed-state entanglement from local randomized measurements
• Demonstration of fault-tolerant universal quantum gate operations
• Characterization of addressability by simultaneous randomized benchmarking
• Solving strongly correlated electron models on a quantum computer
• Low-cost error mitigation by symmetry verification
• Error-mitigated digital quantum simulation
• Virtual Distillation for Quantum Error Mitigation
• Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
• Matchgates and classical simulation of quantum circuits
• Scalable error mitigation for noisy quantum circuits produces competitive expectation values
• Beating the break-even point with a discrete-variable-encoded logical qubit
• Model-free readout-error mitigation for quantum expectation values
• The Dynamics of 1D Quantum Spin Systems Can Be Approximated Efficiently
• Fundamental limits of quantum error mitigation
• Quantum algorithms to simulate many-body physics of correlated fermions
• Fermionic partial tomography via classical shadows
• Robust shadow estimation
• Quantum Overlapping Tomography
• Application of fermionic marginal constraints to hybrid quantum algorithms
• What randomized benchmarking actually measures
• Decoding quantum errors with subspace expansions
• Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
• Classical Shadows With Noise
• Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer
• Matching and maximum likelihood decoding of a multi-round subsystem quantum error correction experiment
• A quantum-classical cloud platform optimized for variational hybrid algorithms
• Randomized benchmarking with gate-dependent noise
• Matchgate Shadows for Fermionic Quantum Simulation
• Purification-based quantum error mitigation of pair-correlated electron simulations
• Typicality in random matrix product states
• Classical algorithms for quantum mean values
• Shadow Distillation: Quantum Error Mitigation with Classical Shadows for Near-Term Quantum Processors
• Quantum Error Mitigation using Symmetry Expansion
• Universal Sampling Lower Bounds for Quantum Error Mitigation
• Universal cost bound of quantum error mitigation based on quantum estimation theory
• Precision-guaranteed quantum tomography
• Shadow process tomography of quantum channels
• Quantum chemistry simulation of ground- and excited-state properties of the sulfonium cation on a superconducting quantum processor
• Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
• Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states
• Statistical properties of random matrix product states
• Classical simulation of short-time quantum dynamics
• Fermionic Linear Optics Revisited
• Quantum Error Mitigated Classical Shadows
• Classical shadow tomography for continuous variables quantum systems
• From randomized benchmarking experiments to gateset circuit fidelity: how to interpret randomized benchmarking decay parameters
• Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
• Estimating expectation values using approximate quantum states
• Error-mitigated fermionic classical shadows on noisy quantum devices
• Efficient measurement schemes for bosonic systems

Cited by in corpus (13)

• Demonstration of Robust and Efficient Quantum Property Learning with Shallow Shadows
• Error-mitigated fermionic classical shadows on noisy quantum devices
• Machine learning on quantum experimental data toward solving quantum many-body problems
• Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows
• Efficient learning of quantum states prepared with few fermionic non-Gaussian gates
• Stability of classical shadows under gate-dependent noise
• Holographic Classical Shadow Tomography
• Biased Estimator Channels for Classical Shadows
• Quantum-Classical Auxiliary Field Quantum Monte Carlo with Matchgate Shadows on Trapped Ion Quantum Computers
• An Error Mitigated Non-Orthogonal Quantum Eigensolver via Shadow Tomography
• Expanding the reach of quantum optimization with fermionic embeddings
• Classical Shadows with Improved Median-of-Means Estimation
• Structural encoding with classical codes for computational-basis bit-flip correction in the early fault-tolerant regime