2000 character limit reached
Statistical complexity of the kicked top model considering chaos
Published 17 Nov 2020 in nlin.CD | (2011.08507v1)
Abstract: The concept of statistical complexity is studied to characterize the classical kicked top model which plays important role in the qbit systems and the chaotic properties of the entanglement. This allows us to understand this driven dynamical system by the probability distribution in phase space to make distinctions among the regular, random and structural complexity on finite simulation. We present the dependence of the kicked top and kicked rotor model through the strength excitation in the framework of statistical complexity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.