Ultimate limits to computation: anharmonic oscillator
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...
Gespeichert in:
Veröffentlicht in: | European physical journal plus 2022-06, Vol.137 (6), p.699, Article 699 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 2190-5444 2190-5444 |
DOI: | 10.1140/epjp/s13360-022-02900-7 |