Computing the Entropy of a Large Matrix
arXiv:1209.25750.2521 citationsh-index: 30
AI Analysis30
It addresses the computational bottleneck of entropy calculation for large matrices, which is relevant in fields like quantum optics.
The paper presents an efficient algorithm for approximating the entropy of large symmetric positive semidefinite matrices, demonstrated on a quantum-optics application.
Given a large real symmetric, positive semidefinite m-by-m matrix, the goal of this paper is to show how a numerical approximation of the entropy, given by the sum of the entropies of the individual eigenvalues, can be computed in an efficient way. An application from quantum-optics illustrates the new algorithm.