Search NASA⌕ Search

SEARCH · Search NASA

Results for “Random Matrix Theory”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Random Matrix Theory in Cd isotopes

Random matrix theory (RMT) is used to provide a measure of the chaoticity (q) of calculated results for the spectra for various Cd isotopes. Here, the goal is to gain a better understanding of the internal dynamics in play; namely, whether it tracks with regular or irregular (chaotic) behavior as determined through an RMT analyses of calculated spectra. The basis-state configurations used to determine the spectra includes all positive, negative, natural (J π = 1 – , 2 + , ...), and unnatural parity configurations (J π = 0 – , 1 + , 2 – , ...), unless suppressed for comparative purposes. The results show that when intruder-state configurations are in play, regular behavior emerges, but when not in play, chaotic behavior seems to dominate the dynamics.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Low-temperature random matrix theory at the soft edge

“Low temperature” random matrix theory is the study of random eigenvalues as energy is removed. In standard notation, β is identified with inverse temperature, and low temperatures are achieved through the limit β → ∞. In this paper, we derive statistics for low-temperature random matrices at the “soft edge,” which describes the extreme eigenvalues for many random matrix distributions. Specifically, new asymptotics are found for the expected value and standard deviation of the general-β Tracy-Widom distribution. The new techniques utilize beta ensembles, stochastic differential operators, and Riccati diffusions. The asymptotics fit known high-temperature statistics curiously well and contribute to the larger program of general-β random matrix theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modular-Invariant Random Matrix Theory and AdS 3 Wormholes

We develop a nonperturbative definition of RMT 2 : a generalization of random matrix theory that is compatible with the symmetries of two-dimensional conformal field theory. Given any random matrix ensemble, its 𝑛-point spectral correlations admit a prescribed modular-invariant lift to RMT 2 , which moreover reduce to the original random matrix correlators in a near-extremal limit. Central to the prescription is a presentation of random matrix theory in Mellin space, which lifts to two dimensions via the SL⁡(2,ℤ) spectral decomposition employed in previous work. As a demonstration we perform the explicit RMT 2 lift of two-point correlations of the GUE Airy model. We propose that in AdS 3 pure gravity, semiclassical amplitudes for off-shell 𝑛-boundary torus wormholes with topology Σ 0,𝑛 × 𝑆 1 are given by the RMT 2 lift of JT gravity wormhole amplitudes. For the three-boundary case, we identify a gravity calculation which matches the RMT 2 result.

conformal field theory↗

Charting an Inflationary Landscape with Random Matrix Theory

We construct a class of random potentials for N >> 1 scalar fields using non-equilibrium random matrix theory, and then characterize multifield inflation in this setting. By stipulating that the Hessian matrices in adjacent coordinate patches are related by Dyson Brownian motion, we define the potential in the vicinity of a trajectory. This method remains computationally efficient at large N, permitting us to study much larger systems than has been possible with other constructions. We illustrate the utility of our approach with a numerical study of inflation in systems with up to 100 coupled scalar fields. A significant finding is that eigenvalue repulsion sharply reduces the duration of inflation near a critical point of the potential: even if the curvature of the potential is fine-tuned to be small at the critical point, small cross-couplings in the Hessian cause the curvature to grow in the neighborhood of the critical point.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Statistics of time delay and scattering correlation functions in chaotic systems. I. Random matrix theory

We consider the statistics of time delay in a chaotic cavity having M open channels, in the absence of time-reversal invariance. In the random matrix theory approach, we compute the average value of polynomial functions of the time delay matrix Q = − iħS{sup †}dS/dE, where S is the scattering matrix. Our results do not assume M to be large. In a companion paper, we develop a semiclassical approximation to S-matrix correlation functions, from which the statistics of Q can also be derived. Together, these papers contribute to establishing the conjectured equivalence between the random matrix and the semiclassical approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Random matrix theory of the isospectral twirling

We present a systematic construction of probes into the dynamics of isospectral ensembles of Hamiltonians by the notion of Isospectral twirling, expanding the scopes and methods of ref. [1]. The relevant ensembles of Hamiltonians are those defined by salient spectral probability distributions. The Gaussian Unitary Ensembles (GUE) describes a class of quantum chaotic Hamiltonians, while spectra corresponding to the Poisson and Gaussian Diagonal Ensemble (GDE) describe non chaotic, integrable dynamics. We compute the Isospectral twirling of several classes of important quantities in the analysis of quantum many-body systems: Frame potentials, Loschmidt Echos, OTOCs, Entanglement, Tripartite mutual information, coherence, distance to equilibrium states, work in quantum batteries and extension to CP-maps. Moreover, we perform averages in these ensembles by random matrix theory and show how these quantities clearly separate chaotic quantum dynamics from non chaotic ones.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Open quantum systems and random matrix theory

