.png){kind=icon}
返回
Trimmed sampling algorithm for the noisy generalized eigenvalue problem
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevResearch.5.L022001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Solving the generalized eigenvalue problem is a useful method for finding energy eigenstates of large quantum systems. It uses projection onto a set of basis states which are typically not orthogonal. One needs to invert a matrix whose entries are inner products of the basis states, and the process is unfortunately susceptible to even small errors. The problem is especially bad when matrix elements are evaluated using stochastic methods and have significant error bars. In this work, we introduce the trimmed sampling algorithm in order to solve this problem. Using the framework of Bayesian inference, we sample prior probability distributions determined by uncertainty estimates of the various matrix elements and likelihood functions composed of physics-informed constraints. The result is a probability distribution for the eigenvectors and observables which automatically comes with a reliable estimate of the error and performs far better than standard regularization methods. The method should have immediate use for a wide range of applications involving classical and quantum computing calculations of large quantum systems.
期刊
IF:
4.2
论文数:
7.6K
被引数:
2.7W
机构
引用论文
A variational eigenvalue solver on a photonic quantum processor光子量子处理器上的变分特征值求解器.png)
NATURE COMMUNICATIONS
OAAI
NATURE COMMUNICATIONSIF15.7
OAAI分享收藏Get on the BAND Wagon: a Bayesian framework for quantifying model uncertainties in nuclear dynamicsOAAI
OAAI分享收藏The physiological effects of cigarette smoking: Implications for psychophysiological research吸烟的生理效应: 对心理生理学研究的启示
PREAI
分享收藏
查看更多内容