Demonstration of Robust and Efficient Quantum Property Learning with Shallow Shadows

Abstract

Extracting information efficiently from quantum systems is a major component of quantum information processing tasks. Randomized measurements, or classical shadows, enable predicting many properties of arbitrary quantum states using few measurements. While random single-qubit measurements are experimentally friendly and suitable for learning low-weight Pauli observables, they perform poorly for nonlocal observables. Prepending a shallow random quantum circuit before measurements maintains this experimental friendliness, but also has favorable sample complexities for observables beyond low-weight Paulis, including high-weight Paulis and global low-rank properties such as fidelity. However, in realistic scenarios, quantum noise accumulated with each additional layer of the shallow circuit biases the results. To address these challenges, we propose the \emph{robust shallow shadows protocol}. Our protocol uses Bayesian inference to learn the experimentally relevant noise model and mitigate it in postprocessing. This mitigation introduces a bias-variance trade-off: correcting for noise-induced bias comes at the cost of a larger estimator variance. Despite this increased variance, as we demonstrate on a superconducting quantum processor, our protocol correctly recovers state properties such as expectation values, fidelity, and entanglement entropy, while maintaining a lower sample complexity compared to the random single qubit measurement scheme. We also theoretically analyze the effects of noise on sample complexity and show how the optimal choice of the shallow shadow depth varies with noise strength. This combined theoretical and experimental analysis positions the robust shallow shadow protocol as a scalable, robust, and sample-efficient protocol for characterizing quantum states on current quantum computing platforms.

Significant update: Added new theorems on calibration sample complexity and effective noise models. Expanded discussion on time-dependent Markovian and non-Markovian noise. Included 8 new figures presenting results on method robustness and calibration sample overhead. 28 pages and 13 figures in total

References in corpus (55)

• Real time evolution using the density matrix renormalization group
• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• Quantum advantage in learning from experiments
• Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators
• The randomized measurement toolbox
• Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
• Symmetrised Characterisation of Noisy Quantum Processes
• Provably efficient machine learning for quantum many-body problems
• Matchgates and classical simulation of quantum circuits
• Efficient estimation of Pauli observables by derandomization
• Model-free readout-error mitigation for quantum expectation values
• Fermionic partial tomography via classical shadows
• Robust shadow estimation
• Classical Shadows With Noise
• Experimental Estimation of Quantum State Properties from Classical Shadows
• Classical Shadow Tomography with Locally Scrambled Quantum Dynamics
• Theoretical and Experimental Perspectives of Quantum Verification
• Matchgate Shadows for Fermionic Quantum Simulation
• Deterministic constant-depth preparation of the AKLT state on a quantum processor using fusion measurements
• Experimental quantum state measurement with classical shadows
• Shadows of quantum machine learning
• Machine Learning for Practical Quantum Error Mitigation
• Shadow Distillation: Quantum Error Mitigation with Classical Shadows for Near-Term Quantum Processors
• Shallow shadows: Expectation estimation using low-depth random Clifford circuits
• Quantum machine learning of large datasets using randomized measurements
• Scalable and Flexible Classical Shadow Tomography with Tensor Networks
• Optimising shadow tomography with generalised measurements
• Shadow process tomography of quantum channels
• Quantum scrambling with classical shadows
• Classical Shadows for Quantum Process Tomography on Near-term Quantum Computers
• Operator relaxation and the optimal depth of classical shadows
• Cross-Platform Comparison of Arbitrary Quantum Computations
• Classical shadows with Pauli-invariant unitary ensembles
• Quantum Error Mitigated Classical Shadows
• Shadow tomography from emergent state designs in analog quantum simulators
• Thrifty shadow estimation: re-using quantum circuits and bounding tails
• Robust estimation of the Quantum Fisher Information on a quantum processor
• Performance analysis of multi-shot shadow estimation
• Estimating gate-set properties from random sequences
• Practical Black Box Hamiltonian Learning
• A randomized measurement toolbox for an interacting Rydberg-atom quantum simulator
• Error-mitigated fermionic classical shadows on noisy quantum devices
• Quantum verification and estimation with few copies
• Group-theoretic error mitigation enabled by classical shadows and symmetries
• Dual frame optimization for informationally complete quantum measurements
• Estimating Quantum Hamiltonians via Joint Measurements of Noisy Non-Commuting Observables
• Collective randomized measurements in quantum information processing
• Learning fermionic correlations by evolving with random translationally invariant Hamiltonians
• Tensor network noise characterization for near-term quantum computers
• Stability of classical shadows under gate-dependent noise
• Digital-analog quantum learning on Rydberg atom arrays
• Efficient Classical Shadow Tomography through Many-body Localization Dynamics
• Learning Properties of Quantum States Without the I.I.D. Assumption
• Observing Schrödinger's Cat with Artificial Intelligence: Emergent Classicality from Information Bottleneck

Cited by in corpus (12)

• Efficient self-consistent learning of gate set Pauli noise
• Approximate inverse measurement channel for shallow shadows
• Learning topological states from randomized measurements using variational tensor network tomography
• Sampling Groups of Pauli Operators to Enhance Direct Fidelity Estimation
• Exact spectral gaps of random one-dimensional quantum circuits
• Dual-unitary shadow tomography
• Mitigation of correlated readout errors without randomized measurements
• Low variance estimations of many observables with tensor networks and informationally-complete measurements
• Artificial intelligence for representing and characterizing quantum systems
• An Error Mitigated Non-Orthogonal Quantum Eigensolver via Shadow Tomography
• Moments of Quantum Channel Ensembles
• Learning mixed quantum states in large-scale experiments