Abstract We study the consequences of having translational invariance in space and time in many-body quantum chaotic systems. We consider ensembles of random quantum circuits as minimal models of translational invariant many-body quantum chaotic systems. We evaluate the spectral form factor as a sum over many-body Feynman diagrams in the limit of large local Hilbert space dimension q . At sufficiently large t , diagrams corresponding to rigid translations dominate, reproducing the random matrix theory (RMT) behaviour. At finite t , we show that translational invariance introduces additional mechanisms via two novel Feynman diagrams which delay the emergence of RMT. Our analytics suggests the existence of exact scaling forms which describe the approach to RMT behavior in the scaling limit where both t and L are large while the ratio between L and L Th ( t ), the many-body Thouless length, is fixed. We numerically demonstrate, with simulations of two distinct circuit models, that the resulting scaling functions are universal in the scaling limit.
more »
« less
Edge limits of truncated circular beta ensembles
We study the scaling limit of the rank-one truncation of various beta ensemble generalizations of classical unitary/orthogonal random matrices: the circular beta ensemble, the real orthogonal beta ensemble, and the circular Jacobi beta ensemble. We derive the scaling limit of the normalized characteristic polynomials and the point process limit of the eigenvalues near the point 1. We also treat multiplicative rank one perturbations of our models. Our approach relies on a representation of truncated beta ensembles given by Killip-Kozhan [24], together with the random operator framework developed in [42, 43, 44] to study scaling limits of beta ensembles.
more »
« less
- Award ID(s):
- 2246435
- PAR ID:
- 10612855
- Publisher / Repository:
- Institute of Mathematical Statistics and Bernoulli Society
- Date Published:
- Journal Name:
- Electronic Journal of Probability
- Volume:
- 30
- ISSN:
- 1083-6489
- Page Range / eLocation ID:
- 1-46
- Subject(s) / Keyword(s):
- beta ensemble non-normal perturbation random differential operator random matrix
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract We consider the discrete defocusing nonlinear Schrödinger equation in its integrable version, which is called defocusing Ablowitz–Ladik lattice. We consider periodic boundary conditions with period N and initial data sampled according to the Generalized Gibbs ensemble. In this setting, the Lax matrix of the Ablowitz–Ladik lattice is a random CMV-periodic matrix and it is related to the Killip-Nenciu Circular $$\beta $$ β -ensemble at high-temperature. We obtain the generalized free energy of the Ablowitz–Ladik lattice and the density of states of the random Lax matrix by establishing a mapping to the one-dimensional log-gas. For the Gibbs measure related to the Hamiltonian of the Ablowitz–Ladik flow, we obtain the density of states via a particular solution of the double-confluent Heun equation.more » « less
-
Abstract In this paper we consider the problem of recovering a low-rank Tucker approximation to a massive tensor based solely on structured random compressive measurements (i.e., a sketch). Crucially, the proposed random measurement ensembles are both designed to be compactly represented (i.e., low-memory), and can also be efficiently computed in one-pass over the tensor. Thus, the proposed compressive sensing approach may be used to produce a low-rank factorization of a huge tensor that is too large to store in memory with a total memory footprint on the order of the much smaller desired low-rank factorization. In addition, the compressive sensing recovery algorithm itself (which takes the compressive measurements as input, and then outputs a low-rank factorization) also runs in a time which principally depends only on the size of the sought factorization, making its runtime sub-linear in the size of the large tensor one is approximating. Finally, unlike prior works related to (streaming) algorithms for low-rank tensor approximation from such compressive measurements, we present a unified analysis of both Kronecker and Khatri-Rao structured measurement ensembles culminating in error guarantees comparing the error of our recovery algorithm’s approximation of the input tensor to the best possible low-rank Tucker approximation error achievable for the tensor by any possible algorithm. We further include an empirical study of the proposed approach that verifies our theoretical findings and explores various trade-offs of parameters of interest.more » « less
-
A bstract We study operators in the rank- j totally symmetric representation of O ( N ) in the critical O ( N ) model in arbitrary dimension d , in the limit of large N and large charge j with j/N ≡ $$ \hat{j} $$ j ̂ fixed. The scaling dimensions of the operators in this limit may be obtained by a semiclassical saddle point calculation. Using the standard Hubbard-Stratonovich description of the critical O ( N ) model at large N , we solve the relevant saddle point equation and determine the scaling dimensions as a function of d and $$ \hat{j} $$ j ̂ , finding agreement with all existing results in various limits. In 4 < d < 6, we observe that the scaling dimension of the large charge operators becomes complex above a critical value of the ratio j/N , signaling an instability of the theory in that range of d . Finally, we also derive results for the correlation functions involving two “heavy” and one or two “light” operators. In particular, we determine the form of the “heavy-heavy-light” OPE coefficients as a function of the charges and d .more » « less
-
We study maximal length collections of disjoint paths, or ‘disjoint optimizers’, in the directed landscape. We show that disjoint optimizers always exist, and that their lengths can be used to construct an extended directed landscape. The extended directed landscape can be built from an independent collection of extended Airy sheets, which we define from the parabolic Airy line ensemble. We show that the extended directed landscape and disjoint optimizers are scaling limits of the corresponding objects in Brownian last passage percolation (LPP). As two consequences of this work, we show that one direction of the Robinson-Schensted-Knuth bijection passes to the KPZ limit, and we find a criterion for geodesic disjointness in the directed landscape that uses only a single parabolic Airy line ensemble. The proofs rely on a new notion of multi-point LPP across the parabolic Airy line ensemble, combinatorial properties of multi-point LPP, and probabilistic resampling ideas.more » « less
An official website of the United States government

