Quantum computing of Poincaré recurrences and periodic orbits

Quantum algorithms are built enabling Poincar\'e recurrence times and periodic orbits of classical dynamical systems to be found. 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 a small number of qubits.