Ultimate Limits to Computation: Anharmonic Oscillator

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.

published version

References in corpus (3)

• Quantum Computation as Geometry
• Quantum Computational Complexity -- From Quantum Information to Black Holes and Back
• Complexity for Charged Thermofield Double States

Cited by in corpus (1)

• Position dependence of Nielsen complexity for the Thermofield double state