Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum 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 595 records · Page 33
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Thermal exchange-correlation functionals: Capturing quantum electron behavior in warm, dense plasmas

We summarize and give perspective upon recent progress in developing non-empirical constraint-based thermal (i.e., free energy) exchange-correlation (XC) density functionals essential for accurate description of the quantum behavior of electrons in warm, dense plasmas. After delineating the critical role of ground-state functionals for zero-temperature, time-dependent DFT, we outline the underpinnings of local density approximation, generalized gradient approximation (GGA), and meta-GGA XC free-energy functionals. Two basic thermalization principles for upgrading ground-state XC functionals to successful thermal ones are emphasized. Then, we turn to a long-standing challenge, assessment of the accuracy of well-founded functionals. Unlike the ground state, there are a few exact results for large T and P. An exception is path integral Monte Carlo (PIMC) data for dense H/D and He plasmas. For those, we did ab initio molecular dynamics simulations under selected thermodynamic conditions employing five thermal XC functionals: two approximate thermal GGAs, fully thermal GGA, an approximate meta-GGA, and fully thermal meta-GGA. Comparisons with the PIMC data show that functionals thermalized by augmenting a non-thermal functional with a lower-level thermal contribution are inferior to functionals with thermal XC and spatial inhomogeneity effects taken into account at the same level of refinement. We believe this and similar evidence should be convincing to the high-energy density physics community of the necessity of use of proper thermal XC functionals in simulation studies of finite-temperature quantum effects in warm, dense plasmas.

Ab-initio molecular dynamics↗
DOE OSTI2026

Spin Polarization from Circularly Polarized Light Induced Charge Transfer

Here, we show how a spin polarization can be generated through the photoinduced electron transfer of an achiral donor–acceptor complex following chiral light excitation. In particular, we illustrate the basic energetic and symmetry requirements for chirality induced spin selectivity where the chirality emerges from the electronic degrees of freedom following excitation with circularly polarized light. We study this effect in a simple model of a metalloporphyrin complex with an axial acceptor ligand using quantum mechanical rate theories and numerical simulations. We find that the spin polarization emerges due to the selective excitation of a ring current within the porphryin, breaking the degeneracy of the two degenerate spin states. The resultant spin polarization increases with the spin orbit coupling between the metal in the porphyrin and the axial ligand, and is transient, with a lifetime dependent on the rate of dephasing from the Jahn–Teller distortion mode. This proposed effect should be observable in spin-resolved photoemission spectroscopy.

charge transfer↗
DOE OSTI2025

Optimizing temperature distributions for training neural quantum states using parallel tempering

Parametrized artificial neural networks (ANNs) can be very expressive ansatzes for variational algorithms, reaching state-of-the-art energies on many quantum many-body Hamiltonians. Nevertheless, the training of the ANN can be slow and stymied by the presence of local minima in the parameter landscape. One approach to mitigate this issue is to use parallel tempering methods, and in this work, we focus on the role played by the temperature distribution of the parallel tempering replicas. Using an adaptive method that adjusts the temperatures in order to equate the exchange probability between neighboring replicas, we show that this temperature optimization can significantly increase the success rate of the variational algorithm with negligible computational cost by eliminating bottlenecks in the replicas' random walk. Furthermore, we demonstrate this using two different neural networks, a restricted Boltzmann machine and a feedforward network, which we use to study a toy problem based on a permutation invariant Hamiltonian with a pernicious local minimum and the 𝐽 1 −𝐽 2 model on a rectangular lattice.

Neural network simulations↗
DOE OSTI2025

Variational quantum and neural quantum states algorithms for the linear complementarity problem

