Computing the entropy of a large matrix

DOI10.1088/1751-8113/47/24/245201MaRDI QIDQ5169534zbMATH OpenOpenAlexWikidataFDO

Authors Thomas P. Wihler, B. Bessire, A. Stefanov

Publication date 10 July 2014

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1209.2575

zbMATH Keywords

entanglement measureentropylarge matrices

Mathematics Subject Classification ID

Entropy and other invariants (28D20) Numerical interpolation (65D05) Quantum coherence, entanglement, quantum correlations (81P40) Quantum optics (81V80) Measures of information, entropy (94A17)

Abstract: 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.

Recommendations

• Quantum dynamical entropy and an algorithm by Gene Golub
• Quantum entropies of nonprobabilistic matrices
• scientific article; zbMATH DE number 895646
• Von Neumann entropy penalization and low-rank matrix estimation
• Quantum algorithmic entropy

Cited in

(7)

• The entropy of open finite-level systems
• Entropy of square non-negative matrices.
• Entropy of orthogonal matrices and minimum distance orthostochastic matrices from the uniform van der Waerden matrices
• Computation of the von Neumann entropy of large matrices via trace estimators and rational Krylov methods
• Efficient fidelity estimation: alternative derivation and related applications
• On the maximum of entropy for orthogonal matrices
• Quantum dynamical entropy and an algorithm by Gene Golub

This page was built for publication: Computing the entropy of a large matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5169534)