Related papers: Emergent random matrix universality in quantum ope…
We give an overview of the recursive characterisations of random matrix ensembles that are currently at the forefront of random matrix theory by way of studying two classes of ensembles using two different types of recursive schemes:…
We consider symmetric and Hermitian random matrices whose entries are independent and symmetric random variables with an arbitrary variance pattern. Under a novel Short-to-Long Mixing condition, which is sharp in the sense that it precludes…
Previous results indicate that while chaos can lead to substantial entropy production, thereby maximizing dynamical entanglement, this still falls short of maximality. Random Matrix Theory (RMT) modeling of composite quantum systems,…
A branching random walk algorithm for the many-body Wigner equation and its numerical applications for quantum dynamics in phase space are proposed and analyzed. After introducing an auxiliary function, the (truncated) Wigner equation is…
We present a probabilistic analysis of two Krylov subspace methods for solving linear systems. We prove a central limit theorem for norms of the residual vectors that are produced by the conjugate gradient and MINRES algorithms when applied…
We introduce a simple quantum generalization of the spectrum of classical Lyapunov exponents. We apply it to the SYK and XXZ models, and study the Lyapunov growth and entropy production. Our numerical results suggest that a black hole is…
Following E. Wigner's original vision, we prove that sampling the eigenvalue gaps within the bulk spectrum of a fixed (deformed) Wigner matrix $H$ yields the celebrated Wigner-Dyson-Mehta universal statistics with high probability.…
We prove the universal asymptotically almost sure non-singularity of general Ginibre and Wigner ensembles of random matrices when the distribution of the entries are independent but not necessarily identically distributed and may depend on…
We study the eigenvector mass distribution for generalized Wigner matrices on a set of coordinates $I$, where $N^\varepsilon \le | I | \le N^{1- \varepsilon}$, and prove it converges to a Gaussian at every energy level, including the edge,…
We investigate random complex dynamics of rational or polynomial maps on the Riemann sphere. We show that regarding random complex dynamics of polynomials, generically, the chaos of the averaged system disappears at any point in the Riemann…
The main objects under consideration in this thesis are called maps, a certain class of graphs embedded on surfaces. Our problems have a powerful relatively recent tool in common, the so-called topological recursion (TR) introduced by…
Products of $M$ i.i.d. random matrices of size $N \times N$ are related to classical limit theorems in probability theory ($N=1$ and large $M$), to Lyapunov exponents in dynamical systems (finite $N$ and large $M$), and to universality in…
The theoretical description of quantum dynamics in an intriguing way does not necessarily imply the underlying dynamics is indeed intriguing. Here we show how a known very interesting master equation with an always negative decay rate…
Grover's search algorithm is the cornerstone of many applications of quantum computing, providing a quadratic speed-up over classical methods. One limitation of the algorithm is that it requires knowledge of the number of solutions to…
We map the dynamics of entanglement in random unitary circuits, with finite on-site Hilbert space dimension $q$, to an effective classical statistical mechanics, and develop general diagrammatic tools for calculations in random unitary…
Matrix theories exhibit the phenomenon of spacetime emergence in certain regimes of their dynamics. In this work, I posit that the key to this emergence is a hierarchy between two timescales -- very slow modes that an observer measures plus…
This article studies the Gram random matrix model $G=\frac1T\Sigma^{\rm T}\Sigma$, $\Sigma=\sigma(WX)$, classically found in the analysis of random feature maps and random neural networks, where $X=[x_1,\ldots,x_T]\in{\mathbb R}^{p\times…
We introduce a quantum extension of dynamic programming, a fundamental computational method that efficiently solves recursive problems using memory. Our innovation lies in showing how to coherently generate recursion step unitaries by using…
We study universal traits which emerge both in real-world complex datasets, as well as in artificially generated ones. Our approach is to analogize data to a physical system and employ tools from statistical physics and Random Matrix Theory…
We introduce a generalization of Wegner's $n$-orbital model for the description of randomly disordered systems by replacing his ensemble of Gaussian random matrices by an ensemble of randomly rotated matrices. We calculate the one- and…