Variational quantum algorithms (VQAs) are promising hybrid quantum-classical methods designed to leverage the computational advantages of quantum computing while mitigating the limitations of current noisy intermediate-scale quantum (NISQ) hardware. Although VQAs have been demonstrated as proofs of concept, their practical utility in solving real-world problems—and whether quantum-inspired classical algorithms can match their performance—remains an open question. We present a novel application of the variational quantum linear solver (VQLS) and its classical neural quantum states-based counterpart, the variational neural linear solver (VNLS), as key components within a minimum map Newton solver for a complementarity-based rigid-body contact model. We demonstrate using the VNLS that our solver accurately simulates the dynamics of rigid spherical bodies during collision events. These results suggest that quantum and quantum-inspired linear algebra algorithms can serve as viable alternatives to standard linear algebra solvers for modelling certain physical systems.

neural quantum states↗
DOE OSTI2025

A Review of Quantum Computing Technologies in Power System Optimization

As modern power grids increasingly integrate variable renewable generation, distributed energy resources, and energy storage systems, classical optimization techniques are facing unprecedented challenges. This review examines the emerging application of quantum computing to overcome these challenges in power system optimization, including optimal power flow (OPF), unit commitment (UC), economic dispatch (ED), and intelligent switching and topology optimization (IS-TO). Recent research has introduced various quantum methodologies—such as gate-based, annealing-based, variational algorithms, and quantum-inspired algorithms—to address the combinatorial complexity inherent in grid reconfiguration and energy management. The review summaries the quantum algorithms, quantum devices and the power system test cases, highlighting hybrid quantum–classical strategies that leverage the complementary strengths of both paradigms. Some quantum advantages have been observed, including theoretical speedup, accurate simulation results, scalable qubit usage, efficient QUBO mapping. In particular, the review emphasizes the importance of integrating quantum optimization techniques with classical control frameworks, these hybrid approaches demonstrate the potential to improve real-time grid management and operational reliability. A significant portion of the analysis is devoted to the practical limitations of current quantum devices. Present-day quantum hardware, operating in the noisy intermediate-scale quantum (NISQ) era, remains highly sensitive to noise and limited in qubit connectivity, which constrains the scale and accuracy of implemented algorithms. The review delves into specific challenges such as the need for qubit-efficient encoding techniques and error mitigation strategies that are critical for handling real-world grid optimization problems. In addition, the work draws attention to the performance discrepancies between theoretical quantum speedups and experimental validations, underscoring the importance of rigorous benchmark studies using representative power grid test cases. In summary, this review highlights both the promise and limitations of quantum computing for power system optimization. It provides a comprehensive overview of the state-of-the-art technologies, categorizes recent advancements in algorithm design, and discusses practical considerations for implementation, and serves as an informative resource on current research. Future research directions include developing robust hybrid frameworks, advancing qubit-efficient formulations, and scaling up experimental demonstrations to confirm the theoretical advantages of quantum methods in large-scale power system operations.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Sachdev-Ye-Kitaev model on a noisy quantum computer

Here we study the SYK model -- an important toy model for quantum gravity on IBM's superconducting qubit quantum computers. By using a graph-coloring algorithm to minimize the number of commuting clusters of terms in the qubitized Hamiltonian, we find the gate complexity of the time evolution using the first-order product formula for N Majorana fermions is $\mathscr{O}$(N 5 J 2 t 2 /ε) where J is the dimensionful coupling parameter, t is the evolution time, and ε is the desired precision. With this improved resource requirement, we perform the time evolution for N=6,8 with maximum two-qubit circuit depth of 343. We perform different error mitigation schemes on the noisy hardware results and find good agreement with the exact diagonalization results on classical computers and noiseless simulators. In particular, we compute return probability after time t and out-of-time order correlators (OTOC) which is a standard observable of quantifying the chaotic nature of quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

A Comprehensive Comparative Study of Active Learning Schemes for Nanophotonics Design

