SEARCH · Search NASA

Results for “quantum computing for 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 847 records · Page 47

All sources NASA NTRS DOE OSTI

DOE OSTI2026

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗

DOE OSTI2026

Self-consistent mean-field quantum approximate optimization

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗

DOE OSTI2026

Self-consistent mean-field quantum approximate optimization

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗

DOE OSTI2022

Fluid structure interaction of a subaqueous pendulum: Analyzing the effect of wake correction via large eddy simulations

The dynamic behavior of a subaqueous cylindrical pendulum and corresponding flow dynamics are investigated. The objectives were twofold: (i) to examine whether the two-dimensional model equations sufficiently capture the three-dimensional dynamics and (ii) to investigate the emerging three-dimensional vortical flow structures. Large eddy simulations with two-way coupling fluid structure interaction were carried out using the immersed boundary method to simulate the motion of the pendulum and its interactions with the initially stagnant water. The resulting pendulum motion is compared against measured data obtained in a series of experimental tests to validate the simulation results and the model equations with and without wake corrections. An analysis of the flow vorticity revealed the development of a vortex ring during the first swing and the formation of tip vortices. The evolution of the vortex rings emerging from the motion of the subaqueous cylindrical pendulum was visualized using Q-criteria showing a reasonable agreement with vortical structures observed in the experiment using particle imaging velocimetry. The hydrodynamic moments acting on the simulated pendulum and the moments calculated from the model equations are analyzed. Using the insights from these numerical simulations, a modification of the wake correction is proposed to enhance the accuracy of the rate of decay and period. The transient effect of coherent flow on pendulum dynamics, especially the added mass effect, is discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Accelerating resonant spectroscopy simulations using multishifted biconjugate gradient

Resonant spectroscopies, which involve intermediate states with finite lifetimes, provide important insights into collective excitations in quantum materials that are otherwise inaccessible. However, theoretical understanding in this area is often limited by the numerical challenges of solving Kramers-Heisenberg-type response functions for large-scale systems. To address this, we introduce a multishifted biconjugate gradient algorithm that exploits the shared structure of Krylov subspaces across spectra with varying incident energies, effectively reducing the computational complexity to that of linear spectroscopies. Both mathematical proofs and numerical benchmarks confirm that this algorithm substantially accelerates spectral simulations, achieving constant complexity independent of the number of incident energies, while ensuring accuracy and stability. This development provides a scalable, versatile framework for simulating advanced spectroscopies in quantum materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2026

Mixed-precision numerics in scientific applications: survey and perspectives

The explosive demand for artificial intelligence (AI) workloads has led to a significant increase in silicon area dedicated to lower-precision computations on recent high-performance computing hardware designs. However, mixed-precision capabilities, which can achieve performance improvements of up to 8x compared to double-precision in extreme compute-intensive workloads, remain largely untapped in most scientific applications. A growing number of efforts have shown that mixed-precision algorithmic innovations can deliver superior performance without sacrificing accuracy. These developments should prompt computational scientists to seriously consider whether their scientific modeling and simulation applications could benefit from the acceleration offered by new hardware and mixed-precision algorithms. In this survey, we (1) review progress across diverse scientific domains—fluid dynamics, weather and climate, quantum chemistry, and computational genomics—that have begun adopting mixed-precision strategies; (2) examine state-of-the-art algorithmic techniques such as iterative refinement, splitting and emulation schemes, and adaptive precision solvers; (3) assess their implications for accuracy, performance, and resource utilization; and (4) survey the emerging software ecosystem that enables mixed-precision methods at scale. We conclude with perspectives and recommendations on cross-cutting opportunities, domain-specific challenges, and the role of co-design between application scientists, numerical analysts, and computer scientists. Collectively, this survey underscores that mixed-precision numerics can reshape computational science by aligning algorithms with the evolving landscape of hardware capabilities.

Graphics processing units↗

DOE OSTI2022

Feasibility study of quantum computing using trapped electrons

In this study, we investigate the feasibility of using electrons in a linear Paul trap as qubits in a future quantum computer. We discuss the necessary experimental steps to realize such a device through a concrete design proposal, including trapping, cooling, electronic detection, spin readout, and single- and multiqubit gate operations. Numeric simulations indicate that two-qubit Bell-state fidelities of order 99.99% can be achieved assuming reasonable experimental parameters.

74 ATOMIC AND MOLECULAR PHYSICS↗

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 OSTI2023

Origins of Conformational Heterogeneity in Peptoid Helices Formed by Chiral N -1-Phenylethyl Sidechains

