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 1,063 records · Page 59
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Motion Planning Algorithms for Safety and Quantum Computing Efficiency

Motion planning remains a fundamental problem in robotics. Sampling-based algorithms use randomization to allow efficient solutions to this complex problem. As mobile robots and autonomous vehicles become more prevalent in everyday life, motion planning must be applied to increasingly challenging scenarios. Safety has become a paramount concern in motion planning for ensuring robotic applications enrich human lives. To date, many motion planning techniques to increase safety in the face of uncertain and dynamic environments have been developed. This dissertation first addresses distributional safety of Rapidly-Exploring Random Trees (RRT) through our algorithm W-Safe RRT. To acknowledge distributional uncertainty and poor modeling, W-Safe RRT uses the Wasserstein metric to provide a probabilistic bound on the distributional distance between a robot and obstacles. Human-interpretable environmental agent classification allows online safety margin adaptation. We propose and analyze an integrating region method for online classification that increases actor labeling accuracy based on behavioral feature values when compared to state of the art methods. The method performs class assignments based on local maximum likelihood in a created behavioral feature-space, allowing a notion of classification uncertainty. Model-based methods with safety guarantees can quickly become computationally in tractable, especially with multiple agents, higher dimensions, and plentiful unknowns. Sampling based algorithms have been parallelized for computation with multi-core computers and GPUs. We consider the use of quantum algorithms and computers for sampling-based motion planning for the first time. Quantum computing performs operations on superpositions of states and can solve certain problems much more efficiently than classical computers, but introduces previously unseen challenges. With Quantum-RRT, we recast the motion planning problem into a database-search structure and use Quantum Amplitude Amplification to find reachable states in the database with a quadratic performance increase over classical methods. We address two error sources with this method: quantum measurement and quantum oracle errors. We then extend this method to Parallel Quantum-RRT, which uses a manager-worker architecture with multiple parallel quantum workers to increase database search efficiency. We compare algorithm architectures and characterize probabilities of multiple workers finding solutions. Lastly, we test in simulation the quantum algorithms against classical versions in a wide variety of scenarios, concluding that a similar parallelization improvement is to be found in the quantum case as was found in the parallelization of classical RRT.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A First Step Towards Quantum Simulating Jet Evolution in a Dense Medium

The fast development of quantum technologies over the last decades has offered a glimpse to a future where the quantum properties of multi particle systems might be more fully understood. In particular, quantum computing might prove crucial to explore many aspects of high energy physics unaccessible to classical methods. In this talk, we will describe how one can use digital quantum computers to study the evolution of QCD jets in quark gluons plasmas. We construct a quantum circuit to study single particle evolution in a dense QCD medium. Focusing on the jet quenching parameter $\hat{q}$, we present some early numerical results for a small quantum circuit. Future extensions of this strategy are also addressed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Let Each Quantum Bit Choose Its Basis Gates

Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit (1Q) gates that can be implemented in a given technology. 2Q entangling gates, coupled with some 1Q gates, allow for universal quantum computation. In superconducting technologies, the current state of the art is to implement the same 2Q gate between every pair of qubits (typically an XX-or XY-type gate). This strict hardware uniformity requirement for 2Q gates in a large quantum computer has made scaling up a time and resource-intensive endeavor in the lab. We propose a radical idea – allow the 2Q basis gate(s) to differ between every pair of qubits, selecting the best entangling gates that can be calibrated between given pairs of qubits. This work aims to give quantum scientists the ability to run meaningful algorithms with qubit systems that are not perfectly uniform. Scientists will also be able to use a much broader variety of novel 2Q gates for quantum computing. We develop a theoretical framework for identifying good 2Q basis gates on “nonstandard” Cartan trajectories that deviate from “standard” trajectories like XX. We then introduce practical methods for calibration and compilation with nonstandard 2Q gates, and discuss possible ways to improve the compilation. To demonstrate our methods in a case study, we simulated both standard XY-type trajectories and faster, nonstandard trajectories using an entangling gate architecture with far-detuned transmon qubits. We identify efficient 2Q basis gates on these nonstandard trajectories and use them to compile a number of standard benchmark circuits such as QFT and QAOA. Furthermore, our results demonstrate an 8x improvement over the baseline 2Q gates with respect to speed and coherence-limited gate fidelity.