We present a benchmarking study of active learning (AL) schemes for designing planar multilayer nanophotonic metamaterials, where the design tasks are formulated as binary optimization problems. Different surrogate models, including factorization machine (FM), Gaussian process regression (GPR), and convolutional neural network (CNN), combined with different optimization methods, including exhaustive enumeration, discrete particle swarm optimization (DPSO), quantum annealing (QA), hybrid QA, and simulated annealing are studied. The benchmark cases investigated range from small problems with short binary lengths (N = 25) to large problems with N up to 100, focusing on the design of two classes of photonic structures, including antireflective coatings for the long-wavelength infrared region and transparent radiative coolers. For small problems, CNN coupled with DPSO in AL achieves the best performance. As N increases, FM with QA outperforms GPR and CNN. For FM-based AL, hybrid QA yields the best optimization results, particularly in high-dimensional cases (N = 100). These results demonstrate that the optimization method can significantly affect in AL performance as N increases, and that QA-based optimization can provide practical routes for mitigating the optimization bottleneck in high-dimensional problems.

Jung, Serang [Kyung Hee University, Korea]↗
DOE OSTI2026

Characterizing Defect Dynamics in Silicon Carbide Using Symmetry-Adapted Collective Variables and Machine Learning Interatomic Potentials

Silicon carbide (SiC) divacancies are attractive candidates for spin-defect qubits possessing long coherence times and optical addressability. The high activation barriers associated with SiC defect formation and motion pose challenges for their study by first-principles molecular dynamics. In this work, we develop and deploy machine learning interatomic potentials (MLIPs) to accelerate defect dynamics simulations while retaining ab initio accuracy. We employ an active learning strategy comprising symmetry-adapted collective variable discovery and enhanced sampling to compile configurationally diverse training data, calculation of energies and forces using density functional theory (DFT), and training of an E(3)-equivariant MLIP based on the Allegro model. Here, the trained MLIP reproduces DFT-level accuracy in defect transition activation free energy barriers, enables the efficient and stable simulation of multidefect 216-atom supercells, and permits an analysis of the temperature dependence of defect thermodynamic stability and formation/annihilation kinetics to propose an optimal annealing temperature to maximally stabilize VV divacancies.

Computer simulations↗
DOE OSTI2025

Theoretical Investigations of Anharmonic Effects and Phonon Transport in the Cubic Phase of Crystalline Perovskite CsPbCl 3

The role of anharmonic effects on lattice dynamics and thermal transport has been investigated in the cubic phase of the CsPbCl 3 perovskite. Limitations of the harmonic approximation, which lead to phonon instabilities in the Brillouin zone, were addressed based on self-consistent phonon theory in combination with first-principles calculations and by incorporation of frequency renormalization effects from bubble and loop diagrams. This theoretical approach demonstrates significant improvements compared to results obtained using a self-consistent phonon dynamic matrix. Both the cubic-to-tetragonal phase transition temperature as well as the predicted lattice thermal conductivity values show good agreement with selected sets of available experimental data. In conclusion, the accuracy of the predicted thermal conductivity data is also tested against systems significantly larger than those allowed by quantum calculations, by using molecular dynamic simulations with machine-learning force fields.

Lattices↗
DOE OSTI2025

Ammonolysis Under NH 3 –Limiting Conditions as a Pathway to Improved LaTiO 2 N Water Splitting Photoanodes

LaTiO 2 N is a promising intermediate band gap semiconductor for the water splitting reaction, a pathway to hydrogen fuel from solar energy. However, the photoelectrochemical (PEC) activity of the material is hindered by defects, particularly Ti(III) species, which promote photocarrier recombination. These defects are formed during the high-temperature ammonolysis reaction. Here we show that improved LaTiO 2 N materials can be synthesized under NH 3 -limiting conditions by introducing N 2 to lower the NH 3 partial pressure to0.13atm.This reduces the Ti(III) defect density in the material from 6.06 × 10 16 to ∼4.61 × 10 15 cm −3 , by a factor of 13, based on electron paramagnetic resonance (EPR) spectroscopy. Any remaining Ti(III) defects are localized at the LaTiO 2 N surface, according to X-ray photoelectron spectroscopy (XPS), due to the formation of a depletion layer in the semico. Optical absorption spectra of the improved LaTiO 2 N reveal a blue-shifted band gap absorption edge and a suppressed sub-band gap absorption. Defect removal also reduces a sub-band gap surface photovoltage feature visible in the 1.0 atm reference material. The improved LaTiO 2 N supports a 1.57 mA cm −2 water oxidation photocurrent at 1.23 V RHE under simulated sunlight conditions, and an enhanced quantum efficiency of 4.5% (400 nm) for photocatalytic oxygen evolution from aqueous silver nitrate solution. Stable PEC operation is observed for over 55 min. This confirms that ammonolysis under NH 3 -limiting conditions improves the solar energy conversion properties of LaTiO 2 N. The ability to control metal ion defects in oxynitrides by varying the ammonia partial pressure during ammonolysis might be generally useful for the preparation of metal nitrides and oxynitrides.

