Search NASA⌕ Search

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.

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

At least 901 records · Page 50
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Practical Scalability of LuGo: Benchmarking the HHL Algorithm Using an Enhanced QPE Algorithm

The HHL algorithm is a prominent quantum algorithm that offers exponential speedup over its classical counterparts for solving a system of linear equations. However, synthesizing and executing HHL circuits demand significant computational resources from both classical and quantum systems. In this paper, we benchmark the HHL algorithm using the optimized Quantum Phase Estimation (QPE) generation algorithm, LuGo \cite{lu2025lugo}, to enhance its scalability and efficiency. We leverage the National Energy Research Scientific Computing Center's (NERSC) Perlmutter supercomputer to evaluate the scalability of generating HHL circuits and to measure the time to simulate the generated circuits. Additionally, we provide a comprehensive analysis of the algorithm's performance on various state-of-the-art superconducting and trapped-ion quantum devices, including studies on qubit connectivity, fidelity comparisons, and hardware compatibility and robustness. Our results offer preliminary insights into potential practical applications of the HHL algorithm enabled by LuGo and the performance of various types of quantum hardware.

Lu, Chao [ORNL] (ORCID:0000000179346933)↗
DOE OSTI2023

Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods

Quantum algorithms for simulating electronic ground states are slower than popular classical mean-field algorithms such as Hartree–Fock and density functional theory but offer higher accuracy. Accordingly, quantum computers have been predominantly regarded as competitors to only the most accurate and costly classical methods for treating electron correlation. However, here we tighten bounds showing that certain first-quantized quantum algorithms enable exact time evolution of electronic systems with exponentially less space and polynomially fewer operations in basis set size than conventional real-time time-dependent Hartree–Fock and density functional theory. Although the need to sample observables in the quantum algorithm reduces the speedup, we show that one can estimate all elements of the k-particle reduced density matrix with a number of samples scaling only polylogarithmically in basis set size. We also introduce a more efficient quantum algorithm for first-quantized mean-field state preparation that is likely cheaper than the cost of time evolution. We conclude that quantum speedup is most pronounced for finite-temperature simulations and suggest several practically important electron dynamics problems with potential quantum advantage.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Advances and challenges for experiment and theory for multi-electron multi-proton transfer at electrified solid–liquid interfaces

Multi-electron, multi-proton transfer is important in a wide spectrum of processes spanning biological, chemical and physical systems. These reactions have attracted significant interest due to both fundamental curiosity and potential applications in energy technology. In this Perspective Review, we shed light on modern aspects of electrode processes in the 21st century, in particular on the recent advances and challenges in multistep electron/proton transfers at solid–liquid interfaces. Ongoing developments of analytical techniques and operando spectrometry at electrode/electrolyte interfaces and reliable computational approaches to simulate complicated interfacial electrochemical reactions enable us to obtain microscopic insights about these complex processes, such as the role of quantum effects in electrochemical reactions. Our motivation in this Perspective Review is to provide a comprehensive survey and discussion of state-of-the-art developments in experiments, materials, and theories for modern electrode process science, as well as to present an outlook for the future directions in this field.

Sakaushi, Ken↗
DOE OSTI2022

Non-Kasha fluorescence of pyrene emerges from a dynamic equilibrium between excited states

Pyrene fluorescence after a high-energy electronic excitation exhibits a prominent band shoulder not present after excitation at low energies. The standard assignment of this shoulder as a non-Kasha emission from the second-excited state (S 2 ) has been recently questioned. To elucidate this issue, we simulated the fluorescence of pyrene using two different theoretical approaches based on vertical convolution and nonadiabatic dynamics with nuclear ensembles. To conduct the necessary nonadiabatic dynamics simulations with high-lying electronic states and deal with fluorescence timescales of about 100 ns of this large molecule, we developed new computational protocols. The results from both approaches confirm that the band shoulder is, in fact, due to S 2 emission. We show that the non-Kasha behavior is a dynamic-equilibrium effect not caused by a metastable S 2 minimum. However, it requires considerable vibrational energy, which can only be achieved in collisionless regimes after transitions into highly excited states. This strict condition explains why the S 2 emission was not observed in some experiments.

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

Discerning Influences from Enthalpy and Entropy at Aqueous Interfaces Involved in Biomass Conversions in Porous Catalysts

