arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.03124quant-phhep-th

Ultimate Limits to Computation: Anharmonic Oscillator

Fatemeh Khorasani, Mohammad Reza Tanhayi, Reza Pirmoradian

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