defects↗
DOE OSTI2025

Derivative-free stochastic optimization via adaptive sampling strategies

In this paper, we present a novel derivative-free framework for solving unconstrained stochastic optimization problems. Many problems in fields ranging from simulation optimization to reinforcement learning to quantum computing involve settings where only stochastic function values are obtained via a zeroth-order oracle, which has no available gradient information and necessitates the usage of derivative-free optimization methodologies. Our approach includes estimating gradients using stochastic function evaluations and integrating adaptive sampling techniques to control the accuracy in these stochastic approximations. Our framework encapsulates several gradient estimation techniques, including standard finite-difference, Gaussian smoothing, sphere smoothing, randomized coordinate finite-difference, and randomized subspace finite-difference methods. We provide theoretical convergence guarantees for our framework and analyze the worst-case iteration and sample complexities associated with each gradient estimation method. Finally, we demonstrate the empirical performance of the methods on logistic regression and nonlinear least squares problems.

Adaptive sampling↗
DOE OSTI2024

Digitization and subduction of S U ( N ) gauge theories

The simulation of lattice gauge theories on quantum computers necessitates digitizing gauge fields. One approach involves substituting the continuous gauge group with a discrete subgroup, but the implications of this approximation still need to be clarified. To gain insights, we investigate the subduction of S U ( 2 ) and S U ( 3 ) to discrete crystal-like subgroups. Using classical lattice calculations, we show that subduction offers valuable information based on subduced direct sums, helping us identify additional terms to incorporate into the lattice action that can mitigate the effects of digitization. Furthermore, we compute the static potentials of all irreducible representations of Σ ( 360 × 3 ) at a fixed lattice spacing. Our results reveal a percent-level agreement with the Casimir scaling of S U ( 3 ) for irreducible representations that subduce to a single Σ ( 360 × 3 ) irreducible representation. This provides a diagnostic measure of approximation quality, as some irreducible representations closely match the expected results while others exhibit significant deviations. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Quantum computation of mass gap in an asymptotically free theory

In relativistic field theories, the mass spectrum is given by the difference between the energy of the vacuum and the excited states. Near the continuum limit, the cancellation between these two values leads to loss of precision. We propose a method to extract the mass gap directly using quantum computers and apply it to a particular version of the nonlinear $σ$-model with the correct continuum limit and perform calculations in quantum hardware (at strong coupling) and simulation in classical computers (at weak coupling).

