Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum simulations”

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 829 records · Page 46
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Quantum fluctuations in dense plasma simulations

Molecular dynamics (MD) simulations are a powerful tool for modeling warm and hot dense matter. Density functional theory (DFT) MD simulations are often preferred in dense plasmas in order to accurately model quantum electronic structure. However, DFT-MD simulations neglect interaction effects due to fluctuations in excited states. In this work, we present an MD approach that uses excited state method pseudoatoms to run dense plasma simulations with many different core-electron configurations at classical MD speeds. We also allow for transitions between different configurations in our simulations and find that these fluctuations are especially important for highly excited states. Our results suggest that finite configuration lifetimes that are comparable to the inverse ion plasma frequency need to be accounted for in order to accurately model ion distributions in dense plasma simulations. We also demonstrate that excited state fluctuations have a direct impact on ion plasma microfields, generate different plasma microfields for different excitation levels, and thereby induce absorption–emission line shape asymmetries even in steady-state plasmas.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Grand Unification of Quantum Algorithms

Quantum algorithms offer significant speed-ups over their classical counterparts for a variety of problems. The strongest arguments for this advantage are borne by algorithms for quantum search, quantum phase estimation, and Hamiltonian simulation, which appear as subroutines for large families of composite quantum algorithms. A number of these quantum algorithms have recently been tied together by a novel technique known as the quantum singular value transformation (QSVT), which enables one to perform a polynomial transformation of the singular values of a linear operator embedded in a unitary matrix. In the seminal GSLW’19 paper on the QSVT [Gilyén et al., ACM STOC 2019], many algorithms are encompassed, including amplitude amplification, methods for the quantum linear systems problem, and quantum simulation. Here, we provide a pedagogical tutorial through these developments, first illustrating how quantum signal processing may be generalized to the quantum eigenvalue transform, from which the QSVT naturally emerges. Paralleling GSLW’19, we then employ the QSVT to construct intuitive quantum algorithms for search, phase estimation, and Hamiltonian simulation, and also showcase algorithms for the eigenvalue threshold problem and matrix inversion. This overview illustrates how the QSVT is a single framework comprising the three major quantum algorithms, suggesting a grand unification of quantum algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Simulating plasma wave propagation on a superconducting quantum chip

Quantum computers may one day enable the efficient simulation of strongly coupled plasmas that lie beyond the reach of classical computation in regimes where quantum effects are important and the scale separation is large. Here, in this article, we take a first step toward efficient simulation of quantum plasmas by demonstrating linear plasma wave propagation on a superconducting quantum chip. Using high-fidelity and highly expressive device-native gates, combined with an error-mitigation technique, we simulate the scattering of laser pulses from inhomogeneous plasmas. Our approach is made feasible by the identification of a suitable local spin model whose excitations mimic plasma waves, and whose circuit implementation requires a lower gate count than other proposed approaches that would require a future fault-tolerant quantum computer. This work opens avenues to study more complicated phenomena that cannot be simulated efficiently on classical computers, such as nonlinear quantum dynamics when strongly coupled plasmas are driven out of equilibrium.

general physics↗
DOE OSTI2021

Request for Information: Access to Quantum Systems

Quantum science and technology is a focal point of research at Lawrence Livermore National Laboratory (LLNL). Quantum-coherent devices offer the potential for unprecedented precision in sensing and the ability to directly simulate complex quantum phenomena that have no known efficient classical algorithms. Thus, development and implementation of quantum technologies is expected to have a significant impact on our ability to address some of the most complex national security problems. LLNL maintains projects involving a broad spectrum of Quantum Information Science (QIS) research activities including investigating sources of decoherence, the 3DQ microscope, studies into quantum interconnects, 3-D printed ion traps, fusion energy and nuclear physics simulations, modeling for data-starved environments, and quantum sensing, including accelerometry and timing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Combining Reactive Quantum-Mechanical Molecular-Dynamics Simulations with Mutagenesis, Crystallography, and Enzyme Kinetics to Reveal Plausible Steps of Isocyanide Hydratase Catalysis

