Belief propagation algorithm for computing correlation functions in finite-temperature quantum many-body systems on loopy graphs
- Creators
- Poulin, David
- Bilgin, Ersen
Abstract
Belief propagation —- a powerful heuristic method to solve inference problems involving a large number of random variables—was recently generalized to quantum theory. Like its classical counterpart, this algorithm is exact on trees when the appropriate independence conditions are met and is expected to provide reliable approximations when operated on loopy graphs. In this paper, we benchmark the performances of loopy quantum belief propagation (QBP) in the context of finite-temperature quantum many-body physics. Our results indicate that QBP provides reliable estimates of the high-temperature correlation function when the typical loop size in the graph is large. As such, it is suitable, e.g., for the study of quantum spin glasses on Bethe lattices and the decoding of sparse quantum error correction codes.
Additional Information
©2008 The American Physical Society. (Received 23 October 2007; published 16 May 2008) We thank Matt Leifer for stimulating discussions on graphical models and QBP. D.P. was supported in part by the Gordon and Betty Moore Foundation, by the NSF under Grant No. PHY-0456720, and by NSERC.Files
Name | Size | Download all |
---|---|---|
md5:c86a0b60a60dfc5285255cadbf831a83
|
141.3 kB | Preview Download |
Additional details
- Eprint ID
- 10556
- Resolver ID
- CaltechAUTHORS:POUpra08
- Created
-
2008-05-17Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field