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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
NASA NTRS2002

Atomistic Modeling of Semiconductors: Si, C, and 3C-SiC

An ongoing task of the Computational Materials Group (CMG) at the NASA Glenn Research Center is to enhance the role of atomistic simulations based on quantum-approximate methods in the study of new materials and their properties. One of the main goals of the activity continues to be breaching limitations that arise from the natural balance between accuracy, range of application, and computational simplicity. Whether that balance can be maintained while breaking new ground depends on the methods available with a minimum of constraints and limitations for the study of the energetics of arbitrary systems. The main tool used in CMG research, the Bozzolo- Ferrante-Smith (BFS) method for alloys, has no inherent constraint in its formulation, a feature that has allowed for successful research on various topics. In this article, we report on the latest development of the CMG program, namely, the extension and application of the BFS method to compound semiconductors, a departure from our previous research based primarily on metallic alloys.

Bozzolo, Guillermo↗
NASA NTRS2003

Energetics of Single Substitutional Impurities in NiTi

Shape-memory alloys are of considerable current interest, with applications ranging from stents to Mars rover components. In this work, we present results on the energetics of single substitutional impurities in B2 NiTi. Specifically, energies of Pd, Pt, Zr and Hf impurities at both Ni and Ti sites are computed. All energies are computed using the CASTEP ab initio code, and, for comparison, using the quantum approximate energy method of Bozzolo, Ferrante and Smith. Atomistic relaxation in the vicinity of the impurities is investigated via quantum approximate Monte Carlo simulation, and in cases where the relaxation is found to be important, the resulting relaxations are applied to the ab initio calculations. We compare our results with available experimental work.

Good, Brian S.↗
DOE OSTI2024

Two-dimensional coherent spectrum of high-spin models via a quantum computing approach

Here in this work we present and benchmark a quantum computing approach to calculate the two-dimensional coherent spectrum (2DCS) of high-spin models. Our approach is based on simulating their real-time dynamics in the presence of several magnetic field pulses, which are spaced in time. We utilize the adaptive variational quantum dynamics simulation algorithm for the study due to its compact circuits, which enables simulations over sufficiently long times to achieve the required resolution in frequency space. Specifically, we consider an antiferromagnetic quantum spin model that incorporates Dzyaloshinskii-Moriya interactions and single-ion anisotropy. The obtained 2DCS spectra exhibit distinct peaks at multiples of the magnon frequency, arising from transitions between different eigenstates of the unperturbed Hamiltonian. By comparing the one-dimensional coherent spectrum with 2DCS, we demonstrate that 2DCS provides a higher resolution of the energy spectrum. We further investigate how the quantum resources scale with the magnitude of the spin using two different binary encodings of the high-spin operators: the standard binary encoding and the Gray code. At low magnetic fields both encodings require comparable quantum resources, but at larger field strengths the Gray code is advantageous. Numerical simulations for spin models with increasing number of sites indicate a polynomial system-size scaling for quantum resources. Lastly, we compare the numerical 2DCS with experimental results on a rare-earth orthoferrite system. The observed strength of the magnonic high-harmonic generation signals in the 2DCS of the quantum high-spin model aligns well with the experimental data, showing significant improvement over the corresponding mean-field results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2016

Applying Simulated Annealing to Problems in Model-Based Diagnosis

Generating all diagnoses is computationally intractable. Therefore, many of the state-of-the-art approaches are incomplete. Quantum computers may however offer a solution. The first commercially available quantum computer is being used to minimize polynomials that are difficult for classical simulated annealing but easy for quantum annealing. All problems in Model-based Diagnosis (MBD) can be transformed into a polynomial minimization problem, allowing one to apply a quantum algorithm called quantum annealing to solve MBD problems. To better understand the need for this quantum approach, we designed two simulated annealingdiagnostic algorithms tailored to run on a polynomial representation of MBD. These algorithms differ on their policy for random neighborhood variable selection. In addition, enhanced metrics were devised to provide more diagnostic coverage. Finally, these two simulated annealing algorithms were analyzed and empirically evaluated and compared against state-of-the-art probabilistic methods for MBD such as SAFARI using ISCAS-85.

Simulated annealing↗
NASA NTRS2019

Simulation of Non-Markovian Dynamics on IBM QX

Currently available quantum computers allow us to run proof of principle algorithms that are unitary in their nature. Therefore, this architecture is unoptimized for simulation of an open quantum system. Here we present a method that helps us to overcome unitarity. We show how to run a non-Markovian evolution of a qubit system. We discuss all the discrepancies from theoretical predictions.

Wudarski, Filip A.↗
DOE OSTI2025