quantum computing↗
DOE OSTI2024

Improved Precision Scaling for Simulating Coupled Quantum-Classical Dynamics

In this paper, we present a superpolynomial improvement in the precision scaling of quantum simulations for coupled quantum-classical systems. Such systems are found in, e.g., molecular-dynamics simulations within the Born-Oppenheimer approximation. By employing a framework based on the Koopman–von Neumann formulation of classical mechanics, we express the Liouville equation of motion as unitary dynamics and utilize phase kickback from a dynamical quantum simulation to calculate the quantum forces acting on classical particles. This approach allows us to simulate the dynamics of these classical particles without the overheads associated with measuring gradients and solving the equations of motion on a classical computer, resulting in a superpolynomial advantage at the price of increased space complexity. We demonstrate that these simulations can be performed in both microcanonical and canonical ensembles, enabling the estimation of thermodynamic properties from the prepared probability density. Published by the American Physical Society 2024

Simon, Sophia (ORCID:0000000332612338)↗
DOE OSTI2023

Toward perturbation theory methods on a quantum computer

Perturbation theory, used in a wide range of fields, is a powerful tool for approximate solutions to complex problems, starting from the exact solution of a related, simpler problem. Advances in quantum computing, especially over the past several years, provide opportunities for alternatives to classical methods. Here, we present a general quantum circuit estimating both the energy and eigenstates corrections that is far superior to the classical version when estimating second-order energy corrections. We demonstrate our approach as applied to the two-site extended Hubbard model. In addition to numerical simulations based on qiskit, results on IBM’s quantum hardware are also presented. Our work offers a general approach to studying complex systems with quantum devices, with no training or optimization process needed to obtain the perturbative terms, which can be generalized to other Hamiltonian systems both in chemistry and physics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Safety Applications Project FY18-19 Highlights, FY2020 Goals [Slides]

Collaborations leverage the investment and expertise of others. Code capabilities determine the questions that can be addressed using SAP tools. Infrastructure acts as a force multiplier for software developer skills. Improved code performance allows simulations to finish faster or with greater fidelity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)

The Quantum Alternating Operator Ansatz (QAOA) and Quantum Annealing (QA) are quantum algorithms that are both based on the adiabatic theorem and both have the goal of sampling the optimal solution(s) of combinatorial optimization problems. Quantum annealing has been physically instantiated on D-Wave devices using superconducting flux qubits, and QAOA can be programmed on digital gate-model quantum computers such as the programmable superconducting transmon qubits devices of the IBMQ series, for instance ibm washington. QAOA and QA address the same types of problems, but it is unclear how they will scale to large problem sizes and to larger and higher-fidelity quantum computers. In this article, we present a direct comparison between QAOA, one and two rounds, run on all 127 qubits of ibm washington and QA run on D-Wave Advantage system4.1 and Advantage system6.1. The problems which allow for this comparison are random Ising model problems whose connectivity matches the heavy hexagonal lattice topology of ibm washington and the Pegasus graph connectivity of the two D-Wave devices. We create two classes of problem instances for this comparison: one with higher order terms (ZZZ variable interactions), linear terms, and quadratic terms, and a separate problem type with only linear and quadratic terms. Our QAOA circuits are novel and extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of ibm washington’s heavy hexagonal lattice and can be applied to future heavy-hex chips. We also test the effectiveness of the error suppression technique digital dynamical decoupling on the QAOA circuits. The QAOA circuits compiled to ibm washington are composed of several thousand circuit instructions, approximately 3, 000 depending on the details of the circuit, making these some the largest quantum circuits ever executed on a digital quantum processor. QAOA and QA are compared against the classical heuristic algorithm of simulated annealing and all problem instances are exactly solved using CPLEX in order to evaluate which samplers, if any, correctly found the ground state solution(s) of the problem instances. We find that (i) QA outperforms QAOA on all problem instances, (ii) QAOA samples the problems better than random sampling, and (iii) QAOA angle computation exhibits clear parameter concentration across the ensemble of Ising models.

