Ultimate Limits to Computation: Anharmonic Oscillator
arXiv:2103.03124 · doi:10.1140/epjp/s13360-022-02900-7
Abstract
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.
arXiv commentpublished version
References in corpus (10)
- Ultimate physical limits to computation
- The maximum speed of dynamical evolution
- Complexity Equals Action
- Quantum Computation as Geometry
- Circuit complexity in quantum field theory
- Quantum Computational Complexity -- From Quantum Information to Black Holes and Back
- Circuit Complexity for Coherent States
- Complexity is Simple
- Complexity for Charged Thermofield Double States
- On the Complexity of a Charged Quantum Oscillator