Engineering Papers⌕ Search

SEARCH · Engineering Papers

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,423 records · Page 79

Ultrafast Proton-Coupled Electron Transfer Reactions at Unit Quantum Yield

Proton-coupled electron transfer (PCET) reactions mediate essential biological energy-conversion processes, yet dynamical experiments that distinguish concerted electron/proton motion from sequential electron-transfer/proton-transfer pathways are unprecedented on ultrafast time scales. Here we report a tightly coupled donor–spacer–acceptor assembly, NDI-Sp-PhOH/BI, that enables direct interrogation of light-triggered and ultrafast PCET dynamics. Photoexcitation of the naphthalene diimide chromophore drives charge separation forming NDI radical anion and benzimidazolium phenoxy radical (PhO●/BIH+) products with a 440 fs time constant, followed by thermal charge recombination on a 5 ps time scale. Transient visible/near-infrared and mid-infrared spectroscopies independently track electron and proton motion and reveal coincident formation and decay of the charge-separated PCET products, excluding detectable phenol radical cation or phenoxide intermediates expected for sequential electron transfer-proton transfer (ET-PT) pathways. Surface-hopping quasiclassical trajectory simulations demonstrate rapid proton relocation coupled to evolution from locally excited to charge-transfer states, congruent with a concerted mechanism. These combined spectroscopic and computational results establish NDI-Sp-PhOH/BI as an archetype for ultrafast, concerted PCET occurring with unit quantum yield; further, because this platform provides distinct electronic and vibrational spectroscopic handles in its ground, electronically excited, and charge-separated states, it provides new opportunities to characterize mechanistic crossover in biomimetic PCET systems.

10 SYNTHETIC FUELS↗

Quantum Markov chain Monte Carlo with digital dissipative dynamics on quantum computers

Modeling the dynamics of a quantum system connected to the environment is critical for advancing our understanding of complex quantum processes, as most quantum processes in nature are affected by an environment. Modeling a macroscopic environment on a quantum simulator may be achieved by coupling independent ancilla qubits that facilitate energy exchange in an appropriate manner with the system and mimic an environment. This approach requires a large, and possibly exponential number of ancillary degrees of freedom which is impractical. In contrast, we develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. By combining periodic modulation of the ancilla energies, or spectral combing, with periodic reset operations, we are able to mimic interaction with a large environment and generate thermal states of interacting many-body systems. We evaluate the algorithm by simulating preparation of thermal states of the transverse Ising model. Our algorithm can also be viewed as a quantum Markov chain Monte Carlo process that allows sampling of the Gibbs distribution of a multivariate model. To illustrate this we evaluate the accuracy of sampling Gibbs distributions of simple probabilistic graphical models using the algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

On the Green's function of the partially diffusion-controlled reversible ABCD reaction for radiation chemistry codes

Several computer codes simulating chemical reactions in particles systems are based on the Green's functions of the diffusion equation (GFDE). Indeed, many types of chemical systems have been simulated using the exact GFDE, which has also become the gold standard for validating other theoretical models. In this work, a simulation algorithm is presented to sample the interparticle distance for partially diffusion-controlled reversible ABCD reaction. This algorithm is considered exact for 2-particles systems, is faster than conventional look-up tables and uses only a few kilobytes of memory. The simulation results obtained with this method are compared with those obtained with the independent reaction times (IRT) method. This work is part of our effort in developing models to understand the role of chemical reactions in the radiation effects on cells and tissues and may eventually be included in event-based models of space radiation risks. However, as many reactions are of this type in biological systems, this algorithm might play a pivotal role in future simulation programs not only in radiation chemistry, but also in the simulation of biochemical networks in time and space as well.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Quantum effects on dislocation motion from ring-polymer molecular dynamics

Quantum motion of atoms known as zero-point vibration was recently proposed to explain a long-standing discrepancy between theoretically computed and experimentally measured low-temperature plastic strength of iron and possibly other metals with high atomic masses. This finding challenges the traditional notion that quantum motion of atoms is relatively unimportant in solids comprised of heavy atoms. Here we report quantum dynamic simulations of quantum effects on dislocation motion within the exact formalism of Ring-Polymer Molecular Dynamics (RPMD). To extend the reach of quantum atomistic simulations to length and time scales relevant for extended defects in materials, we implemented RPMD in the open-source code LAMMPS thus making the RPMD method widely available to the community. We use our RPMD/LAMMPS approach for direct calculations of dislocation mobility and its effects on the yield strength of α-iron. Our simulation results establish that quantum effects are noticeable at temperatures below 50 K but account for only a modest (≈13% at T = 0 K) overall reduction in the Peierls barrier, at variance with the factor of two reduction predicted earlier based on the more approximate framework of harmonic transition state theory. Our results confirm that zero-point vibrations provide ample additional agitation for atomic motion that increases with decreasing temperature, however its enhancing effect on dislocation mobility is largely offset by an increase in the effective atom size, an effect known as quantum dispersion that has not been accounted for in the previous calculations.

