Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
This talk explores the application of Simulated Bifurcation (SB), a quantum-inspired algorithm, to solve community detection problems in networks. Learn how speaker Konrad Tywoniuk from the University of Bergen demonstrates SB's effectiveness in identifying community structures in benchmark networks like Zachary's Karate Club and the IEEE 33-bus system. Discover how this approach to the NP-hard graph partitioning problem achieves high modularity scores that match Fujitsu's Digital Annealer and outperform results from quantum machines like D-Wave and IBM. The presentation highlights SB's potential as a powerful tool for complex network analysis with applications across transportation, smart power grids, and other fields where efficient community detection algorithms are crucial.
