Efficient estimation of Pauli observables by derandomization

Abstract

We consider the problem of jointly estimating expectation values of many Pauli observables, a crucial subroutine in variational quantum algorithms. Starting with randomized measurements, we propose an efficient derandomization procedure that iteratively replaces random single-qubit measurements with fixed Pauli measurements; the resulting deterministic measurement procedure is guaranteed to perform at least as well as the randomized one. In particular, for estimating any $L$ low-weight Pauli observables, a deterministic measurement on only of order $\log (L)$ copies of a quantum state suffices. In some cases, for example when some of the Pauli observables have a high weight, the derandomized procedure is substantially better than the randomized one. Specifically, numerical experiments highlight the advantages of our derandomized protocol over various previous methods for estimating the ground-state energies of small molecules.

arXiv comment12 pages, 2 figures, 1 table; open-source code available at https://github.com/momohuang/predicting-quantum-properties

References in corpus (32)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• The theory of variational hybrid quantum-classical algorithms
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Randomized Benchmarking of Quantum Gates
• Fermionic quantum computation
• Scalable Quantum Simulation of Molecular Energies
• Power of data in quantum machine learning
• Hartree-Fock on a superconducting qubit quantum computer
• Probing entanglement entropy via randomized measurements
• Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Quantum chemistry calculations on a trapped-ion quantum simulator
• Mixed-state entanglement from local randomized measurements
• Information-theoretic bounds on quantum advantage in machine learning
• Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• Tapering off qubits to simulate fermionic Hamiltonians
• Efficient quantum measurement of Pauli operators in the presence of finite sampling error
• Statistical correlations between locally randomized measurements: a toolbox for probing entanglement in many-body quantum states
• Quantum Overlapping Tomography
• Symmetry-resolved dynamical purification in synthetic quantum matter
• Many-body topological invariants from randomized measurements
• Efficient and feasible state tomography of quantum many-body systems
• Many-body Chern number from statistical correlations of randomized measurements
• Cartan sub-algebra approach to efficient measurements of quantum observables
• Near-term quantum algorithms for linear systems of equations
• Importance sampling of randomized measurements for probing entanglement
• An approximate description of quantum states
• Randomized Numerical Linear Algebra: Foundations & Algorithms
• Scalable Bayesian Hamiltonian learning

Cited by in corpus (119)