A complete understanding of enzyme mechanisms requires atomistic details of chemical reactions. Quantum-based molecular dynamics simulations (QMD) are a potential source of this information, but trade-offs between accuracy and computational cost have limited their use. We previously developed extended Lagrangian Born–Oppenheimer molecular dynamics (XL-BOMD) methods that leverage a negligible compromise in accuracy to substantially decrease the cost of QMD simulations. Here, we develop a reactive QMD approach using the latest XL-BOMD formulation, which enables efficient simulations of highly reactive systems, and use it to investigate mechanisms of intermediate formation in isocyanide hydratase (ICH) catalysis. In QMD simulations, molecular analogs of ICH active site residues reacted with para-nitrophenyl isocyanide, forming a thioimidate. Analysis of simulated atomic configurational and charge dynamics revealed a pathway where protonation of the isocyanide carbon occurs prior to thioimidate formation and suggested a possible role of Asp17 as a proton donor in the early phase of ICH catalysis. To test whether the pathway seen using the reactive QMD approach might be relevant to ICH catalysis, we performed X-ray crystallography and pre-steady-state enzyme kinetics studies of wild-type and D17N mutant ICH. Both the structure and kinetics are sensitive to the D17N mutation in a manner that is consistent with the order of the reaction steps seen in the simulations. Mobile protons play essential roles in many enzymes, yet they are difficult to observe experimentally, making the ordering of proton-dependent steps ambiguous in many enzyme mechanisms. The ability to directly simulate model reactions for the design of experiments that provide information about enzyme mechanisms involving mobile protons demonstrates the significance of our reactive QMD approach and motivates further biological applications.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Deconvolving the components of the sign problem

Auxiliary field quantum Monte Carlo simulations of interacting fermions require sampling over a Hubbard-Stratonovich field h introduced to decouple the interactions. The weight for a given configuration involves the products of the determinant of matrices $M_σ(h)$ where σ labels the species, and hence is typically not positive definite. Indeed, the average sign $\langle \mathscr {L} \rangle$ of the determinants goes to zero exponentially with increasing spatial size and decreasing temperature for most Hamiltonians of interest. This statement, however, does not explicitly separate two possible origins for the vanishing of $\langle \mathscr {L} \rangle$. Does $\langle \mathscr {L} \rangle$ → 0 because randomly chosen field configurations have det[M(h)] < 0, or does the sign problem arise because the specific subset of configurations chosen by the weighting function have a greater preponderance of negative values? In the latter case, the process of weighting the configurations with |det[M(h)]| might steer the simulation to a region of configuration space of h where positive and negative determinants are equally likely, even though randomly chosen h would preferentially have determinants with a single dominant sign. Here in this paper, we address the relative importance of these two mechanisms for the vanishing of $\langle \mathscr {L} \rangle$ in quantum simulations.

36 MATERIALS SCIENCE↗
DOE OSTI2023

MBX: A many-body energy and force calculator for data-driven many-body simulations

Many-Body eXpansion (MBX) is a C++ library that implements many-body potential energy functions (PEFs) within the “many-body energy” (MB-nrg) formalism. MB-nrg PEFs integrate an underlying polarizable model with explicit machine-learned representations of many-body interactions to achieve chemical accuracy from the gas to the condensed phases. MBX can be employed either as a stand-alone package or as an energy/force engine that can be integrated with generic software for molecular dynamics and Monte Carlo simulations. MBX is parallelized internally using Open Multi-Processing and can utilize Message Passing Interface when available in interfaced molecular simulation software. In this study, MBX enables classical and quantum molecular simulations with MB-nrg PEFs, as well as hybrid simulations that combine conventional force fields and MB-nrg PEFs, for diverse systems ranging from small gas-phase clusters to aqueous solutions and molecular fluids to biomolecular systems and metal-organic frameworks.

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

HPC4Mfg with Sepion

