Investigation of commuting Hamiltonian in quantum Markov network

DOI10.1007/S10773-014-2042-8zbMATH Open1308.81127arXiv1309.7068OpenAlexW3100753099MaRDI QIDQ490391FDOQ490391

Authors: Farzad Ghafari Jouneghani, Mohammad Babazadeh, Rogayeh Bayramzadeh, Hossein Movla 

Publication date: 22 January 2015

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1309.7068

Recommendations

• Quantum graphical models and belief propagation
• Duality of graphical models and tensor networks
• Quantum Markov fields on graphs
• Graphical models
• Quantum Markov chains on comb graphs: Ising model

zbMATH Keywords

graphical modelsconditional independencecommuting Hamiltonianquantum conditional independencequantum graphical modelsquantum Markov network

Mathematics Subject Classification ID

Quantum stochastic calculus (81S25)

Cites Work

• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Learning low-level vision
• Title not available (Why is that?)
• Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
• Factor graphs and the sum-product algorithm
• Quantum graphical models and belief propagation
• Survey propagation: An algorithm for satisfiability

Cited In (1)

• Learning a flexible \(K\)-dependence Bayesian classifier from the chain rule of joint probability distribution

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)