A Generalized Statistical Complexity Measure: Applications to Quantum Systems
R. Lopez-Ruiz, A. Nagy, E. Romera, J. Sanudo

TL;DR
This paper introduces a two-parameter family of complexity measures based on Rényei entropies, generalizing existing measures and applying them to analyze quantum systems like the hydrogen atom, harmonic oscillator, and square well.
Contribution
It develops a generalized complexity measure using Rényei entropies and explores its mathematical properties and applications to quantum systems.
Findings
Complexity measures reduce to known forms for specific parameters.
Global and local factors of complexity are characterized.
Complexity calculated for various quantum systems.
Abstract
A two-parameter family of complexity measures based on the R\'enyi entropies is introduced and characterized by a detailed study of its mathematical properties. This family is the generalization of a continuous version of the LMC complexity, which is recovered for and . These complexity measures are obtained by multiplying two quantities bringing global information on the probability distribution defining the system. When one of the parameters, or , goes to infinity, one of the global factors becomes a local factor. For this special case, the complexity is calculated on different quantum systems: H-atom, harmonic oscillator and square well.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
