Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random systems”

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 55 records · Page 3

Spectral fluctuations in the Sachdev-Ye-Kitaev model

We present a detailed quantitative analysis of spectral correlations in the Sachdev-Ye-Kitaev (SYK) model. We find that the deviations from universal Random Matrix Theory (RMT) behavior are due to a small number of long-wavelength fluctuations (of the order of the number of Majorana fermions N ) from one realization of the ensemble to the next one. These modes can be parameterized effectively in terms of Q-Hermite orthogonal polynomials, the main contribution being due to scale fluctuations for which we give a simple analytical estimate. Our numerical results for N = 32 show that only the lowest eight polynomials are needed to eliminate the nonuniversal part of the spectral fluctuations. The covariance matrix of the coefficients of this expansion can be obtained analytically from low-order double-trace moments. We evaluate the covariance matrix of the first six moments and find that it agrees with the numerics. We also analyze the spectral correlations in terms of a nonlinear σ-model, which is derived through a Fierz transformation, and evaluate the one and two-point spectral correlation functions to two-loop order. The wide correlator is given by the sum of the universal RMT result and corrections whose lowest-order term corresponds to scale fluctuations. However, the loop expansion of the σ-model results in an ill-behaved expansion of the resolvent, and it gives universal RMT fluctuations not only for q= 4 or higher even q-body interactions, but also for the q= 2 SYK model albeit with a much smaller Thouless energy while the correct result in this case should have been Poisson statistics. In our numerical studies we analyze the number variance and spectral form factor for N = 32 and q = 4. We show that the quadratic deviation of the number variance for large energies appears as a peak for small times in the spectral form factor. After eliminating the long-wavelength fluctuations, we find quantitative agreement with RMT up to an exponentially large number of level spacings for the number variance or exponentially short times in the case of the spectral form factor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spectral form factor in sparse SYK models

We investigate the spectral form factor of the sparse Sachdev-Ye-Kitaev model. We use numerical methods to establish that at intermediate times the connected part of the spectral form factor is the dominant one. These connected contributions arise from fluctuations around the disconnected geometry, not from a new saddle point. A similar effect was previously conjectured in SYK but required a value of N out of reach of current numerical simulations.

2D Gravity↗

A supersymmetric SYK model with a curious low energy behavior

We consider N = 2,4 supersymmetric SYK models that have a peculiar low energy behavior, with the entropy going like S = S 0 + (constant)T a , where a ≠ 1. The large N equations for these models are a generalization of equations that have been previously studied as an unjustified truncation of the planar diagrams describing the BFSS matrix quantum mechanics or other related matrix models. Here we reanalyze these equations in order to better understand the low energy physics of these models. We find that the scalar fields develop large expectation values which explore the low energy valleys in the potential. The low energy physics is dominated by quadratic fluctuations around these values. These models were previously conjectured to have a spin glass phase. We did not find any evidence for this phase by using the usual diagnostics, such as searching for replica symmetry breaking solutions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Petz reconstruction in random tensor networks

We illustrate the ideas of bulk reconstruction in the context of random tensor network toy models of holography. Specifically, we demonstrate how the Petz reconstruction map works to obtain bulk operators from the boundary data by exploiting the replica trick. We also take the opportunity to comment on the differences between coarse-graining and random projections.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Chaos on the hypercube

We analyze the spectral properties of a d-dimensional HyperCubic (HC) lattice model originally introduced by Parisi. The U(1) gauge links of this model give rise to a magnetic flux of constant magnitude φ but random orientation through the faces of the hypercube. The HC model, which also can be written as a model of 2d interacting Majorana fermions, has a spectral flow that is reminiscent of Maldacena-Qi (MQ) model, and its spectrum at φ = 0, actually coincides with the coupling term of the MQ model. As was already shown by Parisi, at leading order in 1/d, the spectral density of this model is given by the density function of the Q-Hermite polynomials, which is also the spectral density of the double-scaled Sachdev-Ye-Kitaev model. Parisi demonstrated this by mapping the moments of the HC model to Q-weighted sums on chord diagrams. We point out that the subleading moments of the HC model can also be mapped to weighted sums on chord diagrams, in a manner that descends from the leading moments. The HC model has a magnetic inversion symmetry that depends on both the magnitude and the orientation of the magnetic flux through the faces of the hypercube. The spectrum for fixed quantum number of this symmetry exhibits a transition from regular spectra at φ = 0 to chaotic spectra with spectral statistics given by the Gaussian Unitary Ensembles (GUE) for larger values of φ. For small magnetic flux, the ground state is gapped and is close to a Thermofield Double (TFD) state.