A simple model for open quantum systems is analyzed with RMT. The system is coupled to the continuum in a minimal way. In this paper we see the effect of opening the system on the level statistics, in particular the level spacing, width distribution and Δ{sub 3}(L) statistic are examined as a function of the strength of this coupling. The usual super-radiant state is observed, and it is seen that as it is formed, the level spacing and Δ{sub 3}(L) statistic exhibit the signatures of missed levels.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Combinatorial theory of the semiclassical evaluation of transport moments. I. Equivalence with the random matrix approach

To study electronic transport through chaotic quantum dots, there are two main theoretical approaches. One involves substituting the quantum system with a random scattering matrix and performing appropriate ensemble averaging. The other treats the transport in the semiclassical approximation and studies correlations among sets of classical trajectories. There are established evaluation procedures within the semiclassical evaluation that, for several linear and nonlinear transport moments to which they were applied, have always resulted in the agreement with random matrix predictions. We prove that this agreement is universal: any semiclassical evaluation within the accepted procedures is equivalent to the evaluation within random matrix theory. The equivalence is shown by developing a combinatorial interpretation of the trajectory sets as ribbon graphs (maps) with certain properties and exhibiting systematic cancellations among their contributions. Remaining trajectory sets can be identified with primitive (palindromic) factorisations whose number gives the coefficients in the corresponding expansion of the moments of random matrices. The equivalence is proved for systems with and without time reversal symmetry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Square Root Statistics of Density Matrices and Their Applications

To estimate the degree of quantum entanglement of random pure states, it is crucial to understand the statistical behavior of entanglement indicators such as the von Neumann entropy, quantum purity, and entanglement capacity. These entanglement metrics are functions of the spectrum of density matrices, and their statistical behavior over different generic state ensembles have been intensively studied in the literature. As an alternative metric, in this work, we study the sum of the square root spectrum of density matrices, which is relevant to negativity and fidelity in quantum information processing. In particular, we derive the finite-size mean and variance formulas of the sum of the square root spectrum over the Bures–Hall ensemble, extending known results obtained recently over the Hilbert–Schmidt ensemble.

97 MATHEMATICS AND COMPUTING↗

Efficient Unitary Designs from Random Sums and Permutations

A unitary k-design is an ensemble of unitaries that matches the first k moments of the Haar measure. In this work, we provide two efficient constructions of k-designs on n-qubits using new random matrix theory techniques. Our first construction is based on exponentiating sums of random i.i.d. Hermitian matrices and uses O(k2n2)-many gates. In the spirit of central limit theorems, we show that this random sum approximates the Gaussian Unitary Ensemble (GUE). We then show that the product of just two exponentiated GUE matrices is already approximately Haar random. Our second construction is based on products of exponentiated sums of random permutations and uses Õ(k poly (n)) many gates. The k dependence is optimal (up to polylogarithmic factors) and is inherited from the efficiency of existing k-wise independent permutations. Furthermore, replacing random permutations with quantum-secure pseudorandom permutations (PRPs), we also obtain a pseudorandom unitary (PRU) ensemble that is secure under nonadaptive queries. A central feature of both proofs is a new connection between the polynomial method in quantum query complexity and the large-dimension (N) expansion in random matrix theory. In particular, the first construction uses the polynomial method to control high moments of certain random matrix ensembles without requiring delicate Weingarten calculations. In doing so, we define and solve a moment problem on the unit circle, asking whether a finite number of equally weighted points can reproduce a given set of moments. In our second construction, the key step is to exhibit an orthonormal basis for irreducible representations of the partition algebra that has a low-degree large-N expansion. This allows us to show that the distinguishing probability is a low-degree rational polynomial of the dimension N.

algebra↗

Dynamics of disordered mechanical systems with large connectivity, free probability theory, and quasi-Hermitian random matrices

