Computing matrix permanent with collective boson operators
Year: 2016
Type: preprint
Abstract: Computing permanents of matrices are known to be a classically hard problem that the computational cost grows exponentially with the size of the matrix increases. So far, there exist a few classical algorithms to compute the matrix permanents in deterministic and in randomized ways. By exploiting the series expansion of products of boson operators regarding collective boson operators, a generalized algorithm for computing permanents is developed that the algorithm can handle the arbitrary matrices with repeated columns and rows. In a particular case, the formula is reduced to Glynn's form. Not only the algorithm can be used for a deterministic direct calculation of the matrix permanent but also can be expressed as a sampling problem like Gurvits's randomized algorithm.
Source: arXiv (Cornell University)
Author: Joonsuk Huh
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2404761294