1/N expansion↗

Out-of-time-order correlators and Lyapunov exponents in sparse SYK

We use a combination of analytical and numerical methods to study out-of-time order correlators (OTOCs) in the sparse Sachdev-Ye-Kitaev (SYK) model. We find that at a given order of N, the standard result for the q-local, all-to-all SYK, obtained through the sum over ladder diagrams, is corrected by a series in the sparsity parameter, k. We present an algorithm to sum the diagrams at any given order of 1/(kq) n . We also study OTOCs numerically as a function of the sparsity parameter and determine the Lyapunov exponent. We find that numerical stability when extracting the Lyapunov exponent requires averaging over a massive number of realizations. This trade-off between the efficiency of the sparse model and consistent behavior at finite N becomes more significant for larger values of N.

2D gravity↗

Machine learning the dynamics of quantum kicked rotor

Highlights: • Quantum kicked rotor. • Quantum phase transition. • Machine learning. • LSTM network. • Convolutional neural network. Using the multilayer convolutional neural network (CNN), we can detect the quantum phases in random electron systems, and phase diagrams of two and higher dimensional Anderson transitions and quantum percolations as well as disordered topological systems have been obtained. Here, instead of using CNN to analyze the wave functions, we analyze the dynamics of wave packets via long short-term memory network (LSTM). We adopt the quasi-periodic quantum kicked rotors, which simulate the three and four dimensional Anderson transitions. By supervised training, we let LSTM extract the features of the time series of wave packet displacements in localized and delocalized phases. We then simulate the wave packets in unknown phases and let LSTM classify the time series to localized and delocalized phases. We compare the phase diagrams obtained by LSTM and those obtained by CNN.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

How well do one-electron self-interaction-correction methods perform for systems with fractional electrons?

Recently developed locally scaled self-interaction correction (LSIC) is a one-electron SIC method that, when used with a ratio of kinetic energy densities (z σ ) as iso-orbital indicator, performs remarkably well for both thermochemical properties as well as for barrier heights overcoming the paradoxical behavior of the well-known Perdew–Zunger self-interaction correction (PZSIC) method. In this work, we examine how well the LSIC method performs for the delocalization error. Our results show that both LSIC and PZSIC methods correctly describe the dissociation of $H$$^{+}_{2}$ and $H$$^{+}_{2}$ but LSIC is overall more accurate than the PZSIC method. Likewise, in the case of the vertical ionization energy of an ensemble of isolated He atoms, the LSIC and PZSIC methods do not exhibit delocalization errors. For the fractional charges, both LSIC and PZSIC significantly reduce the deviation from linearity in the energy vs number of electrons curve, with PZSIC performing superior for C, Ne, and Ar atoms while for Kr they perform similarly. The LSIC performs well at the endpoints (integer occupations) while substantially reducing the deviation. The dissociation of LiF shows both LSIC and PZSIC dissociate into neutral Li and F but only LSIC exhibits charge transfer from Li + to F – at the expected distance from the experimental data and accurate ab initio data. Overall, both the PZSIC and LSIC methods reduce the delocalization errors substantially.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Time-dependent relaxation of observables in complex quantum systems

Abstract We consider time-dependent relaxation of observables in quantum systems of chaotic and regular type. Using statistical arguments and exact numerical solutions we show that the spread of the initial wave function in the Hilbert space and the main characteristics of evolution of observables have certain generic features. The study compares examples of regular dynamics, a completely chaotic case of the Gaussian orthogonal ensemble, a bosonic system with random interactions, and a fully realistic case of the time evolution of various initial non-stationary states in the nuclear shell model. In the case of the Gaussian orthogonal ensemble we show that the survival probability obtained analytically also fully defines the relaxation timescale of observables. This is not the case in general. Using the realistic nuclear shell model and the quadrupole moment as an observable we demonstrate that the relaxation time is significantly longer than defined by the survival probability of the initial state. The full analysis does not show the presence of an analog of the Lyapunov exponent characteristic for examples of classical chaos.

