# Publications

@article{LP08a,

Abstract = {Belief Propagation algorithms acting on Graphical Models of classical probability distributions, such as Markov Networks, Factor Graphs and Bayesian Networks, are amongst the most powerful known methods for deriving probabilistic inferences amongst large numbers of random variables. This paper presents a generalization of these concepts and methods to the quantum case, based on the idea that quantum theory can be thought of as a noncommutative, operator-valued, generalization of classical probability theory. Some novel characterizations of quantum conditional independence are derived, and definitions of Quantum n-Bifactor Networks, Markov Networks, Factor Graphs and Bayesian Networks are proposed. The structure of Quantum Markov Networks is investigated and some partial characterization results are obtained, along the lines of the Hammersely-Clifford theorem. A Quantum Belief Propagation algorithm is presented and is shown to converge on 1-Bifactor Networks and Markov Networks when the underlying graph is a tree. The use of Quantum Belief Propagation as a heuristic algorithm in cases where it is not known to converge is discussed. Applications to decoding quantum error correcting codes and to the simulation of many-body quantum systems are described. },

Author = {M.S. Leifer and D. Poulin},

Date-Added = {2007-07-26 15:19:50 -0700},

Date-Modified = {2010-05-06 13:41:46 -0400},

Eprint = {arXiv:0708.1337},

Journal = {Ann. Phys.},

Keywords = {Simulation; LDPC; Turbo Codes; Belief propagation},

Local-Url = {LP08a.pdf},

Pages = {1899},

Title = {Quantum graphical models and belief propagation},

Volume = {323},

Year = {2008}}

Abstract = {Belief Propagation algorithms acting on Graphical Models of classical probability distributions, such as Markov Networks, Factor Graphs and Bayesian Networks, are amongst the most powerful known methods for deriving probabilistic inferences amongst large numbers of random variables. This paper presents a generalization of these concepts and methods to the quantum case, based on the idea that quantum theory can be thought of as a noncommutative, operator-valued, generalization of classical probability theory. Some novel characterizations of quantum conditional independence are derived, and definitions of Quantum n-Bifactor Networks, Markov Networks, Factor Graphs and Bayesian Networks are proposed. The structure of Quantum Markov Networks is investigated and some partial characterization results are obtained, along the lines of the Hammersely-Clifford theorem. A Quantum Belief Propagation algorithm is presented and is shown to converge on 1-Bifactor Networks and Markov Networks when the underlying graph is a tree. The use of Quantum Belief Propagation as a heuristic algorithm in cases where it is not known to converge is discussed. Applications to decoding quantum error correcting codes and to the simulation of many-body quantum systems are described. },

Author = {M.S. Leifer and D. Poulin},

Date-Added = {2007-07-26 15:19:50 -0700},

Date-Modified = {2010-05-06 13:41:46 -0400},

Eprint = {arXiv:0708.1337},

Journal = {Ann. Phys.},

Keywords = {Simulation; LDPC; Turbo Codes; Belief propagation},

Local-Url = {LP08a.pdf},

Pages = {1899},

Title = {Quantum graphical models and belief propagation},

Volume = {323},

Year = {2008}}