127 Qubits↗
DOE OSTI2021

Projector-Free Capped-Fragment Scheme within Density Functional Embedding Theory for Covalent and Ionic Compounds

Quantum-mechanics-(QM)-based simulations now routinely aid in understanding and even discovering new chemistries involving molecules and materials exhibiting desired functionalities. Ab initio correlated wavefunction (CW) theories systematically improve QM methods, with many exhibiting high accuracy. However, execution of CW methods requires expensive computations that typically scale poorly with system size. Divide-and-conquer approaches partition large systems into smaller fragments; a lower level of theory treats fragment interactions while a preferred higher level of theory describes the important fragment. These methods offer ways to incorporate CWs into chemical simulations of large systems, e.g., biomolecules, surfaces, large inorganic clusters, bulk crystals, etc. Here we propose a partitioning protocol that utilizes capping atoms to saturate severed covalent bonds at fragment interfaces and density functional embedding theory (DFET) to describe fragment interactions. The capping groups in each fragment provide an ad-hoc potential that approximates the effects of the environment. An embedding potential optimized via DFET then serves as an augmentation of the capping group to simulate the effects of the environment. We concurrently use an auxiliary fragment (a separate system comprised of only the combined capping groups) to account for, and thereby correct, the electron density contributions of all the capping groups added to all of the fragments. This method depends only on the capped-subsystem and auxiliary-fragment electron densities, forgoing, as with the original DFET developed for metallic systems, orbital-based projector approaches that determine a nonlocal action of the embedding potential onto the fragment electrons. By using an auxiliary fragment, the method maintains a purely electron-density-dependent embedding potential, substantially lessening the cost and leading to simpler implementation. In this work, we demonstrate the utility of our capped-DFET and ensuing capped embedded CW method in two contrasting systems, namely, an organic molecule and an ionic metal oxide cluster.

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

Strategies for simulating the time evolution of Hamiltonian lattice field theories

Simulating the time evolution of quantum field theories given some Hamiltonian H requires developing algorithms for implementing the unitary operator e -iHt . A variety of techniques exist that accomplish this task, with the most common technique used so far being Trotterization, which is a special case of the application of a product formula. However, other techniques exist that promise better asymptotic scaling in certain parameters of the theory being simulated, the most efficient of which are based on the concept of block encoding. In this work we study the performance of such algorithms in simulating lattice field theories. We derive and compare the asymptotic gate complexities of several commonly used simulation techniques in application to Hamiltonian lattice field theories. Using the scalar $\hat{φ}$ 4 theory as a test, we also perform numerical studies and compare the gate costs required by product formulas and signal-processing-based techniques to simulate time evolution. For the latter, we use the linear combination of unitaries (LCU) construction augmented with the quantum Fourier transform circuit to switch between the field and momentum eigenbases, which leads to immediate order-of-magnitude improvement in the cost of preparing the block encoding. Further, this paper also includes a pedagogical review of the techniques used, in particular product formulas, LCU, qubitization, quantum signal processing, as well as the technique for simulating geometrically-local Hamiltonians developed by Haah, Hastings, Kothari, and Low.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Multi-modality deep learning for pulse prediction in homogeneous nonlinear systems via parametric conversion

In this Letter, we introduce FusionNet, a multi-modality deep learning framework designed to predict and analyze output pulses in high-power rare-earth-doped laser systems driving parametric conversion in homogeneous guided nonlinear media. FusionNet integrates temporal, spectral, and physical experimental conditions to model ultrafast nonlinear phenomena, including parametric nonlinear frequency conversion, self-phase modulation, and cross-phase modulation in homogeneous guided systems such as gas-filled hollow-core fibers. These systems bridge physical models with experimental data, advancing our understanding of light-guiding principles and nonlinear interactions while expediting the design and optimization of on-demand high-power, high-brightness systems. Our results demonstrate a 73% reduction in prediction error and an 83% improvement in computational efficiency compared to conventional neural networks. This work establishes a new paradigm for accelerating parametric simulations and optimizing experimental designs in high-power laser systems, with further implications for high-precision spectroscopy, quantum information science, and distributed entangled interconnects.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Signatures of a liquid–liquid transition in an ab initio deep neural network model for water

