The Iterative Unitary Matrix Multiply Method and Its Application to Quantum Kicked Rotator

Tao Ma

Home/Archive/arXiv

arXiv · 0709.2395

The Iterative Unitary Matrix Multiply Method and Its Application to Quantum Kicked Rotator

Tao Ma

View original source ↗Read source document ↗Export metadata ↓

Abstract

We use the iterative unitary matrix multiply method to calculate the long time behavior of the resonant quantum kicked rotator with a large denominator. The delocalization time is exponentially large. The quantum wave delocalizes through degenerate states. At last we construct a nonresonant quantum kicked rotator with delocalization.

Explore related subjects

nlin.CD

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Tao Ma. 2008-01-08. The Iterative Unitary Matrix Multiply Method and Its Application to Quantum Kicked Rotator. https://arxiv.org/abs/0709.2395

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Reservoir as a Dynamical System: A Tutorial Review

This brief tutorial review examines the operation of reservoir computing from the standpoint of nonlinear dynamics and provides a concise overview of recent advances in the field. We begin by delineating the predictive capabilities of reservoir systems, followed by a succinct yet sufficient introduction to the nonlinear dynamical systems techniques that will be employed throughout this article to elucidate reservoir functioning. Subsequently, we describe reservoir operation using these techniques in the context of successful prediction, accompanied by all necessary implementation codes. The objective of this article is to offer a practical guide to the implementation of reservoir computing while, from a nonlinear dynamics perspective, explaining the mechanisms by which reservoirs achieve accurate predictions.

nlin.CD↗

arXiv2026

Chaos Made Visible: Active particles trace Lorenz-like attractors in physical space

Chaotic attractors are typically visualized in an abstract phase space. Here we show that an orientable active particle moving through a steady, two-dimensional, multivortex flow can trace a Lorenz-like chaotic attractor in its real space trajectory. Despite the flow being strictly time independent, coupling between particle position and orientation creates a three-dimensional nonlinear dynamical system. For suitable particle shape and swimming speed, the trajectory organizes into a striking two-lobed geometry reminiscent of the classical Lorenz attractor. A structured first return map, positive largest Lyapunov exponent, and a broadband power spectrum establish that the underlying motion is chaotic. Varying the swimming speed reveals a rich sequence of dynamical regimes as self-propulsion breaks streamline confinement and reorganizes the particle motion. Our results demonstrate how an internal orientational degree of freedom can make chaotic dynamics directly visible in physical space, allowing a single active particle to trace a chaotic attractor as it moves through an otherwise steady flow.

nlin.CD↗

arXiv2026

Self-averaging enables reconstruction of higher-order chaotic networks

Higher-order interactions create a combinatorial space of candidate dynamical terms, making network reconstruction difficult when node dynamics, coupling functions and interaction topology are unknown. Here we identify a regime in which weakly coupled higher-order chaotic networks admit a higher-order interaction reduction. Weak coupling largely preserves the statistical structure of intrinsic chaotic motion, while dense higher-order neighborhoods provide repeated sampling of weakly correlated multi-node inputs received by hub nodes. Consequently, the aggregate interaction field can be represented by a compact function of the hub state, together with a node-dependent offset and finite-neighborhood fluctuations. We exploit this reduction to learn dynamically relevant coupling forms and reconstruct interactions of different orders by sparse regression. Numerical experiments validate the effectiveness of the framework within an effective region of the tested coupling-parameter space, including representative weak-coupling settings. Reconstruction remains stable at the larger network sizes and higher hub-neighborhood densities examined. Additional tests on networks constructed from empirical topologies show that structural priors reduce data requirements and that the framework remains applicable to heterogeneous chaotic dynamics. These results identify reduction of aggregate higher-order inputs as an interpretable route to dimensional compression and joint dynamical and structural reconstruction.

nlin.CD↗