Disordered mechanical systems with high connectivity represent a limit opposite to the more familiar case of disordered crystals. Individual ions in a crystal are subjected essentially to nearest-neighbor interactions. In contrast, the systems studied in this paper have all their degrees of freedom coupled to each other. Thus, the problem of linearized small oscillations of such systems involves two full positive-definite and non-commuting matrices, as opposed to the sparse matrices associated with disordered crystals. Consequently, the familiar methods for determining the averaged vibrational spectra of disordered crystals, introduced many years ago by Dyson and Schmidt, are inapplicable for highly connected disordered systems. In this paper we apply random matrix theory (RMT) to calculate the averaged vibrational spectra of such systems, in the limit of infinitely large system size. At the heart of our analysis lies a calculation of the average spectrum of the product of two positive definite random matrices by means of free probability theory techniques. We also show that this problem is intimately related with quasi-hermitian random matrix theory (QHRMT), which means that the ‘hamiltonian’ matrix is hermitian with respect to a non-trivial metric. This extends ordinary hermitian matrices, for which the metric is simply the unit matrix. The analytical results we obtain for the spectrum agree well with our numerical results. The latter also exhibit oscillations at the high-frequency band edge, which fit well the Airy kernel pattern. We also compute inverse participation ratios of the corresponding amplitude eigenvectors and demonstrate that they are all extended, in contrast with conventional disordered crystals. Finally, we compute the thermodynamic properties of the system from its spectrum of vibrations. In addition to matrix model analysis, we also study the vibrational spectra of various multi-segmented disordered pendula, as concrete realizations of highly connected mechanical systems. A universal feature of the density of vibration modes, common to both pendula and the matrix model, is that it tends to a non-zero constant at vanishing frequency.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Chaos, complexity, and random matrices

Chaos and complexity entail an entropic and computational obstruction to describing a system, and thus are intrinsically difficult to characterize. In this paper, we consider time evolution by Gaussian Unitary Ensemble (GUE) Hamiltonians and analytically compute out-of-time-ordered correlation functions (OTOCs) and frame potentials to quantify scrambling, Haar-randomness, and circuit complexity. While our random matrix analysis gives a qualitatively correct prediction of the late-time behavior of chaotic systems, we find unphysical behavior at early times including an O(1) scrambling time and the apparent breakdown of spatial and temporal locality. The salient feature of GUE Hamiltonians which gives us computational traction is the Haar-invariance of the ensemble, meaning that the ensemble-averaged dynamics look the same in any basis. Motivated by this property of the GUE, we introduce k-invariance as a precise definition of what it means for the dynamics of a quantum system to be described by random matrix theory. Here,we envision that the dynamical onset of approximate k-invariance will be a useful tool for capturing the transition from early-time chaos, as seen by OTOCs, to late-time chaos, as seen by random matrix theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A tale of two tools: mcres.py, a stochastic resonance generator, and grokres.py, a resonance quality assurance tool

We detail two software tools, now integrated into the fudge code system. The first tool, mcres.py, can be used to generate stochastic ensembles of resonances which are both consistent with the expectations of the Gaussian Orthogonal Ensemble of Random Matrix Theory and with the level densities and widths encoded in ENDF formatted files. The second tool, grokres.py, can be used to assess global and local features of sequences of resonances found in ENDF files and make comparisons to known results from Random Matrix Theory. We apply these tools to 54 Fe and other nuclei.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Entanglement perspective on the quantum approximate optimization algorithm

Many quantum algorithms seek to output a specific bitstring solving the problem of interest—or a few if the solution is degenerate. It is the case for the quantum approximate optimization algorithm (QAOA) in the limit of large circuit depth, which aims to solve quadratic unconstrained binary optimization problems. Hence, the expected final state for these algorithms is either a product state or a low-entangled superposition involving a few bitstrings. What happens in between the initial N -qubit product state | 0 〉 ⊗ N and the final one regarding entanglement? Here, we consider the QAOA algorithm for solving the paradigmatic MaxCut problem on different types of graphs. We study the entanglement growth and spread resulting from randomized and optimized QAOA circuits and find that there is a volume-law entanglement barrier between the initial and final states. We also investigate the entanglement spectrum in connection with random matrix theory. In addition, we compare the entanglement production with a quantum annealing protocol aiming to solve the same MaxCut problems. Finally, we discuss the implications of our results for the simulation of QAOA circuits with tensor network-based methods relying on low-entanglement for efficiency, such as matrix product states.

Dupont, Maxime↗

A principle of maximum ignorance for semiclassical gravity

The principle of maximum ignorance posits that the coarse-grained description of a system is maximally agnostic about its underlying microscopic structure. We briefly review this principle for random matrix theory and for the eigenstate thermalization hypothesis. We then apply this principle in holography to construct ensembles of random mixed states. This leads to an ensemble of microstates which models our microscopic ignorance, and which on average reproduces the effective semiclassical physics of a given bulk state. We call this ensemble the state-averaging ansatz. The output of our model is a prediction for semiclassical contributions to variances and higher statistical moments over the ensemble of microstates. The statistical moments provide coarse-grained — yet gravitationally non-perturbative — information about the microstructure of the individual states of the ensemble. We show that these contributions exactly match the on-shell action of known wormhole configurations of the gravitational path integral. These results strengthen the view that wormholes simply parametrize the ignorance of the microstructure of a fundamental state, given a fixed semiclassical bulk description.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