Search NASASearch

SEARCH · Search NASA

Results for “classical simulation”

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

Classical and quantum simulations of 1+1-dimensional ${\mathbb{Z}}_{2}$ gauge theory at finite temperature and density

Simulating strongly coupled gauge theories at finite temperature and density is a longstanding challenge in nuclear and high-energy physics with fundamental implications for condensed matter physics. Here, we simulate such systems using minimally entangled typical thermal state (METTS) approaches, which combine classical random sampling with imaginary-time evolution, implementable on either classical or quantum computers, to estimate thermal averages of observables. We study 1+1-dimensional ${\mathbb{Z}}_{2}$ gauge theory coupled to spinless fermionic matter, which maps onto a local quantum spin chain. We benchmark both a classical matrix-product-state implementation of METTS and a recently proposed adaptive variational approach for near-term quantum devices, focusing on the equation of state and measures of fermion confinement. Of particular importance is the choice of basis for METTS sampling, which impacts both the sampling overhead and quantum circuit complexity. Our work sets the stage for future studies of strongly coupled gauge theories using classical and quantum hardware.

Chen, I-Chi [Iowa State Univ., Ames, IA (United St

Langevin Dynamics modeling of gas-phase ion-ion recombination (Final Technical Report)

A self-consistent trajectory simulation approach to model MN reactions (Fig. 1) which incorporates the probability of electron transfer as a Monte Carlo operator (Fig. 2) was developed and published as Liu et al. J. Chem. Phys. 159, 114111 (2023). The electron transfer probability p ET estimated using the two-state Landau-Zener (LZ) theory was incorporated into classical trajectory simulations to elicit predictions of MN reaction cross-section σ (vacuum) or rate constant β (finite pressure). Electronic structure calculations with multireference configuration interaction (MRCI) and large correlation consistent basis sets were used to derive inputs to the LZ theory. The key advance of our trajectory simulation approach is the incorporation of electron transfer probability and the inclusion of the effect of ion-neutral interactions on MN using a Langevin representation of the effect of neutral gas on ions. For H + – H - and Li + – H(D) - pairs, our approach quantitatively agrees with measured speed-dependent cross-sections for up to ~10 5 m/s. For the ion pair Ne + – Cl - , our predictions of the MN rate constant at ~1 torr are a factor of ~2 – 3 higher than the experimentally measured value. Similarly, for Xe + – F - in the pressure range of ~20000 – 80000 Pa, our predictions of the MN rate constant are ~20% lower but are in excellent qualitative agreement with experimental data. The paradigm of using trajectory simulations to self-consistently model MN reactions is the basis for inclusion of additional non-classical, and static magnetic and electric field effects. Subsequent work, published as Roy et al. focused on modeling recombination rate constant for three ion pairs (rare gas Ar + cation and halide anions): Ar + – Cl - , Ar + – Br - , Ar + – I - , 2) considering spin-orbit couplings in the electronic structure calculations to obtain high-fidelity estimates of the electron transfer probability and incorporated within the classical trajectory simulations to elicit predictions. In addition to calculations of ion-ion recombination rate constants, a classical trajectory simulation technique (published as Roy et al. J. Chem. Phys. 162(9), 094104 (2023)) that uses quaternions to represent orientation of non-spherical particles (ions or aerosol particles) was developed to simulate the recombination of diatomic or more generally, polyatomic molecules. Finally, several other ion pairs such as Ne + – Cl - , Kr + – Cl - , were explored using the developed semi-classical trajectory simulations to understand various challenges in tackling electronic structure calculations. Using empirical approaches to parameterize the electron transfer radius, trajectory simulations were also used to probe the effect of ion number density on MN rate constant.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

A Deep State Space Model for Rainfall‐Runoff Simulations

The classical way of studying the rainfall‐runoff processes in the water cycle relies on conceptual or physically‐based hydrologic models. Deep learning (DL) has recently emerged as an alternative and blossomed in the hydrology community for rainfall‐runoff simulations. However, the decades‐old Long Short‐Term Memory (LSTM) network remains the benchmark for this task, outperforming newer architectures like Transformers. In this work, we propose a State Space Model (SSM), specifically the Frequency Tuned Diagonal State Space Sequence (S4D‐FT) model, for rainfall‐runoff simulations. The proposed S4D‐FT is benchmarked against the established LSTM and a physically‐based Sacramento Soil Moisture Accounting model under in‐sample and out‐of‐sample simulation setups across 531 watersheds in the contiguous United States (CONUS). Results show that S4D‐FT is able to outperform the LSTM model across diverse regions under both simulation setups, especially for regions that feature snowmelt‐driven or intermittent flow regimes. In contrast, S4D‐FT tends to underperform in flashier, high‐magnitude flow regimes, likely due to its global state‐space convolution computation that emphasizes slow, storage‐driven dynamics, which makes it less effective at picking up short bursts and noisy spikes in the data. In summary, our pioneering introduction of the S4D‐FT for rainfall‐runoff simulations challenges the dominance of LSTM in the hydrology community and expands the arsenal of DL tools available for hydrological modeling.

Wang, Yihan [Univ. of Oklahoma, Norman, OK (United

Machine Learning Interatomic Potentials for Modeling Framework Flexibility and Water Uptake in NbOFFIVE-1-Ni Metal–Organic Framework

Metal–organic frameworks (MOFs), with their distinctive porous structures and tunable chemical properties, have shown immense promise in the separation and storage of gases. Currently, the accurate simulation of their adsorptive properties remains challenging, especially for systems where the molecules fit very tightly into the pores. Traditional simulation methods often approximate the frameworks as rigid and do not account for the framework flexibility seen in materials such as NbOFFIVE-1-Ni. First-principles molecular dynamics (FPMD) simulations offer the desired accuracy in modeling this flexibility but are limited by their extensive computational demands, rendering them impractical for long simulations. Conversely, classical force field-based simulations offer computational efficiency but lack the necessary accuracy. Here, to break this accuracy-efficiency trade-off, we have developed machine learning interatomic potentials trained on energies and forces from FPMD to model the framework flexibility of NbOFFIVE-1-Ni in the presence of water over nanosecond time scales. Furthermore, by integrating MLIP-driven molecular dynamics (MLIP-MD) with grand canonical Monte Carlo (GCMC) simulations, we further incorporated framework flexibility into adsorption predictions, yielding water adsorption isotherms that better align with experimental data compared to those of conventional GCMC simulations. These advances offer new opportunities for the design and optimization of MOFs in gas storage and separation applications.

adsorption

Unraveling the Heterogeneous but Ordered Microstructure of the Nonionic Deep Eutectic Solvent Formed by Lauric Acid and N -Methylacetamide

The nonionic deep eutectic solvent, formed by lauric acid (LA) and N-methylacetamide (NMA), has been shown to have a heterogeneous molecular structure in which the LA and NMA form nonpolar and polar domains, respectively. Previous vibrational spectroscopy experiments demonstrated that the ability of the LA domains to solvate compounds was limited to long carbon chains, whereas other nonpolar molecules, such as W(CO) 6 , were found to be solvated by both LA and NMA. These experiments were not fully compatible with the previously proposed micelle-like structure of the nonpolar domains of the LA-NMA DES. In this work, the modeling of the DES molecular structure is pursued using classical molecular dynamics simulations. The new classical model reproduces both the SAXS structural factors and the previously experimentally derived interaction map for these LA-NMA DESs. In addition, the simulation also shows that LA-NMA DESs form highly organized LA aggregates that are difficult to disorganize. Further evidence of the correct description provided by the newly derived model is obtained using a moderately polar probe: chloroform-d. Computations using the classical model have a good agreement with the solvation behavior of the probe derived from experiments, in which the location of the probe is found to be mostly within the polar domain of the DES. The computational model also demonstrates that the probe solvation is a consequence of the tightly packed LA structure, which causes nonpolar molecules to be located at the interphase of the DES nonpolar domains.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

Impact of Thermonuclear Reaction Rate Uncertainties on the Identification of Presolar Grains from Classical Novae

Approximately 30%–40% of classical novae generate dust between 20 and 100 days following the eruption. However, there has yet to be a definitive identification of presolar stardust grains originating from classical novae. While multiple studies have suggested a nova origin for specific grains, aligning simultaneously all measured isotopic ratios of a specific grain with those predicted from simulations remains challenging. Using Monte Carlo simulations, this work investigates how uncertainties in thermonuclear reaction rates influence the isotopic ratios predicted in simulations of classical novae, specifically impacting the identification of presolar grains. In particular, we address two questions: (i) What is the impact of uncertainties in reaction rates on the range of isotopic ratios predicted by classical nova simulations? (ii) Which reaction rate uncertainties most significantly influence the predicted abundance ratios in presolar grains? Our results show that current reaction rate uncertainties affect the isotopic ratios of 12 C/ 13 C, 14 N/ 15 N, 16 O/ 17 O, 16 O/ 18 O, 24 Mg/ 25 Mg, 24 Mg/ 26 Mg, 26 Al/ 27 Al, and 28 Si/ 29 Si by less than 20% in either carbon–oxygen or oxygen–neon (ONe) novae, especially when considering the mixing of matter throughout the entire envelope. However, the isotopic ratios of 28 Si/ 30 Si, 32 S/ 33 S, and 32 S/ 34 S in ONe novae are exceptions: their variability greatly exceeds a factor of 2 due to the uncertainties in the reaction rates of 30 P(p,γ) 31 S, 33 S(p,γ) 34 Cl, and 34 S(p,γ) 35 Cl, respectively. These results highlight the significant influence of specific reaction rates on the predicted abundance ratios and underscore the necessity for accurate nuclear measurements to reduce these uncertainties.

Classical novae

Accuracy Guarantees and Quantum Advantage in Analog Open Quantum Simulation with and without Noise

Many-body open quantum systems, described by Lindbladian master equations, are a rich class of physical models that display complex equilibrium and out-of-equilibrium phenomena which remain to be understood. In this paper, we theoretically analyze noisy analog quantum simulation of geometrically local open quantum systems and provide evidence that this problem both is hard to simulate on classical computers and could be approximately solved on near-term quantum devices. First, given a noiseless quantum simulator, we show that the dynamics of local observables and the fixed-point expectation values of rapidly mixing local observables in geometrically local Lindbladians can be obtained to a precision of ϵ in time that is poly ( ϵ − 1 ) and uniform in system size. Furthermore, we establish that the quantum simulator would provide a superpolynomial advantage, in run-time scaling with respect to the target precision and either the evolution time (when simulating dynamics) or the Lindbladian’s decay rate (when simulating fixed points), over any classical algorithm for these problems, assuming BQP ≠ BPP . We then consider the presence of noise in the quantum simulator in the form of additional geometrically local Lindbladian terms. We show that the simulation tasks considered in this paper are stable to errors; i.e., they can be solved to a noise-limited, but system-size independent, precision. Finally, we establish that, assuming BQP ≠ BPP , there are stable geometrically local Lindbladian simulation problems such that, as the noise rate on the simulator is reduced, classical algorithms must take time superpolynomially longer in the inverse noise rate to attain the same precision as the analog quantum simulator. Published by the American Physical Society 2025

Kashyap, Vikram (ORCID:0000000208195207)

Beyond-classical computation in quantum simulation

Quantum computers hold the promise of solving certain problems that lie beyond the reach of conventional computers. However, establishing this capability, especially for impactful and meaningful problems, remains a central challenge. Here, we show that superconducting quantum annealing processors can rapidly generate samples in close agreement with solutions of the Schrödinger equation. We demonstrate area-law scaling of entanglement in the model quench dynamics of two-, three-, and infinite-dimensional spin glasses, supporting the observed stretched-exponential scaling of effort for matrix-product-state approaches. We show that several leading approximate methods based on tensor networks and neural networks cannot achieve the same accuracy as the quantum annealer within a reasonable time frame. Thus, quantum annealers can answer questions of practical importance that may remain out of reach for classical computation.

King, Andrew D. [D-Wave Quantum Inc., Burnaby, BC

Multidimensional Nova Simulations with an Extended Buffer and Lower Initial Mixing Temperatures

A classical nova is a thermonuclear runaway initiated on a white dwarf accreting solar-like material from its stellar companion. Once the white dwarf accretes enough mass, the pressure at the base of the accreted layer reaches a critical point, leading to the ignition of the hydrogen fuel at their interface. This paper presents a set of two-dimensional CO classical nova simulations with an extended buffer zone of a fixed low density and temperature between the top of the accreted layer and the upper boundary, allowing us to capture the thermonuclear outburst in the domain. Our domain reduces the role of the upper-outflow boundary condition that has affected previous simulations and allows us to explore the nucleosynthesis evolution in detail. We also study the effects of the initial temperature perturbation and buffer size to explore their sensitivity in our simulations. Finally, we start our simulations with a lower temperature at the base of the accreted layer ( 7 × 10 7 K ) than previous work, allowing us to capture mixing earlier in the evolution, reducing the effects of the mixing-length-theory assumptions. This allows for a more realistic description of convective transport in our models.

Smith Clark, Alexander (ORCID:0000000159611680)

Refining fast calorimeter simulations with a Schrödinger Bridge

Machine learning-based simulations, especially calorimeter simulations, are promising tools for approximating the precision of classical high energy physics simulations with a fraction of the generation time. Nearly all methods proposed so far learn neural networks that map a random variable with a known probability density, like a Gaussian, to realistic-looking events. In many cases, physics events are not close to Gaussian and so these neural networks have to learn a highly complex function. We study an alternative approach: Schrödinger bridge Quality Improvement via Refinement of Existing Lightweight Simulations (SQuIRELS). SQuIRELS leverages the power of diffusion-based neural networks and Schrödinger bridges to map between samples where the probability density is not known explicitly. We apply SQuIRELS to the task of refining a classical fast simulation to approximate a full classical simulation. On simulated calorimeter events, we find that SQuIRELS is able to reproduce highly non-trivial features of the full simulation with a fraction of the generation time.

Calorimeter methods

MixPI: Mixed-time slicing path integral software for quantized molecular dynamics simulations

We introduce the MixPI software to implement path integral molecular dynamics (PIMD) simulations for the study of condensed phase systems where nuclear quantum effects (NQEs) are important. In contrast to existing PIMD simulation software, MixPI enables the implementation of mixed quantum–classical path integral simulations where only a subset of system degrees of freedom (dofs) are treated quantum mechanically in an extended phase space while the remaining dofs are described classically. We expect this software to be particularly useful for simulations of electron and proton transfer in condensed phase systems, as well as for the study of biological and material systems where only a handful of dofs contribute significantly to the observed NQEs. We demonstrate the use of MixPI in two different systems. The first is a simple water model where we implement a set of mixed quantum–classical simulations to compute average energy and radial distribution functions. We use these simulations to benchmark the effectiveness of MixPI and to demonstrate how it enables systematic investigation into the origin of observed NQEs. We then compute radial distribution functions for a system where MixPI is essential: a solvated metal (M 2+ ) cation described using an explicit quantized electron localized on an M 3+ ion in water.

chemical physics

A modular and extensible CHARMM-compatible model for all-atom simulation of polypeptoids

Peptoids (N-substituted glycines) are a class of sequence-defined synthetic peptidomimetic polymers with applications including drug delivery, catalysis, and biomimicry. Classical molecular simulations have been used to predict and understand the conformational dynamics of single chains and their self-assembly into morphologies including sheets, tubes, spheres, and fibrils. The CGenFF-NTOID model based on the CHARMM General Force Field has demonstrated success in accurate all-atom molecular modeling of peptoid structure and thermodynamics. Extension of this force field to new peptoid side chains has historically required reparameterization of side chain bonded interactions against ab initio data. This fitting protocol improves the accuracy of the force field but is also burdensome and precludes modular extensibility of the model to arbitrary peptoid sequences. In this work, we develop and demonstrate a Modular Side Chain CGenFF-NTOID (MoSiC-CGenFF-NTOID) as an extension of CGenFF-NTOID employing a modular decomposition of the peptoid backbone and side chain parameterizations, wherein arbitrary side chains within the large family of substituted methyl groups (i.e., –CH 3 , –CH 2 R, –CHRR', and –CRR'R") are directly ported from CGenFF. We validate this approach against ab initio calculations and experimental data to develop a MoSiC-CGenFF-NTOID model for all 20 natural amino acid side chains along with 13 commonly used synthetic side chains and present an extensible paradigm to efficiently determine whether a novel side chain can be directly incorporated into the model or whether refitting of the CGenFF parameters is warranted. We make the model freely available to the community along with a tool to perform automated initial structure generation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

Surrogate optimization of variational quantum circuits

Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has not yet been realized, with few claims of quantum advantage and high resource estimates, especially due to the need for optimization in the presence of noise. Finding algorithms and methods to improve convergence is important to accelerate the capabilities of near-term hardware for VQE or more broad applications of hybrid methods in which optimization is required. To this goal, we look to use modern approaches developed in circuit simulations and stochastic classical optimization, which can be combined to form a surrogate optimization approach to quantum circuits. Using an approximate (classical CPU/GPU) state vector simulator as a surrogate model, we efficiently calculate an approximate Hessian, passed as an input for a quantum processing unit or exact circuit simulator. This method will lend itself well to parallelization across quantum processing units. We demonstrate the capabilities of such an approach with and without sampling noise and a proof-of-principle demonstration on a quantum processing unit utilizing 40 qubits.

Gustafson, Erik J. [RIACS, Mtn. View] (ORCID:00000

Evaluation of phase shifts for nonrelativistic elastic scattering using quantum computers

Simulations of scattering processes are essential in understanding the physics of our universe. Computing relevant scattering quantities from ab initio methods is extremely difficult on classical devices because of the substantial computational resources needed. Here, this work reports the development of an algorithm that makes it possible to obtain phase shifts for generic nonrelativistic elastic scattering processes on a quantum computer. This algorithm is based on extracting phase shifts from the direct implementation of the real-time evolution. The algorithm is improved by a variational procedure making it more accurate and resistant to the quantum noise. The reliability of the algorithm is first demonstrated by means of classical numerical simulations for different potentials and later tested on existing quantum hardware, specifically on IBM quantum processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

Higher-form symmetry and chiral transport in real-time Abelian lattice gauge theory

We study classical lattice simulations of theories of electrodynamics coupled to charged matter at finite temperature, interpreting them using the higher-form symmetry formulation of magnetohydrodynamics (MHD). We compute transport coefficients using classical Kubo formulas on the lattice and show that the properties of the simulated plasma are in complete agreement with the predictions from effective field theories. In particular, the higher-form formulation allows us to understand from hydrodynamic considerations the relaxation rate of axial charge in the chiral plasma observed in previous simulations. A key point is that the resistivity of the plasma – defined in terms of Kubo formulas for the electric field in the 1-form formulation of MHD – remains a well-defined and predictive quantity at strong electromagnetic coupling. However, the Kubo formulas used to define the conventional conductivity vanish at low frequencies due to electrodynamic fluctuations, and thus the concept of the conductivity of a gauged electric current must be interpreted with care.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS

Qutrit and qubit circuits for three-flavor collective neutrino oscillations

We explore the utility of qutrits and qubits for simulating the flavor dynamics of dense neutrino systems. The evolution of such systems impacts some important astrophysical processes, such as core-collapse supernovae and the nucleosynthesis of heavy nuclei. Many-body simulations require classical resources beyond current computing capabilities for physically relevant system sizes. Quantum computers are therefore a promising candidate to efficiently simulate the many-body dynamics of collective neutrino oscillations. Previous quantum simulation efforts have primarily focused on properties of the two-flavor approximation due to their direct mapping to qubits. Furthermore, we present new quantum circuits for simulating three-flavor neutrino systems on qutrit- and qubit-based platforms, and demonstrate their feasibility by simulating systems of two, four, and eight neutrinos on IBM and Quantinuum quantum computers.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

Temporal Coarse Graining for Classical Stochastic Noise in Quantum Systems

Simulations of quantum systems with Hamiltonian classical stochastic noise can be challenging when the noise exhibits temporal correlations over a multitude of time scales, such as for 1/f noise in solid-state quantum information processors. Here we present an approach for simulating Hamiltonian classical stochastic noise that performs temporal coarse-graining by effectively integrating out the high-frequency components of the noise. We focus on the case where the stochastic noise can be expressed as a sum of Ornstein-Uhlenbeck processes. Temporal coarse-graining is then achieved by conditioning the stochastic process on a coarse realization of the noise, expressing the conditioned stochastic process in terms of a sum of smooth, deterministic functions and bridge processes with boundaries fixed at zero, and performing the ensemble average over the bridge processes. For Ornstein-Uhlenbeck processes, the deterministic components capture all dependence on the coarse realization, and the stochastic bridge processes are not only independent but taken from the same distribution with correlators that can be expressed analytically, allowing the associated noise propagators to be precomputed once for all simulations. This combination of noise trajectories on a coarse time grid and ensemble averaging over bridge processes has practical advantages, such as a simple concatenation rule, that we highlight with numerical examples.

Albash, Tameem [Sandia National Lab. (SNL-NM), Alb