Investigation of commuting Hamiltonian in quantum Markov network
From MaRDI portal
Publication:490391
Abstract: Graphical Models have various applications in science and engineering which include physics, bioinformatics, telecommunication and etc. Usage of graphical models needs complex computations in order to evaluation of marginal functions,so there are some powerful methods including mean field approximation, belief propagation algorithm and etc. Quantum graphical models have been recently developed in context of quantum information and computation, and quantum statistical physics, which is possible by generalization of classical probability theory to quantum theory. The main goal of this paper is preparing a primary generalization of Markov network, as a type of graphical models, to quantum case and applying in quantum statistical physics.We have investigated the Markov network and the role of commuting Hamiltonian terms in conditional independence with simple examples of quantum statistical physics.
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 2061729 (Why is no real title available?)
- Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
- Factor graphs and the sum-product algorithm
- Learning low-level vision
- Quantum graphical models and belief propagation
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Survey propagation: An algorithm for satisfiability
Cited in
(1)
This page was built for publication: Investigation of commuting Hamiltonian in quantum Markov network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490391)