Bedaque, Paulo F. [Maryland U.] (ORCID:00000001521↗
DOE OSTI2025

Chemical applications of variational quantum eigenvalue-based quantum algorithms: Perspective and survey

Exploring many-body chemical systems on classical computers often involves solving the Schrödinger equation. However, this approach is frequently limited by the exponential increase in the dimensionality of the Hamiltonian as the number of degrees of freedom increases. In contrast, quantum computing, specifically through the variational quantum eigensolver (VQE) framework, shows promise in overcoming this exponential cost. VQE can utilize the collective properties of quantum states to model the wavefunction in polynomial time. Despite the current limitations of quantum hardware, significant advances have been made in the development of VQE-based algorithms. Here, in this review, we provide an overview of emerging protocols, focusing on their applications in simulating the ground state, excited state, and vibrational properties of chemical systems. By examining notable algorithmic advancements and applications, this review aims to shed light on the challenges and potential of VQE-based algorithms in addressing relevant chemical problems.

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

Scalable quantum computational science: A perspective from block-encodings and polynomial transformations

Significant developments made in quantum hardware and error correction recently have been driving quantum computing toward practical utility. However, gaps remain between abstract quantum algorithmic development and practical applications in computational sciences. In this perspective article, we propose several properties that scalable quantum computational science methods should possess. We further discuss how block-encodings and polynomial transformations can potentially serve as a unified framework with the desired properties. Recent advancements on these topics are presented, including the construction and assembly of block-encodings, and various generalizations of quantum signal processing (QSP) algorithms to perform polynomial transformations. The scalability of QSP methods on parallel and distributed quantum architectures is also highlighted. Promising applications in simulation and observable estimation in chemistry, physics, and optimization problems are presented. We hope this perspective serves as a gentle introduction to state-of-the-art quantum algorithms for the computational science community and inspires future development of scalable quantum computational science methodologies that bridge theory and practice.

Bayesian inference↗
DOE OSTI2025

A quantum eigenvalue solver based on tensor networks

Electronic ground states are of central importance in chemical simulations, but have remained beyond the reach of efficient classical algorithms except in cases of weak electron correlation or one-dimensional spatial geometry. We introduce a hybrid quantum-classical eigenvalue solver that constructs a wavefunction ansatz from a linear combination of matrix product states in rotated orbital bases, enabling the characterization of strongly correlated ground states with arbitrary spatial geometry. The energy is converged via a gradient-free generalized sweep algorithm based on quantum subspace diagonalization, with a potentially exponential speedup in the off-diagonal matrix element contractions upon translation into compact quantum circuits of linear depth in the number of qubits. Chemical accuracy is attained in numerical experiments for both a stretched water molecule and an octahedral arrangement of hydrogen atoms, achieving substantially better correlation energies compared to a unitary coupled-cluster benchmark, with orders of magnitude reductions in quantum resource estimates and a surprisingly high tolerance to shot noise. This proof-of-concept study suggests a promising new avenue for scaling up simulations of strongly correlated chemical systems on near-term quantum hardware.

chemistry↗
DOE OSTI2024

Atomic scale etching of diamond: insights from molecular dynamics simulations

Diamond is a promising material for multiple applications in quantum information processing and sensing as well as applications in microelectronics. However, diamond devices can be limited by surface defects that compromise charge stability and spin coherence, among others. Improved strategies in plasma etching of diamond could play an important role in minimizing or eliminating these defects. In this work, we explore plasma-assisted atomic scale etching of diamond using argon ions (Ar + ), hydrogen ions (H + ) and hydrogen atoms (H). We employ classical molecular dynamics (MD) simulations and test several interatomic potentials based on the Reactive Empirical Bond Order (REBO) form with comparisons to a variety of published experimental results. We performed MD simulations of low-energy hydrogen ($\leqslant$50 eV) and argon ( $\leqslant$200 eV) ion bombardment of diamond surfaces. Ar + bombardment can be used to locally smooth initially rough diamond surfaces via the formation of an amorphous C layer, the thickness of which increases with argon ion energy. Subsequent exposure with hydrogen ions (or fast neutrals) will selectively etch this amorphous C layer, leaving the underlying diamond layer mostly intact if the H energy is maintained below about 10 eV. The simulations suggest that combining Ar + smoothing with selective, near threshold energy H removal of amorphous C can be an effective strategy for diamond surface engineering, leading to more reliable and sensitive diamond color center devices.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2025

Quantum approximate multi-objective optimization

The goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. We demonstrate its performance on an IBM Quantum computer, as well as with matrix product state numerical simulation, and show its potential to outperform classical approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