Search NASA⌕ Search

SEARCH · Search NASA

Results for “Exponential Matrix”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Classical eikonal from Magnus expansion

In a classical scattering problem, the classical eikonal is defined as the generator of the canonical transformation that maps in-states to out-states. It can be regarded as the classical limit of the log of the quantum S-matrix. In a classical analog of the Born approximation in quantum mechanics, the classical eikonal admits an expansion in oriented tree graphs, where oriented edges denote retarded/advanced worldline propagators. The Magnus expansion, which takes the log of a time-ordered exponential integral, offers an efficient method to compute the coefficients of the tree graphs to all orders. We exploit a Hopf algebra structure behind the Magnus expansion to develop a fast algorithm which can compute the tree coefficients up to the 12th order (over half a million trees) in less than an hour. In a relativistic setting, our methods can be applied to the post-Minkowskian (PM) expansion for gravitational binaries in the worldline formalism. We demonstrate the methods by computing the 3PM eikonal and find agreement with previous results based on amplitude methods. Importantly, the Magnus expansion yields a finite eikonal, while the naïve eikonal based on the time-symmetric propagator is infrared-divergent from 3PM on.

Black Holes↗
DOE OSTI2026

Data-Driven Performance Optimization of Gamma Spectrometers With Many Channels

In gamma spectrometers with variable spectroscopic performance across many channels (e.g., many pixels or voxels), a tradeoff exists between including data from successively worse-performing readout channels and increasing efficiency. Brute-force calculation of the optimal set of included channels is exponentially infeasible as the number of channels grows, and approximate methods are required. In this work, we present a data-driven framework for attempting to find near-optimal sets of included detector channels. The framework leverages non-negative matrix factorization (NMF) to learn the behavior of gamma spectra across the detector and clusters similarly-performing detector channels together. Performance comparisons are then made between spectra with channel clusters removed, which is more feasible than brute force. The framework is general and can be applied to arbitrary, user-defined performance metrics depending on the application. We apply this framework to optimizing gamma spectra measured by H3D M400 CdZnTe (CZT) spectrometers, which exhibit variable performance across their crystal volumes. In particular, we show several examples optimizing various performance metrics for uranium and plutonium gamma spectra in non-destructive assay (NDA) for nuclear safeguards, and explore trends in performance versus parameters such as clustering algorithm type. We also compare the NMF + clustering pipeline to several non-machine-learning (ML) algorithms, including several greedy algorithms. Although, we find that the NMF + clustering pipeline tends to find the best-performing set of detector voxels, significantly improving over the unoptimized spectra, but that a greedy accumulation of spectra segmented by detector depth can, in some cases, give similar performance improvements in much less computation time.

Energy resolution↗
DOE OSTI2020

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↗
DOE OSTI2019

Random matrix approach to three-dimensional QCD with a Chern-Simons term

We propose a random matrix theory for QCD in three dimensions with a Chern-Simons term at level k which spontaneously breaks the flavor symmetry according to U(2Nf) → U(Nf+k)×U(Nf-k). This random matrix model is obtained by adding a complex part to the action for the k = 0 random matrix model. We derive the pattern of spontaneous symmetry breaking from the analytical solution of the model. Additionally, we obtain explicit analytical results for the spectral density and the spectral correlation functions for the Dirac operator at finite matrix dimension, that become complex. In the microscopic domain where the matrix size tends to infinity, they are expected to be universal, and give an exact analytical prediction to the spectral properties of the Dirac operator in the presence of a Chern-Simons term. Here, we calculate the microscopic spectral density. It shows exponentially large (complex) oscillations which cancel the phase of the k = 0 theory.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2014

On the oscillator realization of conformal U(2, 2) quantum particles and their particle-hole coherent states

