Engineering Papers⌕ Search

SEARCH · Engineering Papers

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms

Abstract Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with Adaptive Derivative-Assembled Problem-Tailored variational quantum eigensolver (ADAPT-VQE), an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to optimal parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the approximate Hessian in the state of the optimizer to be consistently closer to the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical implementation of a quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation.

Ramôa, Mafalda (ORCID:0000000302187801)↗
DOE OSTI2025

Intermediate-temperature topological Uhlmann phase on IBM quantum computers

A spin-1 system can exhibit an intermediate-temperature topological regime with a quantized Uhlmann phase sandwiched by topologically trivial low- and high-temperature regimes. We present a quantum circuit consisting of system and ancilla qubits plus a probe qubit which prepares an initial state corresponding to the purified state of a spin-1 system at finite temperature, evolves the system according to the Uhlmann process, and measures the Uhlmann phase via expectation values of the probe qubit. Although classical simulations suggest the quantized Uhlmann phase is observable on International Business Machines (IBM’s) noisy intermediate-scale quantum (NISQ) computers, an implementation of the circuit without any optimization exceeds the gate count for the error budget and results in unresolved signals. Through a series of optimization with Qiskit and BQSKit, the gate count can be substantially reduced, making the jumps of the Uhlmann phase more visible. A recent hardware upgrade of IBM quantum computers further improves the signals and leads to a clearer demonstration of interesting finite-temperature topological phenomena on NISQ hardware.