We employed ab-initio simulations and quantum chemical calculations to develop a computational framework for simulating the microscopic structure and mechanical properties of novel polymer membranes used in lithium sulfur batteries. To meet industry targets, next generation batteries with high specific energy (Wh/kg) are essential. Efforts to commercialize light-weight, energy-dense lithium-sulfur secondary batteries (2510 Wh/kg) have been stalled by ongoing problems with the battery’s separator membrane, which should prevent cross-over of active material from cathode to anode that, if unchecked, limits cycle-life. However, Sepion Technologies’ polymer membranes yield long-lasting lithium-sulfur cells. Advancing to 10 Ah battery prototypes, Sepion faces challenges in membrane manufacturing related to polymer processing and the molecular basis for membrane performance and durability. High performance computing offers critical new insight into these phenomena, which in turn will accelerate product entry into the market.

25 ENERGY STORAGE↗
DOE OSTI2024

How Aqueous Solvation Impacts the Frequencies and Intensities of Infrared Absorption Bands in Flavin: The Quest for a Suitable Solvent Model

FTIR spectroscopy accompanied by quantum chemical simulations can reveal important information about molecular structure and intermolecular interactions in the condensed phase. Simulations typically account for the solvent either through cluster quantum mechanical (QM) models, polarizable continuum models (PCM), or hybrid quantum mechanical/molecular mechanical (QM/MM) models. Recently, we studied the effect of aqueous solvent interactions on the vibrational frequencies of lumiflavin, a minimal flavin model, using cluster QM and PCM models. Those models successfully reproduced the relative frequencies of four prominent stretching modes of flavin’s isoalloxazine ring in the diagnostic 1450–1750 cm−1 range but poorly reproduced the relative band intensities. Here, we extend our studies on this system and account for solvation through a series of increasingly sophisticated models. Only by combining elements of QM clusters, QM/MM, and PCM approaches do we obtain an improved agreement with the experiment. The study sheds light more generally on factors that can impact the computed frequencies and intensities of IR bands in solution.

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

Sparse Phase Ansatzes for Resource-Efficient Qudit State Preparation via the SNAP-Displacement Protocol

Efficient preparation of nonclassical bosonic states is a central requirement for quantum computing, simulation, and precision metrology. We study resource-efficient quantum state preparation in bosonic qudit systems using the SNAP-displacement (SD) protocol. Existing SD-based approaches typically require a large number of gates and SNAP phases, resulting in complex control pulses with longer ansatz durations and amplified impact of photon-loss and control errors. In this work, we focus on the near- to medium-term regime, in which noisy quantum devices impose trade-offs on the fidelity that can be achieved, which must be taken into account. Specifically, we propose to optimize only a subset of the SNAP phases and introduce three progressively more general sparse ansatzes. To provide fine-grained control and identify the most suitable ansatz for a given target fidelity, we further employ a scalarized multi-objective optimization that trades off fidelity against either the number of phases or the duration of the ansatz. Numerical results for several target states and qudit dimensions up to $d=64$, evaluated through the hypervolume of the Pareto frontiers, show that these sparse ansatzes achieve favorable trade-offs over the fully parameterized SD protocol in both ideal and noisy settings. The advantage is strongest and most consistent when minimizing the number of phases, while improvements in ansatz duration are smaller and more dependent on the target-state family and noise level, suggesting a practical route to more efficient near- and medium-term bosonic state preparation.

