Quantum Computing of Poincare Recurrences and Periodic Orbits
英文摘要:
Quantum algorithms are built enabling to find Poincaré recurrence times and periodic orbits of classical dynamical systems. It is shown that exponential gain compared to classical algorithms can be reached for a restricted class of systems. Quadratic gain can be achieved for a larger set of dynamical systems. The simplest cases can be implemented with small number of qubits.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。