Previous talks at the SCCS Colloquium

<- Back to the future

This thesis explores the possibility of utilizing the circular belief propagation algorithm to solve the 2D surface code. This algorithm improves upon standard belief propagation specifically for graphs with loops.
Both the possibility of translating the code to a Markov Random field and directly utilizing circular belief propagation to it is considered, as well as converting the code into a tensor network, which is then approximately contracted using circular belief propagation.

Bachelor's thesis presentation. Jonas is advised by Dr. Pedro Hack, and Prof. Dr. Christian B. Mendl.

◄ Back to: Previous talks at the SCCS Colloquium