Yen Tzu-Ching, Ganeshram Aadithya, Izmaylov Artur F
Chemical Physics Theory Group, Department of Chemistry, University of Toronto, Toronto, ON M5S 3H6 Canada.
Department of Physical and Environmental Sciences, University of Toronto, Scarborough, Toronto, ON M1C 1A4 Canada.
npj Quantum Inf. 2023;9(1):14. doi: 10.1038/s41534-023-00683-y. Epub 2023 Feb 22.
Obtaining the expectation value of an observable on a quantum computer is a crucial step in the variational quantum algorithms. For complicated observables such as molecular electronic Hamiltonians, one of the strategies is to present the observable as a linear combination of measurable fragments. The main problem of this approach is a large number of measurements required for accurate estimation of the observable's expectation value. We consider three previously studied directions that minimize the number of measurements: (1) grouping commuting operators using the greedy approach, (2) involving non-local unitary transformations for measuring, and (3) taking advantage of compatibility of some Pauli products with several measurable groups. The last direction gives rise to a general framework that not only provides improvements over previous methods but also connects measurement grouping approaches with recent advances in techniques of shadow tomography. Following this direction, we develop two measurement schemes that achieve a severalfold reduction in the number of measurements for a set of model molecules compared to previous state-of-the-art methods.
在量子计算机上获取可观测量的期望值是变分量子算法中的关键一步。对于诸如分子电子哈密顿量这样复杂的可观测量,一种策略是将可观测量表示为可测量片段的线性组合。这种方法的主要问题是为了准确估计可观测量的期望值需要进行大量测量。我们考虑了三个先前研究过的可减少测量次数的方向:(1)使用贪心方法对可对易算符进行分组,(2)引入用于测量的非局部酉变换,以及(3)利用一些泡利积与几个可测量组的兼容性。最后一个方向产生了一个通用框架,该框架不仅比以前的方法有所改进,而且将测量分组方法与阴影层析成像技术的最新进展联系起来。沿着这个方向,我们开发了两种测量方案,与之前的最先进方法相比,对于一组模型分子,测量次数实现了几倍的减少。