36 MATERIALS SCIENCE↗

High pressure elastic properties of minerals from ab initio simulations: The case of pyrope, grossular and andradite silicate garnets

A computational strategy is devised for the accurate ab initio simulation of elastic properties of crystalline materials under pressure. The proposed scheme, based on the evaluation of the analytical stress tensor and on the automated computation of pressure-dependent elastic stiffness constants, is implemented in the CRYSTAL solid state quantum-chemical program. Elastic constants and related properties (bulk, shear and Young moduli, directional seismic wave velocities, elastic anisotropy index, Poisson's ratio, etc.) can be computed for crystals of any space group of symmetry. We apply such a technique to the study of high-pressure elastic properties of three silicate garnet end-members (namely, pyrope, grossular, and andradite) which are of great geophysical interest, being among the most important rock-forming minerals. The reliability of this theoretical approach is proved by comparing with available experimental measurements. The description of high-pressure properties provided by several equations of state is also critically discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

Numerical simulation of the dynamics of a liquid crystal in the case of plane strain using GPUs

Parallel computational algorithm is worked out for numerical implementation of two-dimensional dynamic model of a liquid crystal, which takes into account the mutual influence of three physical effects – transfer of acoustic energy due to translational motion, viscoelastic rotation of the particles under the action of tangential stresses, anisotropic thermal expansion and compression. The algorithm is based on the Godunov gap decay method, the Ivanov scheme with controlled dissipation of energy and the splitting method with respect to spatial variables. The CUDA technology for computer systems with graphic accelerators is used. Results of computations demonstrating the efficiency of proposed method and algorithm are represented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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)↗

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↗

Solving kinetic equations with adaptive mesh in phase space for rarefied gas dynamics and plasma physics (Invited)

The paper describes an Adaptive Mesh in Phase Space (AMPS) technique for solving kinetic equations with deterministic mesh-based methods. The AMPS technique allows automatic generation of adaptive Cartesian mesh in both physical and velocity spaces using a Tree-of-Trees data structure. We illustrate advantages of AMPS for simulations of rarefied gas dynamics and electron kinetics on low temperature plasmas. In particular, we consider formation of the velocity distribution functions in hypersonic flows, particle kinetics near oscillating boundaries, and electron kinetics in a radio-frequency sheath. AMPS provide substantial savings in computational cost and increased efficiency of the mesh-based kinetic solvers.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Computational evaluation of the flexoelectric effect in dielectric solids

Flexoelectricity is a size-dependent electromechanical mechanism coupling polarization and strain gradient. It exists in a wide variety of materials, and is most noticeable for nanoscale objects, where strain gradients are higher. Simulations are important to understand flexoelectricity because experiments at very small scales are difficult, and analytical solutions are scarce. Here, we computationally evaluate the role of flexoelectricity in the electromechanical response of linear dielectric solids in two-dimensions. We deal with the higher-order coupled partial differential equations using smooth meshfree basis functions in a Galerkin method, which allows us to consider general geometries and boundary conditions. We focus on the most common setups to quantify the flexoelectric response, namely, bending of cantilever beams and compression of truncated pyramids, which are generally interpreted through approximate solutions. While these approximations capture the size-dependent flexoelectric electromechanical coupling, we show that they only provide order-of-magnitude estimates as compared with a solution fully accounting for the multidimensional nature of the problem. We discuss the flexoelectric mechanism behind the enhanced size-dependent elasticity in beam configurations. We show that this mechanism is also responsible for the actuation of beams under purely electrical loading, supporting the idea that a mechanical flexoelectric sensor also behaves as an actuator. The predicted actuation-induced curvature is in a good agreement with experimental results. The truncated pyramid configuration highlights the critical role of geometry and boundary conditions on the effective electromechanical response. Our results suggest that computer simulations can help understanding and quantifying the physical properties of flexoelectric devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

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↗

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↗

Computational prediction of lattice thermal conductivity: A comparison of molecular dynamics and Boltzmann transport approaches

The predictive modeling of lattice thermal conductivity is of fundamental importance for the understanding and design of materials for a wide range of applications. Two major approaches, namely molecular dynamics (MD) simulations and calculations solving approximately the Boltzmann transport equation (BTE), have been developed to compute the lattice thermal conductivity. We present a detailed direct comparison of these two approaches, using as prototypical cases MgO and PbTe. The comparison, carried out using empirical potentials, takes into account the effects of fourth order phonon scattering, temperature-dependent phonon frequencies (phonon renormalization), and investigates the effects of quantum vs classical statistics. We clarify that equipartition, as opposed to Maxwell-Boltzmann, govern the statistics of phonons in MD simulations. We find that lattice thermal conductivity values from MD and BTE show an apparent, satisfactory agreement; however such an agreement is the result of error cancellations. As a result we also show that the primary effect of statistics on thermal conductivity is via the scattering rate dependence on phonon populations.

36 MATERIALS SCIENCE↗