N-substituted glycines (polypeptoids) containing chiral hydrophobic sidechains are known to fold into biomimetic alpha helices. These helix formers often produce conformationally heterogeneous structures and are difficult to characterize at a sub-nanometer resolution. Previously, peptoid N-1-phenylethyl (S)-enantiomer sidechains (Nspe) were inferred from various experiments to form right-handed helices and (R)-enantiomers (Nrpe), left-handed helices. Prior computational work for N(s/r)pe oligomers has struggled to reproduce this trend. Herein, quantum mechanics calculations and molecular dynamics simulations are used to understand the origins of this discrepancy. Results from DFT and molecular mechanics calculations on a variety of Nspe and Nrpe oligomers as a function of chain length are in agreement, showing that Nspe and Nrpe prefer left- and right-handed helices, respectively. Additional metadynamics simulations are used to study Nrpe and Nspe oligomers folding in water. These results show that the free-energy driving forces for assembly into a helical backbone configuration are very small (within ~k B T). Lastly, we compare DFT calculations for other experimentally characterized peptoid sidechains, N(r/s)sb, N(r/s)tbe, and N(r/s)npe. In this analysis, we show that peptoid sidechains determined to be more robust experimentally (tbe and npe) have helical preferences opposite the trend seen in less robust assemblies formed by N(r/s)pe and N(r/s)sb chemistries. Furthermore, the more robust tbe and nnpe favor the (S)-enantiomer to right-handed and the (R)-enantiomers to left-handed helices.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2023

Multi-Neutrino Entanglement and Correlations in Dense Neutrino Systems

The time-evolution of multi-neutrino entanglement and correlations are studied in two-flavor collective neutrino oscillations, relevant for dense neutrino environments, building upon previous works. Specifically, simulations performed of systems with up to 12 neutrinos using Quantinuum’s H1-1 20 qubit trapped-ion quantum computer are used to compute n-tangles, and two- and three- body correlations, probing beyond mean-field descriptions. n-tangle re-scalings are found to converge for large system sizes, signaling the presence of genuine multi-neutrino entanglement.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2022

Quantum Machine Learning Applications in High-Energy Physics

Some of the most significant achievements of the modern era of particle physics, such as the discovery of the Higgs boson, have been made possible by the tremendous effort in building and operating large-scale experiments like the Large Hadron Collider or the Tevatron. In these facilities, the ultimate theory to describe matter at the most fundamental level is constantly probed and verified. These experiments often produce large amounts of data that require storing, processing, and analysis techniques that continually push the limits of traditional information processing schemes. Thus, the High-Energy Physics (HEP) field has benefited from advancements in information processing and the development of algorithms and tools for large datasets. More recently, quantum computing applications have been investigated to understand how the community can benefit from the advantages of quantum information science. Nonetheless, to unleash the full potential of quantum computing, there is a need to understand the quantum behavior and, thus, scale up current algorithms beyond what can be simulated in classical processors. In this work, we explore potential applications of quantum machine learning to data analysis tasks in HEP and how to overcome the limitations of algorithms targeted for Noisy Intermediate-Scale Quantum (NISQ) devices.

Delgado, Andrea↗

DOE OSTI2021

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

JAQAL Exemplars Highlight Slide

Simulated previous quantum chemistry experiments using JAQAL (Just Another Quantum Assembly Language), matching expected results. Lays the groundwork for QSCOUT (Quantum Scientific Computing Open User Testbed) users to conduct their own quantum experiments, and tests the capabilities of the JAQAL language.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors

The study of fermionic quantum field theories is an important problem for realizing the standard model of particle physics on a quantum computer. As a step towards this goal, we consider the massive Thirring and Gross--Neveu models with arbitrary number of fermion flavors, $N_f$, discretized on a spatial one-dimensional lattice of size $L$ in the Hamiltonian formulation. We compute the gate complexity using the higher-order product formula and using block-encoding/qubitization and quantum singular value transformations in the limit of large $N_f$ and $L$. We also prepare the ground states of both models with excellent fidelity for system sizes up to 20 qubits with $N_f = 1,2,3,4$ using the adaptive-variational quantum imaginary time algorithm. In addition, we also classify the dynamical Lie algebras of these relativistic fermionic models and show that they belong to the same isomorphism class. Our work is a concrete step towards the quantum simulation of real-time dynamics of large $N_f$ fermionic quantum field theories models relevant for chiral symmetry breaking, understanding dimensional transmutation, and exploring the conformal window of field theories on near-term and early fault-tolerant quantum computers.

FOS: Physical sciences↗

DOE OSTI2025

Beyond real: alternative unitary cluster Jastrow models for molecular electronic structure calculations on near-term quantum computers

