Computationally Efficient Quantum Expectation with Extended Bell Measurements
Abstract
Evaluating an expectation value of an arbitrary observable through na\"ive Pauli measurements requires a large number of terms to be evaluated. We approach this issue using a method based on Bell measurement, which we refer to as the extended Bell measurement method. This analytical method quickly assembles the matrix elements into at most groups for simultaneous measurements in time, where is the number of non-zero elements of . The number of groups is particularly small when is a band matrix. When the bandwidth of is , the number of groups for simultaneous measurement reduces to . In addition, when non-zero elements densely fill the band, the variance is , which is small compared with the variances of existing methods. The proposed method requires a few additional gates for each measurement, namely one Hadamard gate, one phase gate and at most CNOT gates. Experimental results on an IBM-Q system show the computational efficiency and scalability of the proposed scheme, compared with existing state-of-the-art approaches. Code is available at https://github.com/ToyotaCRDL/extended-bell-measurements.
Cite
@article{arxiv.2110.09735,
title = {Computationally Efficient Quantum Expectation with Extended Bell Measurements},
author = {Ruho Kondo and Yuki Sato and Satoshi Koide and Seiji Kajita and Hideki Takamatsu},
journal= {arXiv preprint arXiv:2110.09735},
year = {2022}
}
Comments
33 pages, 12 figures; most of the details of section 2 have been moved to the Appendix; added variance analysis and comparison with the classical shadow; code is available at https://github.com/ToyotaCRDL/extended-bell-measurements