Related papers: Arnold cat map, Ulam method and time reversal

This paper investigates the chaotic properties of Arnol'd cat maps (ACMs) coupled on the nodes of a circulant graph. By demanding that the system's evolution matrix be symplectic, we determine the coupling matrix, which is naturally…

We introduce a generalized Ulam method and apply it to symplectic dynamical maps with a divided phase space. Our extensive numerical studies based on the Arnoldi method show that the Ulam approximant of the Perron-Frobenius operator on a…

In this paper we construct a sequence of eigenfunctions of the ``quantum Arnold's cat map'' that, in the semiclassical limit, show a strong scarring phenomenon on the periodic orbits of the dynamics. More precisely, those states have a…

The Arnold Cat Map (ACM) is a popular chaotic map used in image encryption. Chaotic maps are known for their sensitivity to initial conditions and their ability to mix, or rearrange, pixels. However, ACM is periodic, and the period is…

Toral automorphisms are widely used (discrete) dynamical systems, the perhaps most prominent example (in 2D) being Arnold's cat map. Given such an automorphism M, its symmetries (i.e. all automorphisms that commute with M) and reversing…

New insight into the correspondence between Quantum Chaos and Random Matrix Theory is gained by developing a semiclassical theory for the autocorrelation function of spectral determinants. We study in particular the unitary operators which…

We define a class of dynamical systems on the sphere analogous to the baker map on the torus. The classical maps are characterized by dynamical entropy equal to ln 2. We construct and investigate a family of the corresponding quantum maps.…

It has been shown that for a certain special type of quantum graphs the random-matrix form factor can be recovered to at least third order in the scaled time \tau using periodic-orbit theory. Two types of contributing pairs of orbits were…

We introduce the notion of the relaxation time for noisy quantum maps on the 2d-dimensional torus - a generalization of previously studied dissipation time. We show that relaxation time is sensitive to the chaotic behavior of the…

We study various aspects of the dynamics induced by integer matrices on the invariant rational lattices of the torus in dimension 2 and greater. Firstly, we investigate the orbit structure when the toral endomorphism is not invertible on…

This paper presents a regenerative variant of the classical Ulam-von Neumann Markov chain Monte Carlo algorithm for the approximation of the matrix inverse. The algorithm presented in this paper, termed regenerative Ulam-von Neumann…

We study numerically the statistics of Poincar\'e recurrences for the Chirikov standard map and the separatrix map at parameters with a critical golden invariant curve. The properties of recurrences are analyzed with the help of a…

Chaotic dynamics is an important source for generating pseudorandom binary sequences (PRNS). Much efforts have been devoted to obtaining period distribution of the generalized discrete Arnold's Cat map in various domains using all kinds of…

A discrete dynamical system known as Arnold's Discrete Cat Map (Arnold's DCM) is given by (x_t+1, y_t+1) = (x_t + y_t, x_t + 2y_t) mod N; which acts on a two-dimensional square coordinate grid of size Nx?N. The defining characteristic of…

We consider how to tell the time-ordering associated with measurement data from quantum experiments at two times and any number of qubits. We define an arrow of time inference problem. We consider conditions on the initial and final states…

We construct Arnol'd cat map lattice field theories in phase space and configuration space. In phase space we impose that the evolution operator of the linearly coupled maps be an element of the symplectic group, in direct generalization of…

We show on the example of the Arnold cat map that classical chaotic systems can be simulated with exponential efficiency on a quantum computer. Although classical computer errors grow exponentially with time, the quantum algorithm with…

While the microscopic laws of physics are often symmetric under time reversal, most natural processes that we observe are not. The emergent asymmetry between typical and time-reversed processes is referred to as the arrow of time. In…

A new O(N) algorithm based on a recursion method, in which the computational effort is proportional to the number of atoms N, is presented for calculating the inverse of an overlap matrix which is needed in electronic structure calculations…

Krylov quantum diagonalization methods have emerged as a promising use case for quantum computers. However, many existing implementations rely on controlled operations, which pose challenges to near-term quantum hardware. We introduce a…