Volya, Alexander (ORCID:0000000217656466)↗

Commensuration effects on skyrmion Hall angle and drag for manipulation of skyrmions on two-dimensional periodic substrates

Here, we examine the dynamics of an individually driven skyrmion moving through a background lattice of skyrmions coupled to a 2D periodic substrate as we vary the ratio of the number of skyrmions to the number of pinning sites across commensurate and incommensurate conditions. As the skyrmion density increases, the skyrmion Hall angle is nonmonotonic, dropping to low or zero values in commensurate states and rising to an enhanced value in incommensurate states. Under commensuration, the driven skyrmion is channeled by a symmetry direction of the pinning array and exhibits an increased velocity. At fillings for which the skyrmion Hall angle is zero, the velocity has a narrow band noise signature, while for incommensurate fillings, the skyrmion motion is disordered and the velocity noise is broad band. Under commensurate conditions, multi-step depinning transitions appear and the skyrmion Hall angle is zero at low drives but becomes finite at higher drives, while at incommensurate fillings there is only a single depinning transition. As the gyrotropic component of the skyrmion dynamics, called the Magnus force, increases, peaks in the velocity that appear in commensurate regimes cross over to dips, and new types of directional locking effects can arise in which the skyrmion travels along other symmetry directions of the background lattice. At large Magnus forces, and particularly at commensurate fillings, the driven skyrmion can experience a velocity boost in which the skyrmion moves faster than the applied drive due to the alignment of the Magnus-induced velocity with the driving direction. In some cases, an increase of the Magnus force can produce regimes of enhanced pinning when the skyrmion is forced to move along a nonsymmetry direction of the periodic pinning array. This is in contrast to systems with random pinning, where increasing the Magnus force generally reduces the pinning effect. We demonstrate these dynamics for both square and triangular substrates and map out the different regimes as a function of filling fraction, pinning force, and the strength of the Magnus force in a series of dynamic phase diagrams.

36 MATERIALS SCIENCE↗

Nonlinear dynamics and quantum chaos of a family of kicked p -spin models