Project Summary: The goal in this proposal is to learn how solvent influences the enthalpies and entropies of catalytic species in zeolite pores. Specifically, the physical, chemical, and structural features of solvent, catalytic species, and zeolite pores that determine enthalpies and entropies of solvation in solution phase biomass conversions will be interrogated using multiscale simulations and machine learning. Multiscale simulations are based off of existing strategies and employ quantum mechanics and classical molecular dynamics, providing an excellent balance between chemical accuracy and computational expense. They are capable of calculating enthalpies and entropies of solvation separately and have been validated in prior work to achieve high accuracy compared to their parent methods.

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

Pulse control of superconducting cavity-based qudits with a Fock-state basis

Fock-basis-encoding qudits allow quantum gates to operate on multiple qudit levels simultaneously. This capability is advantageous for applications involving complex local gate operations, such as the digital quantum simulation of non-Abelian gauge theories. However, compiling unitary operations to native qudit gates remains a challenging task, often requiring substantial computational resources. In this work, we theoretically investigate the direct pulse control of a superconducting radio-frequency cavity coupled to an ancilla transmon for gate synthesis. We will discuss the improvements and limitations applicable to high Fock states. This work paves the way toward more efficient and robust qudit-gate synthesis.

Li, Andy C.Y. [Fermilab] (ORCID:0000000345423739)↗
DOE OSTI2026

Pulse control of superconducting cavity-based qudits with a Fock-state basis

Fock-basis-encoding qudits allow quantum gates to operate on multiple qudit levels simultaneously. This capability is advantageous for applications involving complex local gate operations, such as the digital quantum simulation of non-Abelian gauge theories. However, compiling unitary operations to native qudit gates remains a challenging task, often requiring substantial computational resources. In this work, we theoretically investigate the direct pulse control of a superconducting radio-frequency cavity coupled to an ancilla transmon for gate synthesis. We will discuss the improvements and limitations applicable to high Fock states. This work paves the way toward more efficient and robust qudit-gate synthesis.

Li, Andy C.Y. [Fermilab] (ORCID:0000000345423739)↗
DOE OSTI2025

Attention to quantum complexity

The imminent era of error-corrected quantum computing demands robust methods to characterize quantum state complexity from limited, noisy measurements. We introduce the Quantum Attention Network (QuAN), a classical artificial intelligence (AI) framework leveraging attention mechanisms tailored for learning quantum complexity. Inspired by large language models, QuAN treats measurement snapshots as tokens while respecting permutation invariance. Combined with our parameter-efficient miniset self-attention block, this enables QuAN to access high-order moments of bit-string distributions and preferentially attend to less noisy snapshots. We test QuAN across three quantum simulation settings: driven hard-core Bose-Hubbard model, random quantum circuits, and toric code under coherent and incoherent noise. QuAN directly learns entanglement and state complexity growth from experimental computational basis measurements, including complexity growth in random circuits from noisy data. In regimes inaccessible to existing theory, QuAN unveils the complete phase diagram for noisy toric code data as a function of both noise types, highlighting AI’s transformative potential for assisting quantum hardware.