Mastandrea, Christopher [Univ. of California, Merc↗
DOE OSTI2024

Random insights into the complexity of two-dimensional tensor network calculations

Projected entangled pair states (PEPS) offer memory-efficient representations of some quantum many-body states that obey an entanglement area law and are the basis for classical simulations of ground states in two-dimensional (2d) condensed matter systems. However, rigorous results show that exactly computing observables from a 2d PEPS state is generically a computationally hard problem. Yet approximation schemes for computing properties of 2d PEPS are regularly used, and empirically seen to succeed, for a large subclass of (“not too entangled”) condensed matter ground states. Adopting the philosophy of random matrix theory, in this work, we analyze the complexity of approximately contracting a 2d random PEPS by exploiting an analytic mapping to an effective replicated statistical mechanics model that permits a controlled analysis at a large bond dimension. Through this statistical-mechanics lens, we argue that (i) although approximately sampling wave-function amplitudes of random PEPS faces a computational-complexity phase transition above a critical bond dimension, and (ii) one can generically efficiently estimate the norm and correlation functions for any finite bond dimension. Furthermore, these results are supported numerically for various bond-dimension regimes. It is an important open question whether the above results for random PEPS apply more generally also to PEPS representing physically relevant ground states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Adiabatic quantum imaginary time evolution

We introduce an adiabatic state preparation protocol which implements quantum imaginary time evolution under the Hamiltonian of the system. Unlike the original quantum imaginary time evolution algorithm, adiabatic quantum imaginary time evolution does not require quantum state tomography during its runtime and, unlike standard adiabatic state preparation, the final Hamiltonian is not the system Hamiltonian. Instead, the algorithm obtains the adiabatic Hamiltonian by integrating a classical differential equation that ensures that one follows the imaginary time evolution state trajectory. We introduce some heuristics that allow this protocol to be implemented on quantum architectures with limited resources. We explore the performance of this algorithm via classical simulations in a one-dimensional spin model and highlight essential features that determine its cost, performance, and implementability for longer times, and compare to the original quantum imaginary time evolution for ground-state preparation. More generally, our algorithm expands the range of states accessible to adiabatic state preparation methods beyond those that are expressed as ground states of simple explicit Hamiltonians. Published by the American Physical Society 2024

Hejazi, Kasra (ORCID:000000032349478X)↗
DOE OSTI2026

A Tensor Network-Based Quantum Algorithm for the Nonlinear 1D Burgers' Equation

In this work, we implement a tensor network-based quantum algorithm to solve unsteady, nonlinear partial differential equations (PDEs). The challenge lies in how to effectively represent, encode, process, and evolve the nonlinear system of PDEs on quantum computers. We will discuss the new techniques using the compressible 1-dimensional (1D) Burgers' equation as an example, because it represents the fundamental nonlinear feature and yet removes certain complexity in physics, allowing us to focus on the design of quantum algorithms. Previous attempts to solve nonlinear PDEs in quantum computation have often involved storing multiple copies of solutions or employing linearizations. Neither is practical due to exponential scaling with evolution time or insufficient solution accuracy. Our framework is based on matrix product states (MPSs) and matrix product operators (MPOs). For example, the velocity field is represented by MPS, whereas the linear and nonlinear spatial differential terms of the velocity field are processed by MPOs. Our primary focus herein is to verify and validate the various tensor network components of the algorithm using solutions obtained by the classical algorithms on high performance computing (HPC) architectures. We use a classical time marching method to demonstrate the functionality of the tensor network operations to model the PDE and their robustness with the time evolution of the system. Our classical simulation results demonstrate the utility of tensor network-based operations in modeling nonlinear PDEs and highlight the necessity as well as potential advantages of using quantum simulations for these techniques.

Gopalakrishnan Meena, Murali [ORNL] (ORCID:0000000↗
DOE OSTI2025

Simulating quantum-classical interfaces via the Lindblad master equation

In hybrid quantum systems, the interface between quantum and classical domains is essential for the generation, control, and measurement of quantum states. Quantum-classical interfaces (QCIs) are ubiquitous in devices such as optical modulators, quantum sensors, and signal processors, where classical signals influence quantum dynamics. In this paper, we employ the Lindblad master equation to simulate the evolution of a quantum system interacting with a classical control system. Our model captures both linear and nonlinear interactions by incorporating first- and second-order susceptibilities, and it quantifies the influence of externally applied control parameters on decoherence and state evolution. As an illustrative example, we analyze an optical modulator and demonstrate how variations in material response and drive conditions affect photon statistics, coherence, and phase-space distributions. In conclusion, the findings offer a path to an all-encompassing model for understanding and optimizing QCIs, with wide-ranging implications for the performance, design, and robustness of next-generation quantum devices.

Quantum engineering↗
DOE OSTI2025

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

Porting Classical Approaches for Quantum Simulations to Quantum Computers

Simulating quantum many-body systems is one of the most promising problems in which we might anticipate that quantum computers should show quantum advantage. Unfortunately, there is still a gap between this promise and actual practice. New quantum algorithms need to be developed and the current quantum algorithms have various difficulties - e.g efficient state preparation - which must be overcome and improved upon. In many cases, classical approaches need to be ported over to quantum devices. In this project we have developed a suite of new quantum algorithms which makes progress in this regard. We developed a new optimization scheme for variational quantum eigensolvers, UBOS, which mitigates problems with local minimas and barren plateaus while improving convergence to the ground state by an order of magnitude. We developed a new way to utilize qubitization to find ground states of nearly frustration-free Hamiltonians faster than all previous methods. We developed a series of state preparation techniques which helps initialize parameterized quantum circuits into reasonable starting points on which quantum algorithms are then applied. In addition to the development of novel algorithms, it is critical to have classical simulation techniques for approximately simulating quantum circuits which can be used to benchmark and understand quantum algorithms. Toward that end, we developed a novel POVM formalism to simulate quantum circuits as well as exemplify the massive parallelization of tensor network methodologies. Finally, we developed physical understanding of entanglement phase transitions such as many-body localization and random tensor networks.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Modeling prebiotic chemistries with quantum accuracy at classical costs

Molecular Dynamics (MD) simulations using classical force-fields are commonly employed in numerous scientific investigations. However, many natural processes involve bond breaking and quantum forces. This complexity is compounded by the presence of multiple competing length and timescales. For example, accurately modeling the thermodynamics and dynamics of a chemical reaction requires accounting for the concerted movements of numerous solvent molecules and ions with their own fast or slow timescales. While widely used static Density Functional Theory (DFT) calculations at 0 temperature can be beneficial for such investigations, they do not account for dynamics, and lack precision in describing the molecular environments. They particularly fail at correct, rigorous treatments of finite-temperature fluctuations, and thus generalization to experimentally relevant conditions. In PNAS Benayad et al develop a scalable, generalizable approach for designing Neural Network Potentials (NNPs) that can handle chemical reactivity in solvated systems with quantum accuracy at classical costs. Specifically, they study phosphoester bond formation and rupture, which is fundamentally relevant to the Phosphorus-Oxygen bond formation central to life, and especially for the RNA world hypothesis. The framework developed here has the potential to generalize to different chemical reactions of energy and biological relevance.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

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

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

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

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

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

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)↗
DOE OSTI2025

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

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)↗
DOE OSTI2025

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↗