.png){kind=icon}
Return
Trimmed sampling algorithm for the noisy generalized eigenvalue problem
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevResearch.5.L022001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Journal
IF:
4.2
Papers:
7.6K
Citations:
2.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveGet on the BAND Wagon: a Bayesian framework for quantifying model uncertainties in nuclear dynamicsOAAI
OAAIShareSaveShareSaveShareSave
View more