Near-term quantum devices require wavefunction ansätze that are expressive while also of shallow circuit depth in order to both accurately and efficiently simulate molecular electronic structure. While the unitary coupled cluster ansatz (e.g., UCCSD) has become a standard, the high gate count associated with the implementation of this limits its feasibility on noisy intermediate-scale quantum (NISQ) hardware. k -Fold unitary cluster Jastrow (uCJ) ansätze mitigate this challenge by providing O( kN 2 ) circuit scaling and favorable linear depth circuit implementation. Previous work has focused on the real orbitalrotation (Re-uCJ) variant of uCJ, which allows an exact (Trotter-free) implementation. Here we extend and generalize the k -fold uCJ framework by introducing two new variants, Im-uCJ and g-uCJ, which incorporate imaginary and fully complex orbital rotation operators, respectively. Similar to Re-uCJ, both of the new variants achieve quadratic gate-count scaling. Our results focus on the simplest k = 1 model, and show that the uCJ models frequently maintain energy errors within chemical accuracy (∼1 kcal mol −1 ). Both g-uCJ and Im-uCJ are more expressive in terms of capturing electron correlation and are also more accurate than the earlier Re-uCJ ansatz. We further show that Im-uCJ and g-uCJ circuits can also be implemented exactly, without any Trotter decomposition. Numerical tests using k = 1 on H 2 , H 3 + , Be 2 , C 2 H 4 , C 2 H 6 and C 6 H 6 in various basis sets confirm the practical feasibility of these shallow Jastrow-based ansätze for applications on near-term quantum hardware.

Tkachenko, Nikolay V. [University of California, B↗

DOE OSTI2024

Variational Quantum Algorithms for Semidefinite Programming

A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum algorithms for approximately solving SDPs. For one class of SDPs, we provide a rigorous analysis of their convergence to approximate locally optimal solutions, under the assumption that they are weakly constrained (i.e., N$\gg$M, where N is the dimension of the input matrices and M is the number of constraints). We also provide algorithms for a more general class of SDPs that requires fewer assumptions. Finally, we numerically simulate our quantum algorithms for applications such as MaxCut, and the results of these simulations provide evidence that convergence still occurs in noisy settings.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Integrating quantum computing resources into scientific HPC ecosystems

Quantum Computing (QC) offers significant potential to enhance scientific discovery in fields such as quantum chemistry, optimization, and artificial intelligence. Yet QC faces challenges due to the noisy intermediate-scale quantum era’s inherent external noise issues. Here, this paper discusses the integration of QC as a computational accelerator within classical scientific high-performance computing (HPC) systems. By leveraging a broad spectrum of simulators and hardware technologies, we propose a hardware-agnostic framework for augmenting classical HPC with QC capabilities. Drawing on the HPC expertise of the Oak Ridge National Laboratory (ORNL) and the HPC lifecycle management of the Department of Energy (DOE), our approach focuses on the strategic incorporation of QC capabilities and acceleration into existing scientific HPC workflows. This includes detailed analyses, benchmarks, and code optimization driven by the needs of the DOE and ORNL missions. Our comprehensive framework integrates hardware, software, workflows, and user interfaces to foster a synergistic environment for quantum and classical computing research. This paper outlines plans to unlock new computational possibilities, driving forward scientific inquiry and innovation in a wide array of research domains.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2025

Polariton spectra under the collective coupling regime. II. 2D non-linear spectra

In our previous work [Mondal et al., J. Chem. Phys. 162, 014114 (2025)], we developed several efficient computational approaches to simulate exciton–polariton dynamics described by the Holstein–Tavis–Cummings (HTC) Hamiltonian under the collective coupling regime. Here, we incorporated these strategies into the previously developed Lindblad-partially linearized density matrix (⁠$\mathscr{L}$-PLDM) approach for simulating 2D electronic spectroscopy (2DES) of exciton–polariton under the collective coupling regime. In particular, we apply the efficient quantum dynamics propagation scheme developed in Paper I to both the forward and the backward propagations in the PLDM and develop an efficient importance sampling scheme and graphics processing unit vectorization scheme that allow us to reduce the computational costs from $\mathscr{O}$($\mathscr{K}$ 2 )$\mathscr{O}$(T 3 ) to $\mathscr{O}$($\mathscr{K}$)$\mathscr{O}$(T 0 ) for the 2DES simulation, where $\mathscr{K}$ is the number of states and T is the number of time steps of propagation. As a result, we further simulated the 2DES for an HTC Hamiltonian under the collective coupling regime and analyzed the signal from both rephasing and non-rephasing contributions of the ground state bleaching, excited state emission, and stimulated emission pathways.

2D non-linear spectra↗