Information scrambling, the process by which quantum information spreads and becomes effectively inaccessible, is central to modern quantum statistical physics and quantum chaos. These lecture notes provide an introduction to information scrambling from both static and dynamical perspectives. The spectral properties of reduced density matrices arising from Haar-random states are developed through the geometry of the unitary group and the universal results of random matrix theory. This geometric framework yields universal, model-independent predictions for entanglement and spectral statistics, capturing generic features of quantum chaos without reference to microscopic details. Dynamical diagnostics such as the spectral form factor and out-of-time-ordered correlators further reveal the onset of chaos in time-dependent evolution.
The notes are aimed at advanced undergraduate and graduate students in physics, mathematics, and computer science who are interested in the connections between quantum chaos, information dynamics, and quantum computing. Concepts such as entanglement growth, Haar randomness, random-matrix statistics, and unitary t-designs are introduced through their realization in random quantum circuits and circuit complexity. The same mathematical framework also underpins modern quantum-device benchmarking, where approximate unitary designs and random circuits translate geometric ideas into quantitative tools for assessing fidelity, noise, and scrambling efficiency in real quantum processors.
Using the methods of quantum trajectories we investigate the effects of dissipative decoherence in a quantum computer algorithm simulating dynamics in various regimes of quantum chaos including dynamical localization, the quantum ergodic regime, and quasi-integrable motion. As an example we use the quantum sawtooth algorithm which can be implemented in a polynomial number of quantum gates. It is shown that the fidelity of quantum computation decays exponentially with time and that the decay rate is proportional to the number of qubits, number of quantum gates, and per gate dissipation rate induced by external decoherence. In the limit of strong dissipation the quantum algorithm generates a quantum attractor which may have a complex or simple structure. We also compare the effects of dissipative decoherence with the effects of static imperfections.