Nearly Optimal Quantum Algorithm for Estimating Multiple Expectation Values
arXiv:2111.09283 · doi:10.1103/PhysRevLett.129.240501
Abstract
Many quantum algorithms involve the evaluation of expectation values. Optimal strategies for estimating a single expectation value are known, requiring a number of state preparations that scales with the target error as . In this paper, we address the task of estimating the expectation values of different observables, each to within additive error , with the same dependence. We describe an approach that leverages Gilyén et al.'s quantum gradient estimation algorithm to achieve scaling up to logarithmic factors, regardless of the commutation properties of the observables. We prove that this scaling is worst-case optimal in the high-precision regime if the state preparation is treated as a black box, even when the operators are mutually commuting. We highlight the flexibility of our approach by presenting several generalizations, including a strategy for accelerating the estimation of a collection of dynamic correlation functions.
References in corpus (5)
Cited by in corpus (11)
- Efficient quantum computation of molecular forces and other energy gradients
- Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods
- Optimizing the information extracted by a single qubit measurement
- Estimating Quantum Hamiltonians via Joint Measurements of Noisy Non-Commuting Observables
- On quantum algorithms for the Schrödinger equation in the semi-classical regime
- Inferring physical properties of symmetric states from the fewest copies
- Tight Bound for Estimating Expectation Values from a System of Linear Equations
- Quantum-enhanced mean value estimation via adaptive measurement
- Almost optimal measurement scheduling of molecular Hamiltonian via finite projective plane
- Quantum memory assisted observable estimation
- Expanding the reach of quantum optimization with fermionic embeddings