We revise the unireps. of U(2, 2) describing conformal particles with continuous mass spectrum from a many-body perspective, which shows massive conformal particles as compounds of two correlated massless particles. The statistics of the compound (boson/fermion) depends on the helicity h of the massless components (integer/half-integer). Coherent states (CS) of particle-hole pairs (“excitons”) are also explicitly constructed as the exponential action of exciton (non-canonical) creation operators on the ground state of unpaired particles. These CS are labeled by points Z (2×2 complex matrices) on the Cartan-Bergman domain D₄=U(2,2)/U(2)², and constitute a generalized (matrix) version of Perelomov U(1, 1) coherent states labeled by points z on the unit disk D₁=U(1,1)/U(1)². First, we follow a geometric approach to the construction of CS, orthonormal basis, U(2, 2) generators and their matrix elements and symbols in the reproducing kernel Hilbert space H{sub λ}(D₄) of analytic square-integrable holomorphic functions on D₄, which carries a unitary irreducible representation of U(2, 2) with index λϵN (the conformal or scale dimension). Then we introduce a many-body representation of the previous construction through an oscillator realization of the U(2, 2) Lie algebra generators in terms of eight boson operators with constraints. This particle picture allows us for a physical interpretation of our abstract mathematical construction in the many-body jargon. In particular, the index λ is related to the number 2(λ – 2) of unpaired quanta and to the helicity h = (λ – 2)/2 of each massless particle forming the massive compound.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2011

Entanglement transitions in random definite particle states

Entanglements within qubits are studied for the subspace of definite particle states or definite number of up spins. A transition from an algebraic decay of entanglement within two qubits with the total number N of qubits to an exponential one when the number of particles is increased from two to three is studied in detail. In particular the probability that the concurrence is nonzero is calculated using statistical methods and is shown to agree with numerical simulations. Further entanglement within a block of m qubits is studied using the log-negativity measure, which indicates that a transition from algebraic to exponential decay occurs when the number of particles exceeds m. Several algebraic exponents for the decay of the log negativity are analytically calculated. The transition is shown to be possibly connected to the changes in the density of states of the reduced density matrix, which has a divergence at the zero eigenvalue when the entanglement decays algebraically.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Superconductivity in the lightly doped Hubbard model on the cylindrical honeycomb lattice

Here, we have performed large-scale density-matrix renormalization group studies of the lightly doped Hubbard model on the honeycomb lattice on long three- and four-leg cylinders. We find that the ground state of the system upon lightly doping is consistent with that of a superconducting state with coexisting quasi-long-range superconducting and charge density wave orders. Both the superconducting and charge density wave correlations decay as a power law at long distances with corresponding exponents 𝐾 𝑠⁢𝑐 < 2 and 𝐾 𝑐 < 2. On the contrary, the spin-spin and single-particle correlations decay exponentially, although with relatively long correlation lengths.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2017

astroABC : An Approximate Bayesian Computation Sequential Monte Carlo sampler for cosmological parameter estimation

Given the complexity of modern cosmological parameter inference where we arefaced with non-Gaussian data and noise, correlated systematics and multi-probecorrelated data sets, the Approximate Bayesian Computation (ABC) method is apromising alternative to traditional Markov Chain Monte Carlo approaches in thecase where the Likelihood is intractable or unknown. The ABC method is called"Likelihood free" as it avoids explicit evaluation of the Likelihood by using aforward model simulation of the data which can include systematics. Weintroduce astroABC, an open source ABC Sequential Monte Carlo (SMC) sampler forparameter estimation. A key challenge in astrophysics is the efficient use oflarge multi-probe datasets to constrain high dimensional, possibly correlatedparameter spaces. With this in mind astroABC allows for massive parallelizationusing MPI, a framework that handles spawning of jobs across multiple nodes. Akey new feature of astroABC is the ability to create MPI groups with differentcommunicators, one for the sampler and several others for the forward modelsimulation, which speeds up sampling time considerably. For smaller jobs thePython multiprocessing option is also available. Other key features include: aSequential Monte Carlo sampler, a method for iteratively adapting tolerancelevels, local covariance estimate using scikit-learn's KDTree, modules forspecifying optimal covariance matrix for a component-wise or multivariatenormal perturbation kernel, output and restart files are backed up everyiteration, user defined metric and simulation methods, a module for specifyingheterogeneous parameter priors including non-standard prior PDFs, a module forspecifying a constant, linear, log or exponential tolerance level,well-documented examples and sample scripts. This code is hosted online athttps://github.com/EliseJ/astroABC

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