Ferrari Dacrema, Maurizio [Milan Polytechnic] (ORC↗
DOE OSTI2025

Control simulations of many-body quantum systems by a synergism of discrete real-time learning and optimal control theory

We present a self-consistent algorithm for optimal control simulations of many-body quantum systems. The algorithm features a two-step synergism that combines discrete real-time machine learning (DRTL) with Quantum Optimal Control Theory (QOCT) using the time-dependent Schrödinger equation. Specifically, in step (1), DRTL is employed to identify a compact working space (i.e., the important portion of the Hilbert space) for the time evolution of the many-body quantum system in the presence of a control field (i.e., the initial or previously updated field), and in step (2), QOCT utilizes the DRTL-determined working space to find a newly updated control field for a chosen objective. Steps 1 and 2 are iterated until a self-consistent control objective value is reached such that the resulting optimal control field yields the same targeted objective value when the corresponding working space is systematically enlarged. Furthermore, to demonstrate this two-step self-consistent DRTL-QOCT synergistic algorithm, we perform optimal control simulations of strongly interacting 1D as well as 2D Heisenberg spin systems. In both scenarios, only a single spin (at the left end site for 1D and the upper left corner site for 2D) is driven by the time-dependent control fields to create an excitation at the opposite site as the target. It is found that, starting from all spin-down zero excitation states, the synergistic method is able to identify working spaces and convergence of the desired controlled dynamics with just a few iterations of the overall algorithm. In the cases studied, the dimensionality of the working space scales only quasi-linearly with the number of spins.

Artificial neural networks↗
DOE OSTI2020

TURBOMOLE: Modular program suite for ab initio quantum-chemical and condensed-matter simulations

TURBOMOLE is a collaborative, multi-national software development project aiming to provide highly efficient and stable computational tools for quantum chemical simulations of molecules, clusters, periodic systems, and solutions. The TURBOMOLE software suite is optimized for widely available, inexpensive, and resource-efficient hardware such as multi-core workstations and small computer clusters. TURBOMOLE specializes in electronic structure methods with outstanding accuracy–cost ratio, such as density functional theory including local hybrids and the random phase approximation (RPA), GW-Bethe–Salpeter methods, second-order Møller–Plesset theory, and explicitly correlated coupled-cluster methods. TURBOMOLE is based on Gaussian basis sets and has been pivotal for the development of many fast and low-scaling algorithms in the past three decades, such as integral-direct methods, fast multipole methods, the resolution-of-the-identity approximation, imaginary frequency integration, Laplace transform, and pair natural orbital methods. This review focuses on recent additions to TURBOMOLE’s functionality, including excited-state methods, RPA and Green’s function methods, relativistic approaches, high-order molecular properties, solvation effects, and periodic systems. A variety of illustrative applications along with accuracy and timing data are discussed. Moreover, available interfaces to users as well as other software are summarized. TURBOMOLE’s current licensing, distribution, and support model are discussed, and an overview of TURBOMOLE’s development workflow is provided. Challenges such as communication and outreach, software infrastructure, and funding are highlighted.

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

Digital quantum magnetism on a trapped-ion quantum computer

Digital quantum matter—realized when discrete quantum gates approximate continuous time evolution—is susceptible to heating into chaotic, structureless states. If digitization errors are adequately suppressed, a long-lived transient regime of approximately energy-conserving dynamics can be observed on gate-based quantum computers. Conservation of energy, in turn, enables the exploration of a wide variety of complex behaviours observed in equilibrium systems, ranging from the non-trivial microscopic origins of thermalization itself to the stabilization of effective models hosting exotic emergent properties. Here we use Quantinuum’s H2 quantum computer to simulate digitized dynamics of the quantum Ising model, suppressing digitization errors well enough to observe thermalization on timescales that severely challenge classical simulation methods. Relaxation of an inhomogeneous state reveals an emergent hydrodynamics owing to approximate energy conservation and we compute the associated diffusion constant. By reprogramming our simulations to take place on a triangular lattice with periodic boundary conditions, we observe thermalization consistent with emergent gauge and topological constraints resulting from lattice frustration. Furthermore, our results were enabled by continued advances in two-qubit gate quality (native partial entangler fidelities of 99.94(1)%) and establish digital quantum computers as powerful tools for studying (effectively) continuous-time dynamics.

Information theory and computation↗
DOE OSTI2023

Tensor train continuous time solver for quantum impurity models

The simulation of strongly correlated quantum impurity models is a significant challenge in modern condensed matter physics that has multiple important applications. Thus far, the most successful methods for approaching this challenge involve Monte Carlo techniques that accurately and reliably sample perturbative expansions to any order. However, the cost of obtaining high precision through these methods is high. Recently, tensor train decomposition techniques have been developed as an alternative to Monte Carlo integration. In this study, we apply these techniques to the single-impurity Anderson model at equilibrium by calculating the systematic expansion in power of the hybridization of the impurity with the bath. Furthermore, we demonstrate the performance of the method in a paradigmatic application, examining the first-order phase transition on the infinite-dimensional Bethe lattice, which can be mapped to an impurity model through dynamical mean field theory. Our results indicate that using tensor train decomposition schemes allows the calculation of finite-temperature Green's functions and thermodynamic observables with unprecedented accuracy. The methodology holds promise for future applications to frustrated multiorbital systems, using a combination of partially summed series with other techniques pioneered in diagrammatic and continuous time quantum Monte Carlo.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Quantum Divide and Compute: Hardware Demonstrations and Noisy Simulations

Noisy, intermediate-scale quantum computers come with intrinsic limitations in terms of the number of qubits (circuit "width") and decoherence time (circuit "depth") they can have. Here, for the first time, we demonstrate a recently introduced method that breaks a circuit into smaller subcircuits or fragments, and thus makes it possible to run circuits that are either too wide or too deep for a given quantum processor. We investigate the behavior of the method on one of IBM's 20-qubit superconducting quantum processors with various numbers of qubits and fragments. We build noise models that capture decoherence, readout error, and gate imperfections for this particular processor. We then carry out noisy simulations of the method in order to account for the observed experimental results. We find an agreement within 20% between the experimental and the simulated success probabilities, and we observe that recombining noisy fragments yields overall results that can outperform the results without fragmentation.

Ayral, Thomas↗
DOE OSTI2024

Security of quantum position-verification limits Hamiltonian simulation via holography

We investigate the link between quantum position-verification (QPV) and holography established in [1] using holographic quantum error correcting codes as toy models. By inserting the “temporal” scaling of the AdS metric by hand via the bulk Hamiltonian interaction strength, we recover a toy model with consistent causality structure. This leads to an interesting implication between two topics in quantum information: if position-based verification is secure against attacks with small entanglement then there are new fundamental lower bounds for resources required for one Hamiltonian to simulate another.

AdS-CFT Correspondence↗
DOE OSTI2026

Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation

Motivated by various applications, unbounded Hamiltonian simulation has recently garnered great attention. Quantum Magnus algorithms, designed to achieve commutator scaling for time-dependent Hamiltonian simulation, have been found to be particularly efficient for such applications. When applied to unbounded Hamiltonian simulation in the interaction picture, they exhibit an unexpected superconvergence phenomenon. However, existing proofs are limited to the spatially continuous setting and do not extend to discrete spatial discretizations. Here, in this work, we provide the first superconvergence estimate in the fully discrete setting with a finite number of spatial discretization points N, and show that it holds with an error constant uniform in N. The proof is based on the two-parameter symbol class, which, to our knowledge, is applied for the first time in algorithm analysis. The key idea is to establish a semiclassical framework by identifying two parameters through the discretization number and the time step size rescaled by the operator norm, such that the semiclassical uniformity guarantees the uniformity of both. This approach may have broader applications in numerical analysis beyond the specific context of this work.

Borns-Weil, Yonah [University of California, Berke↗
DOE OSTI2021

Linear embedding of nonlinear dynamical systems and prospects for efficient quantum algorithms

The simulation of large nonlinear dynamical systems, including systems generated by discretization of hyperbolic partial differential equations, can be computationally demanding. Such systems are important in both fluid and kinetic computational plasma physics. This motivates exploring whether a future error-corrected quantum computer could perform these simulations more efficiently than any classical computer. In this work, we describe a method for mapping any finite nonlinear dynamical system to an infinite linear dynamical system (embedding) and detail three specific cases of this method that correspond to previously studied mappings. Then we explore an approach for approximating the resulting infinite linear system with finite linear systems (truncation). Using a number of qubits only logarithmic in the number of variables of the nonlinear system, a quantum computer could simulate truncated systems to approximate output quantities if the nonlinearity is sufficiently weak. Other aspects of the computational efficiency of the three detailed embedding strategies are also discussed.

97 MATHEMATICS AND COMPUTING↗