Belief propagation in monoidal categories

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations


We discuss a categorical version of the celebrated belief propagation algorithm. This provides a way to prove that some algorithms which are known or suspected to be analogous, are actually identical when formulated generically. It also highlights the computational point of view in monoidal categories.

Original languageEnglish (US)
Pages (from-to)262-269
Number of pages8
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
StatePublished - Dec 28 2014
Event11th Workshop on Quantum Physics and Logic, QPL 2014 - Kyoto, Japan
Duration: Jun 4 2014Jun 6 2014

All Science Journal Classification (ASJC) codes

  • Software

Cite this