Does provable absence of barren plateaus imply classical simulability?

A large amount of effort has recently been put into understanding the barren plateau phenomenon. In this perspective article, we face the increasingly loud elephant in the room and ask a question that has been hinted at by many but not explicitly addressed: Can the structure that allows one to avoid barren plateaus also be leveraged to efficiently simulate the loss classically? We collect evidence-on a case-by-case basis-that many commonly used models whose loss landscapes avoid barren plateaus can also admit classical simulation, provided that one can collect some classical data from quantum devices during an initial data acquisition phase. This follows from the observation that barren plateaus result from a curse of dimensionality, and that current approaches for solving them end up encoding the problem into some small, classically simulable, subspaces. Thus, while stressing that quantum computers can be essential for collecting data, our analysis sheds doubt on the information processing capabilities of many parametrized quantum circuits with provably barren plateau-free landscapes. We end by discussing the (many) caveats in our arguments including the limitations of average case arguments, the role of smart initializations, models that fall outside our assumptions, the potential for provably superpolynomial advantages and the possibility that, once larger devices become available, parametrized quantum circuits could heuristically outperform our analytic expectations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Diabatization with Electrostatic Embedding for Studying Photophysics in Organic Molecular Crystals

Highly emissive organic molecular crystals find applications in several areas, such as organic electronics, solar cells, and sensors. Understanding the excited-state mechanisms underlying these applications is essential for optimizing and controlling them effectively. Exciton models coupled with nonadiabatic dynamics, particularly quantum dynamics, provide crucial insights into photochemical and photophysical processes in molecular crystals. Nevertheless, there remains a lack of general tools and automated workflows to facilitate such simulations. In this paper, we present a computational strategy to investigate the photoactivated dynamics of organic molecular crystals, bridging methodologies traditionally used for molecular systems and materials science, with a particular focus on the interplay between local excitations and charge transfer (CT) processes. We have implemented an interface between the fromage and Overdia programs, enabling the construction of vibronic Hamiltonians for molecular crystals within an excited-state ONIOM(QM:QM′) framework, incorporating long-range electrostatics through a RESP-based Ewald summation. Fragment-based diabatization provides a route to quantum dynamics simulations in weak-to-intermediate coupling regimes. The method was applied to the photophysics of dibenzo[g,p]chrysene (DBC) crystals using time-dependent DFT. The fromage/ Overdia interface was employed to compute the couplings of local excitations and CT states for 18 unique DBC dimers in the crystal and to quantify the influence of electrostatic embedding, which was found to be modest (10−20%). Simulations on π-stacked dimers reproduced the small red shift observed experimentally from solution to crystal, attributed to electronic interactions among fixed monomers rather than crystal electrostatics. Quantum dynamics simulations revealed ultrafast population transfer from bright local excitations to CT states. This approach establishes a robust framework linking molecular and solid-state excited-state dynamics, with potential applications for studying excitations, defects, and impurities in molecular crystals.

Crystals↗
DOE OSTI2025

Advancing Quantum Many-Body GW Calculations on Exascale Supercomputing Platforms

Advanced ab initio materials simulations face growing challenges as increasing systems and phenomena complexity requires higher accuracy, driving up computational demands. Quantum many-body GW methods are state-of-the-art for treating electronic excited states and couplings but often hindered due to the costly numerical complexity. Here, we present innovative implementations of advanced GW methods within the BerkeleyGW package, enabling large-scale simulations on Frontier and Aurora exascale platforms. Our approach demonstrates exceptional versatility for complex heterogeneous systems with up to 17,574 atoms, along with achieving true performance portability across GPU architectures. We demonstrate excellent strong and weak scaling to thousands of nodes, reaching double-precision core-kernel performance of 1.069 ExaFLOP/s on Frontier (9,408 nodes) and 707.52 PetaFLOP/s on Aurora (9,600 nodes), corresponding to 59.45% and 48.79% of peak, respectively. Our work demonstrates a breakthrough in utilizing exascale computing for quantum materials simulations, delivering unprecedented predictive capabilities for rational designs of future quantum technologies.