Operator Relaxation and the Optimal Depth of Classical Shadows

Classical shadows are a powerful method for learning many properties of quantum states in a sample-efficient manner, by making use of randomized measurements. Here we study the sample complexity of learning the expectation value of Pauli operators via “shallow shadows,” a recently proposed version of classical shadows in which the randomization step is effected by a local unitary circuit of variable depth t. Here we show that the shadow norm (the quantity controlling the sample complexity) is expressed in terms of properties of the Heisenberg time evolution of operators under the randomizing (“twirling”) circuit—namely the evolution of the weight distribution characterizing the number of sites on which an operator acts nontrivially. For spatially contiguous Pauli operators of weight k, this entails a competition between two processes: operator spreading (whereby the support of an operator grows over time, increasing its weight) and operator relaxation (whereby the bulk of the operator develops an equilibrium density of identity operators, decreasing its weight). From this simple picture we derive (i) an upper bound on the shadow norm which, for depth t~log⁡(k), guarantees an exponential gain in sample complexity over the t=0 protocol in any spatial dimension, and (ii) quantitative results in one dimension within a mean-field approximation, including a universal subleading correction to the optimal depth, found to be in excellent agreement with infinite matrix product state numerical simulations. Our Letter connects fundamental ideas in quantum many-body dynamics to applications in quantum information science, and paves the way to highly optimized protocols for learning different properties of quantum states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Analysis of isothermal and cooling-rate-dependent immersion freezing by a unifying stochastic ice nucleation model

Immersion freezing is an important ice nucleation pathway involved in the formation of cirrus and mixed-phase clouds. Laboratory immersion freezing experiments are necessary to determine the range in temperature, T , and relative humidity, RH, at which ice nucleation occurs and to quantify the associated nucleation kinetics. Typically, isothermal (applying a constant temperature) and cooling-rate-dependent immersion freezing experiments are conducted. In these experiments it is usually assumed that the droplets containing ice nucleating particles (INPs) all have the same INP surface area (ISA); however, the validity of this assumption or the impact it may have on analysis and interpretation of the experimental data is rarely questioned. Descriptions of ice active sites and variability of contact angles have been successfully formulated to describe ice nucleation experimental data in previous research; however, we consider the ability of a stochastic freezing model founded on classical nucleation theory to reproduce previous results and to explain experimental uncertainties and data scatter. A stochastic immersion freezing model based on first principles of statistics is presented, which accounts for variable ISA per droplet and uses parameters including the total number of droplets, N tot , and the heterogeneous ice nucleation rate coefficient, J het ( T ). This model is applied to address if (i) a time and ISA-dependent stochastic immersion freezing process can explain laboratory immersion freezing data for different experimental methods and (ii) the assumption that all droplets contain identical ISA is a valid conjecture with subsequent consequences for analysis and interpretation of immersion freezing. The simple stochastic model can reproduce the observed time and surface area dependence in immersion freezing experiments for a variety of methods such as: droplets on a cold-stage exposed to air or surrounded by an oil matrix, wind and acoustically levitated droplets, droplets in a continuous-flow diffusion chamber (CFDC), the Leipzig aerosol cloud interaction simulator (LACIS), and the aerosol interaction and dynamics in the atmosphere (AIDA) cloud chamber. Observed time-dependent isothermal frozen fractions exhibiting non-exponential behavior can be readily explained by this model considering varying ISA. An apparent cooling-rate dependence of J het is explained by assuming identical ISA in each droplet. When accounting for ISA variability, the cooling-rate dependence of ice nucleation kinetics vanishes as expected from classical nucleation theory. Finally, the model simulations allow for a quantitative experimental uncertainty analysis for parameters N tot , T , RH, and the ISA variability. We discuss the implications of our results for experimental analysis and interpretation of the immersion freezing process.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Observable measurement-induced transitions