Herein we introduce kicked p-spin models describing a family of transverse Ising-like models for an ensemble of spin-1/2 particles with all-to-all p-body interaction terms occurring periodically in time as delta-kicks. This is the natural generalization of the well-studied quantum kicked top (p = 2) [Haake, Kus', and Scharf, Z. Phys. B 65, 381 (1987)]. We fully characterize the classical nonlinear dynamics of these models, including the transition to global Hamiltonian chaos. The classical analysis allows us to build a classification for this family of models, distinguishing between p = 2 and p > 2, and between models with odd and even p's. Quantum chaos in these models is characterized in both kinematic and dynamic signatures. For the latter, we show numerically that the growth rate of the out-of-time-order correlator is dictated by the classical Lyapunov exponent. Finally, we argue that the classification of these models constructed in the classical system applies to the quantum system as well.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accelerating Neutrino Event Generation in MARLEY Using CUDA-Based RNG and GPU Parallelization

MARLEY is a simulation tool that helps scientists study how low-energy neutrinos interact with matter. To work properly, MARLEY uses random numbers thousands of times in each simulation. These random numbers are important for modeling things like how neutrinos collide with atoms and what particles they produce. Right now, MARLEY runs on a regular computer processor (CPU) and uses a built-in random number generator called the Mersenne Twister. This setup works, but it can be slow, especially when trying to simulate many events. This research focuses on making MARLEY run faster by moving the random number generation and some of the repetitive calculations from the CPU to a graphics processing unit (GPU), which can handle many tasks at the same time. We use CUDA (a tool for programming NVIDIA GPUs) and cuRAND (a GPU-based random number library) to test faster alternatives to the current random number system. We compare different GPU-based generators, like curand_mtgp32, xorwow, and philox, to see which ones are the quickest and still give reliable results. Early tests show that using the GPU can make MARLEY simulations much faster. This project not only helps improve current simulation performance but also moves closer to a full simulation chain where all stages can run on modern GPU hardware.

Dunkley, Kimieka [Florida A-M]↗

Effective Field Theory of Random Quantum Circuits

Quantum circuits have been widely used as a platform to simulate generic quantum many-body systems. In particular, random quantum circuits provide a means to probe universal features of many-body quantum chaos and ergodicity. Some such features have already been experimentally demonstrated in noisy intermediate-scale quantum (NISQ) devices. On the theory side, properties of random quantum circuits have been studied on a case-by-case basis and for certain specific systems, and a hallmark of quantum chaos—universal Wigner–Dyson level statistics—has been derived. This work develops an effective field theory for a large class of random quantum circuits. The theory has the form of a replica sigma model and is similar to the low-energy approach to diffusion in disordered systems. The method is used to explicitly derive the universal random matrix behavior of a large family of random circuits. In particular, we rederive the Wigner–Dyson spectral statistics of the brickwork circuit model by Chan, De Luca, and Chalker [Phys. Rev. X 8, 041019 (2018)] and show within the same calculation that its various permutations and higher-dimensional generalizations preserve the universal level statistics. Finally, we use the replica sigma model framework to rederive the Weingarten calculus, which is a method of evaluating integrals of polynomials of matrix elements with respect to the Haar measure over compact groups and has many applications in the study of quantum circuits. The effective field theory derived here provides both a method to quantitatively characterize the quantum dynamics of random Floquet systems (e.g., calculating operator and entanglement spreading) and a path to understanding the general fundamental mechanism behind quantum chaos and thermalization in these systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum random number generator

A system and method according to one embodiment are provided for random number generation based on measuring quadrature fluctuations of a single mode thermal state using an optical homodyne detector.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Speedup of UEDGE Parameter Scans Using Machine-Learning Optimized OpenMP Parallelization and a Continuation Solver

This article presents the OpenMP parallelization of the preconditioning Jacobian assembly and right‐hand side residual evaluation in UEDGE. A continuation algorithm, utilizing the internal NKSOL implicit Jacobian‐Free Newton‐Krylov solver to efficiently scan physical parameters, is also presented. The implemented parallelization reduces the computational time for a benchmark scan run on 32 threads by compared to the serial version when using trained random forest regression models to identify the optimal decomposition of the system of equations. Random forest regression models applied to the UEDGE time‐dependent and continuation solver algorithms did not yield meaningful improvement in computational performance. A benchmark DIII‐D gas injection rate scan in the 0.35–0.75 kA interval, performed on a test cluster using the parallelized code and continuation solver, produced 1066 steady‐state solutions with a 22 s average wall‐clock computational time per steady‐state solution.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Structured ground states of randomly interacting bosons

Bosonic degrees of freedom and their emergence as part of complex quantum many-body dynamics, symmetries, collective behavior, clustering, and phase transitions play an important role in modern studies of quantum systems. In this paper, we present a systematic study of many-boson systems governed by random interactions. Our findings show that ground states of randomly interacting bosons are not random, being dominated by a few collective configurations containing condensates of clusters.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Optical authentication of images

Systems and methods performed for generating authentication information for an image using optical computing are provided. When a user takes a photo of an object, an optical authentication system receives light reflected and/or emitted from the object. The system also receives a random key from an authentication server. The system converts the received light to plenoptic data and uploads it to the authentication server. In addition, the system generates an optical hash of the received light using the random key, converts the generated optical hash to a digital optical hash, and uploads the digital optical hash to the authentication server. When the authentication server receives the upload, it verifies whether the time of the upload is within a certain threshold time from the sending of the random key and whether the digital optical hash was generated from the same light as the plenoptic data.

97 MATHEMATICS AND COMPUTING↗

Optical authentication of images

Systems and methods performed for generating authentication information for an image using optical computing are provided. When a user takes a photo of an object, an optical authentication system receives light reflected and/or emitted from the object. The system also receives a random key from an authentication server. The system converts the received light to plenoptic data and uploads it to the authentication server. In addition, the system generates an optical hash of the received light using the random key, converts the generated optical hash to a digital optical hash, and uploads the digital optical hash to the authentication server. When the authentication server receives the upload, it verifies whether the time of the upload is within a certain threshold time from the sending of the random key and whether the digital optical hash was generated from the same light as the plenoptic data.

Murialdo, Maxwell R.↗