Significance Water is central across much of the physical and biological sciences and exhibits physical properties that are qualitatively distinct from those of most other liquids. Understanding the microscopic basis of water’s peculiar properties remains an active area of research. One intriguing hypothesis is that liquid water can separate into metastable high- and low-density liquid phases at low temperatures and high pressures, and the existence of this liquid–liquid transition could explain many of water’s anomalous properties. We used state-of-the-art approaches in computational quantum chemistry, statistical mechanics, and machine learning and obtained evidence consistent with a liquid–liquid transition, supporting the argument for the existence of this phenomenon in real water.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Capturing electronic decoherence in quantum-classical dynamics using the ring-polymer-surface-hopping–density-matrix approach

Simulations of coupled electronic and nuclear dynamics in molecules can be quite challenging due to the involved interplay of the many degrees of freedom. Because a full quantum treatment of both electrons and nuclei is computationally very demanding, it is generally restricted to model systems or rather small molecules and short timescales. Mixed quantum-classical dynamics methods such as Tully's fewest switches surface hopping (FSSH) can be used to overcome this limitation. However, FSSH is known to poorly describe electronic coherences and decoherence phenomena. Here, we present an approach that combines FSSH with ring-polymer molecular dynamics (RPMD) in a specific way that aims to alleviate the coherence problem. Termed the ring-polymer-surface-hopping–density-matrix approach, this method uses an electronic density-matrix formulation to calculate surface hopping rates. Additionally, this incorporates decoherence effects into FSSH in a natural way by taking into account the spatial spreading of the ring polymer that mimics the width of a nuclear wave packet in each RPMD trajectory. By applying our method to Tully's one-dimensional model system, we demonstrate that this method captures a crucial decoherence mechanism that is missing in FSSH. Furthermore, our method turns out to be superior at describing electronic coherences compared with earlier attempts at combining RPMD and FSSH.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

Random insights into the complexity of two-dimensional tensor network calculations

Projected entangled pair states (PEPS) offer memory-efficient representations of some quantum many-body states that obey an entanglement area law and are the basis for classical simulations of ground states in two-dimensional (2d) condensed matter systems. However, rigorous results show that exactly computing observables from a 2d PEPS state is generically a computationally hard problem. Yet approximation schemes for computing properties of 2d PEPS are regularly used, and empirically seen to succeed, for a large subclass of (“not too entangled”) condensed matter ground states. Adopting the philosophy of random matrix theory, in this work, we analyze the complexity of approximately contracting a 2d random PEPS by exploiting an analytic mapping to an effective replicated statistical mechanics model that permits a controlled analysis at a large bond dimension. Through this statistical-mechanics lens, we argue that (i) although approximately sampling wave-function amplitudes of random PEPS faces a computational-complexity phase transition above a critical bond dimension, and (ii) one can generically efficiently estimate the norm and correlation functions for any finite bond dimension. Furthermore, these results are supported numerically for various bond-dimension regimes. It is an important open question whether the above results for random PEPS apply more generally also to PEPS representing physically relevant ground states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Compositional Methods for Schrödinger's Equation with Application to Optimal Control

The evolution of the state of a quantum computer is governed by Schrödinger's equation. We introduce compositional methods, a way to increase the order of symmetric methods by replacing one timestep by multiple timesteps. We perform several numerical experiments, including a simulation of a two qubit CNOT gate, using compositional variants of Störmer-Verlet and the implicit midpoint rule. We observe that the compositional methods demonstrate greater computational efficiency than the base methods when the desired error tolerance is less than ~ 10 -4 to 10 -5 . We discuss the trade-offs of using each compositional method, as well as differences between using Störmer-Verlet or the implicit midpoint rule as the base integrator of the compositional methods.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2020