Kim, Hyejin [Cornell Univ., Ithaca, NY (United Sta↗
DOE OSTI2025

Biased degenerate ground-state sampling of small Ising models with converged quantum approximate optimization algorithm

The quantum alternating operator ansatz, a generalization of the quantum approximate optimization algorithm (QAOA), is a quantum algorithm used for approximately solving combinatorial optimization problems. QAOA typically uses the transverse field mixer as the driving Hamiltonian. One of the interesting properties of the transverse field driving Hamiltonian is that it results in nonuniform sampling of degenerate ground states of optimization problems. In this study, we numerically examine the fair sampling properties of the transverse field mixer QAOA, and Grover mixer QAOA (GM-QAOA), which provides theoretical guarantees of fair sampling of degenerate optimal solutions, up to a large enough p such that the mean expectation value converges to an optimal approximation ratio of 1. This comparison is performed with high-quality heuristically computed, but not necessarily optimal, QAOA angles, which give strictly monotonically improving solution quality as p increases. These angles are computed using the Julia based numerical simulation software JuliQAOA. Fair sampling of degenerate ground states is quantified using the Shannon entropy of the ground-state amplitudes distribution. The fair sampling properties are reported on several quantum signature Hamiltonians from previous quantum annealing fair sampling studies. Small random fully connected spin glasses are shown, which exhibit exponential suppression of some degenerate ground states with transverse field mixer QAOA. The transverse field mixer QAOA simulations show that some problem instances clearly saturate the Shannon entropy of 0 with a maximally biased distribution that occurs when the learning converges to an approximation ratio of 1 while other problem instances never deviate from a maximum Shannon entropy (uniform distribution) at any p step. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

QuaSiMo: A composable library to program hybrid workflows for quantum simulation

Abstract A composable design scheme is presented for the development of hybrid quantum/classical algorithms and workflows for applications of quantum simulation. The proposed object‐oriented approach is based on constructing an expressive set of common data structures and methods that enables programming of a broad variety of complex hybrid quantum simulation applications. The abstract core of the scheme is distilled from the analysis of the current quantum simulation algorithms. Subsequently, it allows synthesis of new hybrid algorithms and workflows via the extension, specialisation, and dynamic customisation of the abstract core classes defined by the proposed design. The design scheme is implemented using the hardware‐agnostic programming language QCOR into the QuaSiMo library. To validate the implementation, the authors test and show its utility on commercial quantum processors from IBM and Rigetti, running some prototypical quantum simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Recent Advances for Improving the Accuracy, Transferability, and Efficiency of Reactive Force Fields

Reactive force fields provide an affordable model for simulating chemical reactions at a fraction of the cost of quantum mechanical approaches. However, classically accounting for chemical reactivity often comes at the expense of accuracy and transferability, while computational cost is still large relative to nonreactive force fields. Here, we summarize recent efforts for improving the performance of reactive force fields in these three areas with a focus on the ReaxFF theoretical model. To improve accuracy, we describe recent reformulations of charge equilibration schemes to overcome unphysical long-range charge transfer, new ReaxFF models that account for explicit electrons, and corrections for energy conservation issues of the ReaxFF model. To enhance transferability we also highlight new advances to include explicit treatment of electrons in the ReaxFF and hybrid nonreactive/reactive simulations that make it possible to model charge transfer, redox chemistry, and large systems such as reverse micelles within the framework of a reactive force field. To address the computational cost, we review recent work in extended Lagrangian schemes and matrix preconditioners for accelerating the charge equilibration method component of ReaxFF and improvements in its software performance in LAMMPS.

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

String-Breaking Dynamics in Quantum Adiabatic and Diabatic Processes

Confinement prohibits isolation of color charges, e.g., quarks, in nature via a process called string breaking : the separation of two charges results in an increase in the energy of a color flux, visualized as a string, connecting those charges. Eventually, creating additional charges is energetically favored, hence breaking the string. Such a phenomenon can be probed in simpler models, including quantum spin chains, enabling enhanced understanding of string-breaking dynamics. A challenging task is to understand how string breaking occurs as time elapses, in an out-of-equilibrium setting. This work establishes the phenomenology of dynamical string breaking induced by a gradual increase of string tension over time. It, thus, goes beyond instantaneous quench processes and enables tracking the real-time evolution of strings in a more controlled setting. We focus on domain-wall confinement in a family of quantum Ising chains. Our results indicate that, for sufficiently short strings and slow evolution, string breaking can be described by the transition dynamics of a two-state quantum system akin to a Landau-Zener process. For longer strings, a more intricate spatiotemporal pattern emerges: the string breaks by forming a superposition of bubbles (domains of flipped spins of varying sizes), which involve highly excited states. We finally demonstrate that string breaking driven only by quantum fluctuations can be realized in the presence of sufficiently long-ranged interactions. This work holds immediate relevance for studying string breaking in quantum-simulation experiments.

Ising model↗
DOE OSTI2024

Limitations for Quantum Algorithms to Solve Turbulent and Chaotic Systems

We investigate the limitations of quantum computers for solving nonlinear dynamical systems. In particular, we tighten the worst-case bounds of the quantum Carleman linearisation (QCL) algorithm answering one of their open questions. We provide a further significant limitation for any quantum algorithm that aims to output a quantum state that approximates the normalized solution vector. Given a natural choice of coordinates for a dynamical system with one or more positive Lyapunov exponents and solutions that grow sub-exponentially, we prove that any such algorithm has complexity scaling at least exponentially in the integration time. As such, an efficient quantum algorithm for simulating chaotic systems or regimes is likely not possible.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Adaptive basis sets for practical quantum computing

Electronic structure calculations on small systems such as H 2 , H 2 O, LiH, and BeH 2 with chemical accuracy are still a challenge for the current generation of noisy intermediate-scale quantum (NISQ) devices. One of the reasons is that due to the device limitations, only minimal basis sets are commonly applied in quantum chemical calculations, which allows one to keep the number of qubits employed in the calculations at a minimum. However, the use of minimal basis sets leads to very large errors in the computed molecular energies as well as potential energy surface shapes. One way to increase the accuracy of electronic structure calculations is through the development of small basis sets better suited for quantum computing. In this work, we show that the use of adaptive basis sets, in which exponents and contraction coefficients depend on molecular structure, provides an easy way to dramatically improve the accuracy of quantum chemical calculations without the need to increase the basis set size and thus the number of qubits utilized in quantum circuits. As a proof of principle, we optimize an adaptive minimal basis set for quantum computing calculations on an H 2 molecule, in which exponents and contraction coefficients depend on the H—H distance, and apply it to the generation of H 2 potential energy surface on IBM-Q quantum devices. The adaptive minimal basis set reaches the accuracy of the double-zeta basis sets, thus allowing one to perform double-zeta quality calculations on quantum devices without the need to utilize twice as many qubits in simulations. This approach can be extended to other molecular systems and larger basis sets in a straightforward manner.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Real-time chiral dynamics at finite temperature from quantum simulation

In this study, we explore the real-time dynamics of the chiral magnetic effect (CME) at a finite temperature in the (1+1)-dimensional QED, the massive Schwinger model. By introducing a chiral chemical potential μ 5 through a quench process, we drive the system out of equilibrium and analyze the induced vector currents and their evolution over time. The Hamiltonian is modified to include the time-dependent chiral chemical potential, thus allowing the investigation of the CME within a quantum computing framework. We employ the quantum imaginary time evolution (QITE) algorithm to study the thermal states, and utilize the Suzuki-Trotter decomposition for the real-time evolution. This study provides insights into the quantum simulation capabilities for modeling the CME and offers a pathway for studying chiral dynamics in low-dimensional quantum field theories.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Quantum simulation of molecules without fermionic encoding of the wave function

Abstract Molecular simulations generally require fermionic encoding in which fermion statistics are encoded into the qubit representation of the wave function. Recent calculations suggest that fermionic encoding of the wave function can be bypassed, leading to more efficient quantum computations. Here we show that the two-electron reduced density matrix (2-RDM) can be expressed as a unique functional of the unencoded N -qubit-particle wave function without approximation, and hence, the energy can be expressed as a functional of the 2-RDM without fermionic encoding of the wave function. In contrast to current hardware-efficient methods, the derived functional has a unique, one-to-one (and onto) mapping between the qubit-particle wave functions and 2-RDMs, which avoids the over-parametrization that can lead to optimization difficulties such as barren plateaus. An application to computing the ground-state energy and 2-RDM of H 4 is presented.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2026

Feynman diagrams for matter wave interferometry

We introduce a new theoretical framework based on Feynman diagrams to compute phase shifts in matter wave interferometry. The method allows for analytic computation of higher order quantum corrections, beyond the traditional semi-classical approximation. These additional terms depend on the finite size of the initial matter wavefunction and/or have higher order dependence on ℏ. We apply the method to compute the response of matter wave interferometers to power law potentials and potentials with an arbitrary spatial dependence. The analytic expressions are validated by comparing to numerical simulations, and estimates are provided for the scale of the quantum corrections to the phase shift response to the gravitational field of the earth, anharmonic trapping potentials, and gravitational fields from local proof masses. We also find that for certain experimentally feasible parameters, these corrections are large enough to be measured and could lead to systematic errors if they are not mitigated. We find that to first order in a spatially dependent potential, quantum corrections vanish when the initial matter wavepacket has spherical symmetry and the potential satisfies Laplace's equation. We anticipate these quantum corrections will be especially important for trapped matter wave interferometers and for free-space matter wave interferometers in the presence of proof masses. These interferometers are becoming increasingly sensitive tools for mobile inertial sensing, gravity surveying, tests of gravity and its interplay with quantum mechanics, and searches for dark energy.

Glick, Jonah [Northwestern U.; Fermilab] (ORCID:00↗
DOE OSTI2020

Boundary-consistent B-spline filtering schemes and application to high-fidelity simulations of turbulence

A filtering operation, based on B-spline discretizations, is introduced to target weakly growing mesh-scale oscillations that can arise in high-fidelity turbulence simulations. This is a spectral regularization that can be described using the singular values of a banded matrix operator, with the filtering strength set by a scalar- or vector-valued penalty parameter. The penalty parameter can be specified though it can also be advantageously selected to minimize the generalized cross validation (GCV) measure of distance between the pre- and post-filtered solutions. Efficient algorithms are developed to compute both the scalar and vector penalty parameters. The B-spline filter has a sharper localization to high-wavenumber than compact or explicit filters of the same stencil width and is demonstrated for solutions of the Burgers' equation, decaying Burgers' turbulence, and compressible Navier–Stokes turbulent channel flow. Furthermore, these simulations confirm the scheme's numerical stability and ability to narrowly target the high wavenumber components of numerical solutions. An advantage over finite-difference filters is that these B-spline filters are stable on bounded domains and even preserve formal order of accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