Affiliation:
1. Department of Computer Science, Lund University, Sweden
2. Xanadu, Toronto, Canada
Abstract
We introduce new and simple algorithms for the calculation of the number of perfect matchings of complex weighted, undirected graphs with and without loops. Our compact formulas for the hafnian and loop hafnian of
n
×
n
complex matrices run in
O
(
n
3
2
n
/2
) time, are embarrassingly parallelizable and, to the best of our knowledge, are the fastest exact algorithms to compute these quantities. Despite our highly optimized algorithm, numerical benchmarks on the Titan supercomputer with matrices up to size 56 × 56 indicate that one would require the 288,000 CPUs of this machine for about 6 weeks to compute the hafnian of a 100 × 100 matrix.
Funder
Office of Science of the U.S. Department of Energy
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献