Continued Validation Studies using the MOOSE Framework for Plasma Simulation with Electromagnetics

Resources and tools for the modeling and simulation of low-temperature plasma (LTP) discharges are increasingly vital to progress in the field in order to properly characterize and study complex source designs and plasma chemistries beyond the scope of traditional diagnostics. Open-source software provides powerful platforms for this work and can enable community-driven LTP R&D. Within the Multiphysics Object-Oriented Simulation Environment (MOOSE) open-source framework [1], capabilities have been demonstrated in the areas of plasma fluids (Zapdos [2]), plasma chemistry (CRANE [3]), and general electromagnetic wave theory (Electromagnetic Library for Kinetics & fluids [ELK] [4]). ELK has since been coupled to Zapdos/CRANE to enable fully coupled electromagnetic plasma simulations. This talk will detail the continued validation efforts and discuss Zapdos-ELK-CRANE code coupling with various-low temperature plasma sources. The impact of fully coupled electromagnetics on process parameters (e.g., temperature and electron/ion energy) versus an electrostatic description will also be discussed. [1] Permann et al., SoftwareX, 11 (2020) 100430. [2] Lindsay et al., J. Phys. D: Appl. Phys. 49 (2016) 235204. [3] Keniley et al., Talk, GEC Session DT3.00002 (2019). [4] Icenhour et al., Talk, GEC Session RR1.00006 (2019). Acknowledgements: INL Graduate Fellowship Program, NSF SI2 Grant 1740300, U.S. Dept. of Energy Office of Science Graduate Student Research Program

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Effect of artificial viscosity on shocked particle-laden flows for staggered grid Lagrangian methods

Abstract Shocked particle-laden flows are important to many natural and industrial processes. When simulating these systems, artificial viscosity is often required to prevent numerical artifacts, such as ringing, from arising in the pressure and density fields. The linear and quadratic coefficients of the artificial viscosity determine the amount of smoothing that occurs in these fields. For particle-laden flows, however, many of the fluid–particle interaction forces, for example, the pressure gradient force and unsteady forces, depend on gradients in the fluid fields. Furthermore, while the shock passes over a particle, these forces can be more dominant than drag. This means that the artificial viscosity coefficients affect how a particle and fluid interact when simulating shocked particle systems. Here this effect is investigated for isolated particles and for a particle curtain using a staggered grid Lagrangian approach. The artificial viscosity coefficients have a significant impact on the maximum force that a fluid imparts to a particle, which is important for determining whether a particle will break up in response to the shock. Furthermore, it is found that the density ratio between the particle and the fluid is important in determining whether the artificial viscosity coefficients have a significant impact on the particle’s motion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Bilayer Ion Trap Design for 2D Arrays

Junctions are fundamental elements that support qubit locomotion in two-dimensional ion trap arrays and enhance connectivity in emerging trapped-ion quantum computers. In surface ion traps they have typically been implemented by shaping radio frequency (RF) electrodes in a single plane to minimize the disturbance to the pseudopotential. However, this method introduces issues related to RF lead routing that can increase power dissipation and the likelihood of voltage breakdown. Here, we propose and simulate a novel two-layer junction design incorporating two perpendicularly rotoreflected (rotated, then reflected) linear ion traps. The traps are vertically separated, and create a trapping potential between their respective planes. The orthogonal orientation of the RF electrodes of each trap relative to the other provides perpendicular axes of confinement that can be used to realize transport in two dimensions. While this design introduces manufacturing and operating challenges, as now two separate structures have to be precisely positioned relative to each other in the vertical direction and optical access from the top is obscured, it obviates the need to route RF leads below the top surface of the trap and eliminates the pseudopotential bumps that occur in typical junctions. Here in this paper the stability of idealized ion transfer in the new configuration is demonstrated, both by solving the Mathieu equation analytically to identify the stable regions and by numerically modeling ion dynamics. Our novel junction layout has the potential to enhance the flexibility of microfabricated ion trap control to enable large-scale trapped-ion quantum computing.

42 ENGINEERING↗