• The Variational Quantum Eigensolver: a review of methods and best practices
• The randomized measurement toolbox
• Provably efficient machine learning for quantum many-body problems
• Symmetry-resolved entanglement detection using partial transpose moments
• Learning Quantum Systems
• Fermionic partial tomography via classical shadows
• Avoiding barren plateaus using classical shadows
• Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
• Classical Shadows With Noise
• Learning to Measure: Adaptive Informationally Complete Generalized Measurements for Quantum Algorithms
• Approximate amplitude encoding in shallow parameterized quantum circuits and its application to financial market indicator
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• A comprehensive review of Quantum Machine Learning: from NISQ to Fault Tolerance
• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• Quantum Fisher information from randomized measurements
• Probing many-body quantum chaos with quantum simulators
• Exact and efficient Lanczos method on a quantum computer
• Learning quantum data with the quantum Earth Mover's distance
• Cartan sub-algebra approach to efficient measurements of quantum observables
• Toward Practical Quantum Embedding Simulation of Realistic Chemical Systems on Near-term Quantum Computers
• Experimental quantum computational chemistry with optimised unitary coupled cluster ansatz
• Shallow shadows: Expectation estimation using low-depth random Clifford circuits
• Optimising shadow tomography with generalised measurements
• Variational quantum eigensolver for the Heisenberg antiferromagnet on the kagome lattice
• Overlapped grouping measurement: A unified framework for measuring quantum states
• Efficient quantum computation of molecular forces and other energy gradients
• Measuring Arbitrary Physical Properties in Analog Quantum Simulation
• Predicting Gibbs-State Expectation Values with Pure Thermal Shadows
• Classical shadows with Pauli-invariant unitary ensembles
• Quantum Error Mitigated Classical Shadows
• Fluid fermionic fragments for optimizing quantum measurements of electronic Hamiltonians in the variational quantum eigensolver
• Adaptive estimation of quantum observables
• Improving quantum measurements by introducing "ghost" Pauli products
• Stochastic Gradient Line Bayesian Optimization for Efficient Noise-Robust Optimization of Parameterized Quantum Circuits
• Adaptive Pauli Shadows for Energy Estimation
• Learning correlated noise in a 39-qubit quantum processor
• Robust estimation of the Quantum Fisher Information on a quantum processor
• Performance analysis of multi-shot shadow estimation
• Gradient-descent quantum process tomography by learning Kraus operators
• Training variational quantum circuits with CoVaR: covariance root finding with classical shadows
• Learnability transitions in monitored quantum dynamics via eavesdropper's classical shadows
• Conserved charges in the quantum simulation of integrable spin chains
• Characterizing correlation within multipartite quantum systems via local randomized measurements
• Demonstration of Robust and Efficient Quantum Property Learning with Shallow Shadows
• A randomized measurement toolbox for an interacting Rydberg-atom quantum simulator
• Error-mitigated fermionic classical shadows on noisy quantum devices
• Towards a variational Jordan-Lee-Preskill quantum algorithm
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers
• Entanglement estimation in tensor network states via sampling
• Importance sampling for stochastic quantum simulations
• Machine learning on quantum experimental data toward solving quantum many-body problems
• Enhanced estimation of quantum properties with common randomized measurements
• Dual frame optimization for informationally complete quantum measurements
• Mitigating algorithmic errors in quantum optimization through energy extrapolation
• Classical shadows based on locally-entangled measurements
• Estimating Quantum Hamiltonians via Joint Measurements of Noisy Non-Commuting Observables
• Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping
• Measurement optimization of variational quantum simulation by classical shadow and derandomization
• Adaptive Trotterization for time-dependent Hamiltonian quantum dynamics using piecewise conservation laws
• Computationally Efficient Quantum Expectation with Extended Bell Measurements
• Quantum Computing Universal Thermalization Dynamics in a (2+1)D Lattice Gauge Theory
• A blueprint for a Digital-Analog Variational Quantum Eigensolver using Rydberg atom arrays
• Efficient Quantum Simulation of QCD Jets on the Light Front
• Algorithmic Shadow Spectroscopy
• Optimizing the number of measurements for vibrational structure on quantum computers: coordinates and measurement schemes
• Many-body entropies and entanglement from polynomially-many local measurements
• Generation of scalable many-body Bell correlations in spin chains with short-range two-body interactions
• Hardware-Tailored Diagonalization Circuits
• Self-consistent quantum measurement tomography based on semidefinite programming
• Optimising quantum tomography via shadow inversion
• Unitary Partitioning and the Contextual Subspace Variational Quantum Eigensolver
• Randomized measurement protocols for lattice gauge theories
• Techniques for learning sparse Pauli-Lindblad noise models
• Quantum algorithms for generator coordinate methods
• Unified Quantum State Tomography and Hamiltonian Learning Using Transformer Models: A Language-Translation-Like Approach for Quantum Systems
• Probing spectral features of quantum many-body systems with quantum simulators
• Noise-robust ground state energy estimates from deep quantum circuits
• On Classical and Hybrid Shadows of Quantum States
• Exponentially improved efficient machine learning for quantum many-body states with provable guarantees
• Unsupervised Interpretable Learning of Phases From Many-Qubit Systems
• Efficient Strategies for Reducing Sampling Error in Quantum Krylov Subspace Diagonalization
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits
• Efficient measurement schemes for bosonic systems
• The topology of data hides in quantum thermal states
• Quantum algorithms for multivariate Monte Carlo estimation
• Estimating molecular thermal averages with the quantum equation of motion and informationally complete measurements
• QSlack: A slack-variable approach for variational quantum semi-definite programming
• Characterization of coherent errors in gate layers with robustness to Pauli noise
• Random Projection using Random Quantum Circuits
• Quantum Circuit Cutting for Classical Shadows
• Estimating many properties of a quantum state via quantum reservoir processing
• Sampling Groups of Pauli Operators to Enhance Direct Fidelity Estimation
• On the connection between least squares, regularization, and classical shadows
• Learning Quantum Processes with Quantum Statistical Queries
• Retrieving maximum information of symmetric states from their corrupted copies
• Robust Estimation of Nonlinear Properties of Quantum Processes
• Monte Carlo Simulation of Operator Dynamics and Entanglement in Dual-Unitary Circuits
• Adaptive measurement strategy for quantum subspace methods
• NISQ algorithm for the matrix elements of a generic observable
• Biased Estimator Channels for Classical Shadows
• Dual-unitary shadow tomography
• Approximating dynamical correlation functions with constant depth quantum circuits
• Holographic Classical Shadow Tomography
• Resource-efficient quantum algorithm for linear systems of equations
• Robustness of random-control quantum-state tomography
• State preparation and evolution in quantum computing: a perspective from Hamiltonian moments
• Short-time simulation of quantum dynamics by Pauli measurements
• Reducing the sampling complexity of energy estimation in quantum many-body systems using empirical variance information
• Quantum Glassiness From Efficient Learning
• Circuit-Noise-Resilient Virtual Distillation
• Mitigating the measurement overhead of ADAPT-VQE with optimised informationally complete generalised measurements
• Optimal randomized measurements for a family of non-linear quantum properties
• Practical Quantum Reservoir Computing in Rydberg Atom Arrays
• One, Two, Three: One empirical evaluation of a two-copy shadow tomography scheme with triple efficiency
• Improving shadow estimation with locally-optimal dual frames
• Variational Quantum Generative Modeling by Sampling Expectation Values of Tunable Observables
• Classical Shadows with Improved Median-of-Means Estimation
• Resource-Optimized Grouping Shadow for Efficient Energy Estimation
• Quantum solver for single-impurity Anderson models with particle-hole symmetry