Quantum expectation-value estimation by computational basis sampling
Masaya Kohda, Ryosuke Imai, Keita Kanno, Kosuke Mitarai, Wataru, Mizukami, Yuya O. Nakagawa

TL;DR
This paper introduces a quantum expectation-value estimation method using computational basis sampling, reducing measurement counts significantly for certain states, thereby potentially accelerating variational quantum algorithms.
Contribution
The paper presents a novel sampling-based algorithm that estimates expectation values with fewer measurements, especially effective for states concentrated in specific computational basis states.
Findings
Reduces measurement counts by several orders of magnitude for certain molecules.
Numerical comparisons show improved efficiency over existing methods.
Applicable to electronic ground state energy measurements in quantum chemistry.
Abstract
Measuring expectation values of observables is an essential ingredient in variational quantum algorithms. A practical obstacle is the necessity of a large number of measurements for statistical convergence to meet requirements of precision, such as chemical accuracy in the application to quantum chemistry computations. Here we propose an algorithm to estimate the expectation value based on its approximate expression as a weighted sum of classically-tractable matrix elements with some modulation, where the weight and modulation factors are evaluated by sampling appropriately prepared quantum states in the computational basis on quantum computers. Each of those states is prepared by applying a unitary transformation consisting of at most N CNOT gates, where N is the number of qubits, to a target quantum state whose expectation value is evaluated. Our algorithm is expected to require fewer…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