Zhang, Benran [University of Southern California, ↗
DOE OSTI2024

Spinbox: tools for many-body quantum systems in a Monte Carlo context

Spinbox is a piece of software that facilitates quantum mechanical calculations relevant to Monte Carlo simulation of atomic nuclei. At the front lines of research on the nuclear many-body problem are a large number of supercomputer-scale simulation codes. These codes produce valuable results but can be hard to understand, especially for those without intimate knowledge of the relevant theoretical methods. Thus, tools that fill pedagogical roles are extremely valuable. Spinbox makes it easy for one to replicate and analyze the computational processes relevant to a Quantum Monte Carlo (QMC) simulation that may be difficult to understand/debug/analyze due to the scale of the corresponding simulation software. Spinbox is written in Python using other state-of-the-art Python modules for numerical calculations. While a number of Python libraries exist that are suited to general quantum many-body calculations, the motivation of Spinbox is quite particular. In Diffusion Monte Carlo methods (DMC, GFMC, AFDMC), the central calculation is the imaginary-time propagation of individual samples of the many-body wavefunction. Although quantum wavefunctions generally must be described by a probability distribution over a basis, DMC imbues particles (within one sample) with classical spatial coordinates. This method is unusual, so other Python packages are typically not set up to do this easily. Furthermore, the software has built-in options for nuclear systems assuming isospin symmetry, which can be set up with other libraries but is a nontrivial process to do so. Features: - numerical representation of samples of the many-body wavefunctions, including tensor-product states (used in AFDMC) - numerical representation of many-body operators, including tensor-product operators: general, spin, imaginary-time propagation, etc. - the correct associated arithmetic and algebra, implemented as class methods - classes for representing realistic nuclear two- and three-body Hamiltonians (e.g. Argonne V18, Illinois NNN) - large-scale parallel integration over random variables, crucial for the AFDMC method My goal is to make this package open source so that anyone may use it and contribute to it, particularly other researchers doing AFDMC calculations

Fox, Jordan↗
NASA NTRS1999

Fast Quantum Algorithm for Predicting Descriptive Statistics of Stochastic Processes

Stochastic processes are used as a modeling tool in several sub-fields of physics, biology, and finance. Analytic understanding of the long term behavior of such processes is only tractable for very simple types of stochastic processes such as Markovian processes. However, in real world applications more complex stochastic processes often arise. In physics, the complicating factor might be nonlinearities; in biology it might be memory effects; and in finance is might be the non-random intentional behavior of participants in a market. In the absence of analytic insight, one is forced to understand these more complex stochastic processes via numerical simulation techniques. In this paper we present a quantum algorithm for performing such simulations. In particular, we show how a quantum algorithm can predict arbitrary descriptive statistics (moments) of N-step stochastic processes in just O(square root of N) time. That is, the quantum complexity is the square root of the classical complexity for performing such simulations. This is a significant speedup in comparison to the current state of the art.

Williams Colin P.↗
DOE OSTI2024

Quantum-centric supercomputing for materials science: A perspective on challenges and future directions

Computational models are an essential tool for the design, characterization, and discovery of novel materials. Computationally hard tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their resources for simulation, analysis, and data processing. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. Here in this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Melting curves of atomic hydrogen and deuterium calculated using path-integral Monte Carlo

We calculate the melting line of atomic hydrogen and deuterium up to 900 GPa with path-integral Monte Carlo using a machine-learned interatomic potential. We improve upon previous simulations of melting by treating the electrons with reptation quantum Monte Carlo, and by performing solid and liquid simulations using isothermal-isobaric path-integral Monte Carlo. Here, the resulting melting line for atomic hydrogen is higher than previous estimates. There is a small but resolvable decrease in the melting temperature as pressure is increased, which can be attributed to quantum effects.

08 HYDROGEN↗
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 OSTI2026

Characterizing thermal-induced temporal drift in deployed quantum fiber networks

We study temperature-induced fiber-delay drifts affecting entanglement fidelity in deployed quantum systems. Using field data and simulations, we model timing uncertainties and evaluate their impact on coincidence detection, revealing critical challenges for robust quantum networks.

Alshowkan, Muneer [ORNL] (ORCID:0000000264293450)↗
DOE OSTI2026

Quantum Routing and Entanglement Dynamics Through Bottlenecks

To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consider the entanglement dynamics and routing between two regions only connected through an intermediate “bottleneck” region with few qubits. In such systems, where the entanglement rate is restricted by a vertex boundary rather than an edge boundary of the underlying interaction graph, existing results such as the small incremental entangling theorem give only a trivial constant lower bound on the routing time (the minimum time to perform an arbitrary permutation). We significantly improve the lower bound on the routing time in systems with a vertex bottleneck. Specifically, for any system with two regions 𝐿,𝑅 with 𝑁 𝐿 ,𝑁 𝑅 qubits, respectively, coupled only through an intermediate region 𝐶 with 𝑁 𝐶 qubits, for any 𝛿 > 0 we show a lower bound of Ω⁢(𝑁$^{1−𝛿}_{𝑅}$/√𝑁 𝐿⁢ 𝑁 𝐶 ) on the Hamiltonian quantum routing time when using piecewise time-independent Hamiltonians, or time-dependent Hamiltonians subject to a smoothness condition. We also prove an upper bound on the average amount of bipartite entanglement between 𝐿 and 𝐶,𝑅 that can be generated in time 𝑡 by such architecture-respecting Hamiltonians in systems constrained by vertex bottlenecks, improving the scaling in the system size from 𝑂⁡(𝑁 𝐿⁢ 𝑡) to 𝑂⁡(√𝑁 𝐿⁢ 𝑡). As a special case, when applied to the star graph (i.e., one vertex connected to 𝑁 leaves), we obtain an Ω⁡(√𝑁 1−𝛿 ) lower bound on the routing time and on the time to prepare 𝑁/2 Bell pairs between the vertices. We also show that, in systems of free particles, we can route optimally on the star graph in time Θ⁡(√𝑁) using Hamiltonian quantum routing, obtaining a speedup over gate-based routing, which takes time Θ⁡(𝑁).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Quantum AI Based Enhanced Detection of Dementia

Quantum computing has the potential to significantly improve the early detection of Alzheimer's Disease and Related Dementias (ADRD). Quantum-enhanced machine learning can be used to perform an early screening of Alzheimer's disease using brain imaging data based on dataset of MRI scans from both healthy individuals and those diagnosed with Alzheimer's. This study aims to demonstrate the potential of quantum transfer learning to enhance the performance of the classical deep learning model for dementia detection. Using the MRI sagittal images available in the OASIS-2 (64 demented and 72 non-demented subjects between 60 and 96 years), we show how quantum techniques can transform a suboptimal classical model into a more effective solution for dementia detection, highlighting their potential impact on advancing healthcare technology. We begin with a simple classical deep learning model with a significantly smaller number of parameters, which gives suboptimal performance on the problem. Then, we apply different configurations of quantum transfer learning based on the pre-trained weak classifier (Figure 1). We fix the weak classifier's initial convolutional layers at their fixed pre-trained parameters and replace the last set of dense layers with a dressed quantum circuit (DQN), which we train to enhance performance. We performed 4-fold cross-validation for both the classical and the hybrid quantum models and trained them using Pennylane's `default.qubit' simulator and IonQ's Aria-1 simulator (noisy simulation). We showed that with significantly fewer parameters, the quantum transfer learning-based hybrid models showed significant performance enhancement over the base weak classical deep learning model for dementia detection. To classify between a demented and non-demented subject, the accuracy of quantum-based AI methods improved by 6 to 14% compared to classical methods. The sensitivity of the models improved by 4 to 17%. This shows that there are fewer chances of misclassifying demented patients. Figure 2 compares the performance of the hybrid quantum models and their base classical model, and Table 1 summarizes the results. We illustrated that with assistance from quantum machine learning, it is possible to enhance detection for dementia based on brain images. This shows the potential for practical utility of quantum computing in ADRD research.

Bhowmik, Sounak [University of Tennessee, Knoxvill↗
NASA NTRSDate not supplied

Surrogate Optimization for Quantum Circuits

Variational quantum Eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has yet to be realized with few claims of quantum advantage and high resource estimates mainly due to the need for optimization in the presence of noise. Finding algorithms and methods to improve the convergence is essential to accelerate the capabilities of near-term hardware for VQE or more broad applications of hybrid methods in which optimization is required. To this goal we look to use modern approaches recently developed in circuit simulations and stochastic classical optimization that can be combined in a surrogate optimization approach to classical circuits. Using an approximate state vector simulator, we efficiently calculate an approximate Hessian, fed as an input for a detailed quantum circuit simulator. We demonstrate the capabilities of such an approach with and without sampling noise. We also show that this method outperforms Powell in the presence of quantum circuit shot noise by a factor of 2-4

quantum computing↗
DOE OSTI2024

Dynamics of qudit gates and effects of spectator modes on optimal control pulses

Qudit gates for high-dimensional quantum computing can be synthesized with high precision using numerical quantum optimal control techniques. Large circuits are broken down into modules and the tailored pulses for each module can be used as primitives for a qudit compiler. Application of the pulses of each module in the presence of extra modes may decrease their effectiveness due to crosstalk. In this paper, we address this problem by simulating qudit dynamics for circuit quantum electrodynamics systems. As a test case, we take pulses for single-qudit swap gates optimized in isolation and then apply them in the presence of spectator modes each of which are in Fock states. We provide an experimentally relevant scaling formula that can be used as a bound on the fidelity decay. Our results show that frequency shift from spectator mode populations has to be ≲ 0.1 % of the qudit's nonlinearity in order for high-fidelity single-qudit gates to be useful in the presence of occupied spectator modes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