One of the main postulates of quantum mechanics is that measurements destroy quantum coherence (wave function collapse). Recently it was discovered that in a many-body system dilute local measurements still preserve some coherence across the entire system. As the measurement density is increased, a phase transition occurs that is characterized by the disentanglement of different parts of the system. Unfortunately, this transition is impossible to observe experimentally for macroscopic systems because it requires an exponentially costly full tomography of the many-body wave function or a comparison with the simulation on an oracle classical computer. In this work we report the discovery of another measurement-induced phase transition that can be observed experimentally if quantum dynamics can be reversed. On one side of this phase transition the quantum information encoded in some part of the Hilbert space is fully recovered after the time inversion. On the other side, all quantum information is corrupted. This transition also manifests itself as the change in the behavior of the probability to observe the same measurement outcome in the process that consists of identical blocks repeated many times. In each block the unitary evolution is followed by the measurement. On one side of the transition the probability decreases exponentially with the number of repetitions, on the other it tends to a constant as the number of repetitions is increased. We confirm the existence of the proposed phase transition through numerical simulations of realistic quantum circuits and analytical calculations using an effective random-matrix theory model.

Measurement-induced phase transitions↗
DOE OSTI2022

Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang’s breakthrough quantum-inspired algorithm for recommendation systems [STOC’19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC’19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all prior results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ 2 -norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.

Computer Science↗
DOE OSTI2016

Many Body Methods from Chemistry to Physics: Novel Computational Techniques for Materials-Specific Modelling: A Computational Materials Science and Chemistry Network

Understanding the behavior of interacting electrons in molecules and solids so that one can predict new superconductors, catalysts, light harvesters, energy and battery materials and optimize existing ones is the ``quantum many-body problem’’. This is one of the scientific grand challenges of the 21 st century. A complete solution to the problem has been proven to be exponentially hard, meaning that straightforward numerical approaches fail. New insights and new methods are needed to provide accurate yet feasible approximate solutions. This CMSCN project brought together chemists and physicists to combine insights from the two disciplines to develop innovative new approaches. Outcomes included the Density Matrix Embedding method, a new, computationally inexpensive and extremely accurate approach that may enable first principles treatment of superconducting and magnetic properties of strongly correlated materials, new techniques for existing methods including an Adaptively Truncated Hilbert Space approach that will vastly expand the capabilities of the dynamical mean field method, a self-energy embedding theory and a new memory-function based approach to the calculations of the behavior of driven systems. The methods developed under this project are now being applied to improve our understanding of superconductivity, to calculate novel topological properties of materials and to characterize and improve the properties of nanoscale devices.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Thermal tensor renormalization group simulations of square-lattice quantum spin models

In this work, we benchmark the well-controlled and numerically accurate exponential thermal tensor renormalization group (XTRG) in the simulation of interacting spin models in two dimensions. Finite temperature introduces a finite thermal correlation length ξ, such that for system sizes L >> ξ finite-size calculations actually simulate the thermodynamic limit. Here in this paper, we focus on the square lattice Heisenberg antiferromagnet (SLH) and quantum Ising models (QIM) on open and cylindrical geometries up to width W = 10 . We explore various one-dimensional mapping paths in the matrix product operator (MPO) representation, whose performance is clearly shown to be geometry dependent. We benchmark against quantum Monte Carlo (QMC) data, yet also the series-expansion thermal tensor network results. Thermal properties including the internal energy, specific heat, and spin structure factors, etc. are computed with high precision, obtaining excellent agreement with QMC results. XTRG also allows us to reach remarkably low temperatures. For SLH, we obtain an energy per site u$^*_g$ ≃ -0.6694 (4) and a spontaneous magnetization m$^*_S$ ≃ 0.30 ( 1 ) already consistent with the ground-state properties, which is obtained from extrapolated low-T thermal data on W ≤ 8 cylinders and W ≤ 10 open strips, respectively. We extract an exponential divergence versus T of the structure factor S (M), as well as the correlation length ξ, at the ordering wave vector M = ($π,π$) , which represents the renormalized classical behavior and can be observed over a narrow but appreciable temperature window, by analyzing the finite-size data by XTRG simulations. For the QIM with a finite-temperature phase transition, we employ several thermal quantities, including the specific heat, Binder ratio, as well as the MPO entanglement to determine the critical temperature $T_c$.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2017

Tree tensor network approach to simulating Shor's algorithm

Constructively simulating quantum systems furthers our understanding of qualitative and quantitative features which may be analytically intractable. In this paper, we directly simulate and explore the entanglement structure present in the paradigmatic example for exponential quantum speedups: Shor's algorithm. To perform our simulation, we construct a dynamic tree tensor network which manifestly captures two salient circuit features for modular exponentiation. These are the natural two-register bipartition and the invariance of entanglement with respect to permutations of the top-register qubits. Our construction help identify the entanglement entropy properties, which we summarize by a scaling relation. Further, the tree network is efficiently projected onto a matrix product state from which we efficiently execute the quantum Fourier transform. In conclusion, future simulation of quantum information states with tensor networks exploiting circuit symmetries is discussed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Kosterlitz-Thouless scaling at many-body localization phase transitions

We propose a scaling theory for the many-body localization (MBL) phase transition in one dimension, building on the idea that it proceeds via a ‘quantum avalanche’. We argue that the critical properties can be captured at a coarse-grained level by a Kosterlitz-Thouless (KT) renormalization group (RG) flow. On phenomenological grounds, we identify the scaling variables as the density of thermal regions and the lengthscale that controls the decay of typical matrix elements. Within this KT picture, the MBL phase is a line of fixed points that terminates at the delocalization transition. We discuss two possible scenarios distinguished by the distribution of rare, fractal thermal inclusions within the MBL phase. In the first scenario, these regions have a stretched exponential distribution in the MBL phase. In the second scenario, the near-critical MBL phase hosts rare thermal regions that are power-law distributed in size. This points to the existence of a second transition within the MBL phase, at which these power-laws change to the stretched exponential form expected at strong disorder. In conclusion, we numerically simulate two different phenomenological RGs previously proposed to describe the MBL transition. Both RGs display a universal power-law length distribution of thermal regions at the transition with a critical exponent α c = 2, and continuously varying exponents in the MBL phase consistent with the KT picture.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

A Clustering-based biased Monte Carlo Approach to Protein Titration Curve Prediction

We develop and implement a novel approach to computing the ensemble averages in systems characterized by pair-wise interactions between the entities. Methods involving full enumeration of the configuration space result in exponential complexity. Sampling methods such as Markov Chain Monte Carlo (MCMC) algorithms have been proposed to tackle the exponential complexity of these problems. In certain scenarios where significant energetic coupling exists between the entities, the accuracy of the such algorithms can be diminished. We propose a strategy to improve the accuracy of the MCMC runs by taking advantage of the cluster structure in the interaction energy matrix. We propose two different schemes for performing the biased MCMC runs on the partitioned systems and show that they are valid MCMC schemes. We then apply these algorithms to the problem of computing the protonation fractions and hence the titration curves of titratable protein residues that constitute a given protein. We leverage both synthesized and real-world systems and show the improved performance of our biased MCMC methods when compared to the regular MCMC method.

Visweswara Sathanur, Arun↗