Rényi and Tsallis entropies related to eigenfunctions of quantum graphs
arXiv:1612.09231 · doi:10.1088/1751-8121/aa6b74
Abstract
For certain families of finite quantum graphs, we study the question of how eigenfunctions are distributed over the graph. To characterize properties of the distribution, generalized entropies of the Rényi and Tsallis types are considered. The presented approach is similar to entropic uncertainty relations of the Maassen-Uffink type. Using the Riesz theorem, we derive lower bounds on symmetrized generalized entropies of eigenfunctions. A quality of such estimates will depend on boundary conditions used at vertices of the given graph. Rényi and Tsallis entropies of eigenfunctions of star graphs are separately examined. Relations between generalized entropies and variances of eigenfunctions are considered as well. When such relations remain valid on average, they may be used in studies of quantum ergodicity.
13 pages, no figures. Minor improvements in the version 2. The bibliography is extended and updated
References in corpus (6)
- Formulation of the uncertainty relations in terms of the Renyi entropies
- On uncertainty relations and entanglement detection with mutually unbiased measurements
- Quantum graphs where back-scattering is prohibited
- Quantum ergodicity on graphs
- On generalized entropies and information-theoretic Bell inequalities under decoherence
- Entropy of eigenfunctions on quantum graphs