https://doi.org/10.1140/epjp/s13360-022-02900-7
Regular Article
Ultimate limits to computation: anharmonic oscillator
1
Department of physics, Central Tehran Branch, Islamic Azad University, Tehran, Iran
2
School of Particles and Accelerators, Institute for Research in Fundamental Sciences (IPM), PO Box 19395-5531, Tehran, Iran
Received:
14
February
2022
Accepted:
29
May
2022
Published online:
16
June
2022
Motivated by studies of ultimate speed of computers, we examine the question of minimum time of orthogonalization in a simple anharmonic oscillator and find an upper bound on the rate of computations. Furthermore, we investigate the growth rate of complexity of operation when the system undergoes a definite perturbation. At the phase space of the parameters, by numerical analysis, we find the critical point where beyond that the rate of complexity changes its behavior.
© The Author(s), under exclusive licence to Società Italiana di Fisica and Springer-Verlag GmbH Germany, part of Springer Nature 2022
