Information-Theoretic Features of Many Fermion Systems: An Exploration Based on Exactly Solvable Models

Entropy

Angel Ricardo Plastino¹  Angelo Plastino²  Diana Monteoliva³ 

[1] CeBio—Departamento de Ciencias Básicas, Universidad Nacional del Noroeste de la Prov. de Buenos Aires, CONICET, Junin 1988, Argentina;Instituto de Física La Plata—CCT-CONICET, Universidad Nacional de La Plata, C.C. 727, La Plata 1900, Argentina;UNLP—Comisión de Investigaciones Científicas Provincia de Buenos Aires La Plata, La Plata 1900, Argentina;

关键词: exactly solvable model;    pairing interaction;    monopole interaction;   

DOI  :  10.3390/e23111488

来源: DOAJ

【 摘 要 】

Finite quantum many fermion systems are essential for our current understanding of Nature. They are at the core of molecular, atomic, and nuclear physics. In recent years, the application of information and complexity measures to the study of diverse types of many-fermion systems has opened a line of research that elucidates new aspects of the structure and behavior of this class of physical systems. In this work we explore the main features of information and information-based complexity indicators in exactly soluble many-fermion models of the Lipkin kind. Models of this kind have been extremely useful in shedding light on the intricacies of quantum many body physics. Models of the Lipkin kind play, for finite systems, a role similar to the one played by the celebrated Hubbard model of solid state physics. We consider two many fermion systems and show how their differences can be best appreciated by recourse to information theoretic tools. We appeal to information measures as tools to compare the structural details of different fermion systems. We will discover that few fermion systems are endowed by a much larger complexity-degree than many fermion ones. The same happens with the coupling-constants strengths. Complexity augments as they decrease, without reaching zero. Also, the behavior of the two lowest lying energy states are crucial in evaluating the system’s complexity.

【 授权许可】

Unknown