Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum mechanics and quantum computing”

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 235 records · Page 13

Oxidation and pyrolysis of methyl propyl ether

The ignition, oxidation, and pyrolysis chemistry of methyl propyl ether (MPE) was probed experimentally at several different conditions, and a comprehensive chemical kinetic model was constructed to help understand the observations, with many of the key parameters computed using quantum chemistry and transition state theory. Experiments were carried out in a shock tube measuring time variation of CO concentrations, in a flow tube measuring product concentrations, and in a rapid compression machine (RCM) measuring ignition delay times. The detailed reaction mechanism was constructed using the Reaction Mechanism Generator software. Sensitivity and flux analyses were used to identify key rate and thermochemical parameters, which were then computed using quantum chemistry to improve the mechanism. Validation of the final model against the 1-20 bar 600-1500 K experimental data is presented with a discussion of the kinetics. The model is in excellent agreement with most of the shock tube and RCM data. Strong non-monotonic variation in conversion and product distribution is observed in the flow-tube experiments as the temperature is increased, and unusually strong pressure dependence and significant heat release during the compression stroke is observed in the RCM experiments. These observations are largely explained by a close competition between radical decomposition and addition to O2 at different sites in MPE; this causes small shifts in conditions to lead to big shifts in the dominant reaction pathways. The validated mechanism was used to study the chemistry occurring during ignition in a diesel engine, simulated using Ignition Quality Test (IQT) conditions. At the IQT conditions, where the MPE concentration is higher, bimolecular reactions of peroxy radicals are much more important than in the RCM.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Modernizing Mechatronics Course With Quantum Engineering

Mechatronics is the synergistic application of mechanics, electronics, control engineering, and computer science in the development of electromechanical products and systems, through integrated design. This paper proposes to extend the mechatronics course beyond traditional engineering topics, and to modernize the mechatronics instructions with complementary quantum engineering topics. With the recent rapid advances in quantum technologies such as quantum communications, sensing, computers, and algorithms, it is imperative to train the next generation of engineers and prepare them for their future careers in the ever-changing industry in such areas. Furthermore, due to such progress and advances in the fields associated with quantum mechanics, the integration of quantum technologies with classical mechanical systems will be inevitable both in terms of educational and technological standpoints in future. To address the educational needs of the future engineers in such areas of significant importance, quantum entanglement and quantum cryptography experiments, as two fundamental topics in quantum mechanics, are brought into the mechatronics course in an initiative that is reported in this paper. The integrated quantum and mechatronics topics also provides opportunities for open discussions on exploring the interface of quantum technologies and classical engineering systems, which can potentially push the engineering boundaries beyond classical possibilities by accessing the quantum advantages. An innovative online remote demonstration of such quantum experiments are developed and presented to the students. This course has been offered to undergraduate students once with successful results. The students were able to remotely access the experiments, perform the experiments and collect data. The successful result of such quantum experiments is also reflected in a course survey, presented in this paper, even though the quantum mechanics topics offered in this course are unfamiliar to engineering students and hence more challenging. The paper reports, and aims to promote, the integration of selected quantum technology topics with the mechatronics course for training engineering students in this rapidly growing area.

Ghazinejad, Maziar↗

Digital Technologies at NASA for Science and Engineering

While scientific and engineering advancements used to rely primarily on theoretical studies and physical experiments, today digital technology enabled by petaflops-scale supercomputers is an equal, if not a greater, contributor to such achievements. In addition, computational modeling and simulation serves as a predictive tool that is not otherwise available. As a result, the use of high performance computing is integral to NASA's work in all mission areas such as space exploration, aeronautics, and scientific discovery. But traditional supercomputing alone is not sufficient for all of the space agency's needs. The success of many NASA missions depends on solving complex computing challenges, some of which are NP-hard (decision theory) if using classical solution methods. Quantum computing promises an unprecedented ability to solve such intractable problems by harnessing quantum mechanical effects such as tunneling, superposition, and entanglement. Another disruptive digital technology is neuromorphic computing that uses brain-inspired lessons to generate new architectures that are much more energy efficient, and capable of massive parallel processing and learning in-situ. Finally, with large amounts of observational and computational data sets, the opportunities of big data and data analytics can be leveraged to enable deep learning and knowledge discovery - it's all a massive digital transformation. This talk will be an overview how NASA utilizes digital technologies for its science and engineering efforts.

Biswas, Rupak↗

Investigating the Chinese postman problem on a quantum annealer

The recent availability of quantum annealers has fueled a new area of information technology where such devices are applied to address practically motivated and computationally difficult problems with hardware that exploits quantum mechanical phenomena. D-Wave annealers are promising platforms to solve these problems in the form of quadratic unconstrained binary optimization. Here we provide a formulation of the Chinese postman problem that can be used as a tool for probing the local connectivity of graphs and networks. We treat the problem classically with a tabu algorithm and simulated annealing, and using a D-Wave device. The efficiency of quantum annealing with respect to the simulated annealing has been demonstrated using the optimal time to solution metric. We systematically analyze computational parameters associated with the specific hardware. Our results clarify how the interplay between the embedding due to limited connectivity of the Chimera graph, the definition of logical qubits, and the role of spin-reversal controls the probability of reaching the expected solution

36 MATERIALS SCIENCE↗

Scalable semidefinite programming approach to variational embedding for quantum many-body problems

In quantum embedding theories, a quantum many-body system is divided into localized clusters of sites which are treated with an accurate ‘high-level’ theory and glued together self-consistently by a less accurate ‘low-level’ theory at the global scale. The recently introduced variational embedding approach for quantum many-body problems combines the insights of semidefinite relaxation and quantum embedding theory to provide a lower bound on the ground-state energy that improves as the cluster size is increased. The variational embedding method is formulated as a semidefinite program (SDP), which can suffer from poor computational scaling when treated with black-box solvers. Here, we exploit the interpretation of this SDP as an embedding method to develop an algorithm which alternates parallelizable local updates of the high-level quantities with updates that enforce the low-level global constraints. Moreover, we show how translation invariance in lattice systems can be exploited to reduce the complexity of projecting a key matrix to the positive semidefinite cone.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

pyEF: A Python Framework for QM and QM/MM Atom-Wise Electric Field Analysis

We introduce pyEF, a software package for computing molecular electric fields, electrostatic interaction energies, and electrostatic potentials from quantum mechanical (QM) atom-centered multipole expansions with atom-wise decomposable contributions. We demonstrate the computational efficiency and accuracy of this QM-derived electric field evaluation tool through several tests. To assess the influence of the underlying QM method and charge partitioning scheme on these electrostatic quantities, we analyze over 250 configurations of an acetone solute molecule in five solvents of variable polarity. We find that electric field calculations are highly sensitive to the choice of charge partitioning method. Even among real-space charge schemes, acetone Stark tuning rates differ by up to a factor of 2. Benchmarking computed solvent dipole moments against experimental bulk values, we conclude that the CM5, ADCH, and Hirshfeld-I charge schemes most reliably capture solvent electrostatics and therefore provide a more faithful foundation for computing electric fields. When constructed from these real-space charges, electric fields are nearly insensitive to basis set size and monotonically increase in magnitude with higher Fock exchange. We also demonstrate efficient convergence of QM electrostatics when more distant molecules are represented solely by MM point charges, reducing computational overhead. Leveraging these findings, we demonstrate the use of pyEF to deduce environmental effects on a transition metal complex from a Ga 4 L 6 12– nanocage and quantify the dominant role of organic linkers in orchestrating electrostatic preorganization.

electric fields↗

ChIMES: A Machine-Learned Interatomic Model Targeting Improved Description of Condensed Phase Chemistry in Energetic Materials

In this report we detail completion of a Physics and Engineering Model Level Two Milestone targeting improved reactive interatomic potentials (IAPs) for energetic materials (EM) through machine learning. The specific goals of this milestone were to develop, validate, and document a new reactive molecular dynamics method for EM, based on machine learning by (1) generating databases of first-principles-derived forces, stresses, and energies for HN3 and 3,4-bis(3-nitrofurazan- 4-yl)furoxan (DNTF) (2) generate atomistic force fields from these databases via ML, and (3) benchmark model performance against first principles calculations. These goals were achieved by (1) further developing a machine learned reactive IAP and generation approach (i.e. the Chebyshev Interaction Model for Efficient Simulation or “ChIMES”), for which resulting IAPs can approach the predictive power of quantum-mechanical approaches at a fraction of the computational expense, and (2) applying the ChIMES framework to develop models for HN3 and DNTF. We find that for simple energetic materials like HN3, high accuracy ChIMES models can be obtained through application of a fitting approach that does not use active machine learning. We demonstrate the suitability of ChIMES models for simulations involving EM by using the HN3 model in multiscale shock technique simulations to predict the HN3 Chapman-Jouguet detonation state and investigate chemical evolution out to 1 ns following shock compression. This model is then used in larger direct shock (DS) simulations for a preliminary investigation of how bubbles (i.e. voids) influence material response under shock compression. We find that more complex EM (i.e. DNTF) necessitate a more sophisticated fitting approach, and develop a new active learning method and python tool to meet this challenge. We demonstrate that this fitting approach yields ChIMES models that out-perform commonly used standard reactive IAPs as well as semi-empirical quantum methods, and discuss the systematic improvability of these actively learned ChIMES models. We also describe challenges related to model development for EM such as DNTF, for which few experimental or previous simulation data are available (e.g. which could otherwise inform generation of training data). To overcome this issue, we establish a semi-empirical quantum ChIMES capability which can be used to efficiently map out relevant thermodynamic and configurational space, and generate ChIMES-IAP training data in a multiscale manner. We also show that these semi-empirical quantum ChIMES models can be used to generate predictions for the shock Hugoniot (the Hugoniot is the locus of thermodynamic states found in a shocked material) equation of state, investigate related thermochemistry, and explore carbon condensation following shock compression. This work represents a substantial advance in our atomistic modeling capability for EM that will provide much needed information on the chemistry of detonation for continued development of continuum models based on the Cheetah thermochemical code.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On the Approximability of Random-Hypergraph MAX-3-XORSAT Problems with Quantum Algorithms

Constraint satisfaction problems are an important area of computer science. Many of these problems are in the complexity class NP which is exponentially hard for all known methods, both for worst cases and often typical. Fundamentally, the lack of any guided local minimum escape method ensures the hardness of both exact and approximate optimization classically, but the intuitive mechanism for approximation hardness in quantum algorithms based on Hamiltonian time evolution is poorly understood. We explore this question using the prototypically hard MAX-3-XORSAT problem class. We conclude that the mechanisms for quantum exact and approximation hardness are fundamentally distinct. We qualitatively identify why traditional methods such as quantum adiabatic optimization are not good approximation algorithms. We propose a new spectral folding optimization method that does not suffer from these issues and study it analytically and numerically. We consider random rank-3 hypergraphs including extremal planted solution instances, where the ground state satisfies an anomalously high fraction of constraints compared to truly random problems. We show that, if we define the energy to be $E = N_{unsat}-N_{sat}$, then spectrally folded quantum optimization will return states with energy $E \leq A E_{GS}$ (where $E_{GS}$ is the ground state energy) in polynomial time, where conservatively, $A \simeq 0.6$. We thoroughly benchmark variations of spectrally folded quantum optimization for random classically approximation-hard (planted solution) instances in simulation, and find performance consistent with this prediction. We do not claim that this approximation guarantee holds for all possible hypergraphs, though our algorithm's mechanism can likely generalize widely. These results suggest that quantum computers are more powerful for approximate optimization than had been previously assumed.

Kapit, Eliot↗

Resilience–runtime tradeoff relations for quantum algorithms

Abstract A leading approach to algorithm design aims to minimize the number of operations in an algorithm’s compilation. One intuitively expects that reducing the number of operations may decrease the chance of errors. This paradigm is particularly prevalent in quantum computing, where gates are hard to implement and noise rapidly decreases a quantum computer’s potential to outperform classical computers. Here, we find that minimizing the number of operations in a quantum algorithm can be counterproductive, leading to a noise sensitivity that induces errors when running the algorithm in non-ideal conditions. To show this, we develop a framework to characterize the resilience of an algorithm to perturbative noises (including coherent errors, dephasing, and depolarizing noise). Some compilations of an algorithm can be resilient against certain noise sources while being unstable against other noises. We condense these results into a tradeoff relation between an algorithm’s number of operations and its noise resilience. We also show how this framework can be leveraged to identify compilations of an algorithm that are better suited to withstand certain noises.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Grain boundary segregation in BCC vanadium-based alloys: Quantum-accurate computed segregation spectra and targeted experimental validations

Grain boundaries are critically important to the material performance of fusion reactor materials such as vanadium, particularly mechanical properties and irradiation resistance. A key challenge to the design and control of grain boundaries in vanadium alloys is the lack of quantitative data on grain boundary segregation. In this study, we combine computational and experimental methods to address this gap. Furthermore, using a machine learning-accelerated quantum mechanics/molecular mechanics approach, we calculated the segregation spectra for 28 transition metal elements in polycrystalline vanadium, and validated these predictions experimentally for a subset of solutes that sample a range of segregation behavior, specifically zirconium, titanium, and tungsten, using analytical transmission electron microscopy. Furthermore, the agreement between experiment and theory highlights the predictive capability of our approach. Critically, this work provides a comprehensive database of quantum-accurate solute segregation enthalpies in vanadium, enabling the development of advanced alloys for fusion reactors applications.

Fusion materials↗

Benchmarking noise extrapolation with the OpenPulse control framework

Distilling precise estimates from noisy intermediate scale quantum (NISQ) data has recently attracted considerable attention Kandala et al., Nature (London) 567, 491 (2019). In order to augment digital qubit metrics, such as gate fidelity, we discuss analog error mitigability, i.e., the ability to accurately distill precise observable estimates, as a hybrid quantum classical computing benchmarking task. Specifically, using Rabi oscillations as a test program, we characterize single qubit error rates on IBM's Poughkeepsie superconducting quantum hardware, incorporate control-mediated noise dependence into a generalized rescaling protocol, and analyze how noise characteristics influence Richardson extrapolation-based error mitigation. Finally, our results identify regions in the space of Hamiltonian control fields and circuit depth which are most amenable to reliable noise extrapolation, as well as shed light on how low-level hardware characterization can be used as a predictive tool for uncertainty quantification in error-mitigated NISQ computations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Algorithm Implementations for Beginners

As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available quantum computers have less than 100 qubits, quantum computing hardware is widely expected to grow in terms of qubit count, quality, and connectivity. This review aims at explaining the principles of quantum programming, which are quite different from classical programming, with straightforward algebra that makes understanding of the underlying fascinating quantum mechanical principles optional. We give an introduction to quantum computing algorithms and their implementation on real quantum hardware. We survey 20 different quantum algorithms, attempting to describe each in a succinct and self-contained fashion. We show how these algorithms can be implemented on IBM’s quantum computer, and in each case, we discuss the results of the implementation with respect to differences between the simulator and the actual hardware runs. This article introduces computer scientists, physicists, and engineers to quantum algorithms and provides a blueprint for their implementations.

97 MATHEMATICS AND COMPUTING↗

Error mitigation, optimization, and extrapolation on a trapped-ion testbed

Current noisy intermediate-scale quantum (NISQ) trapped-ion devices are subject to errors which can significantly impact the accuracy of calculations if left unchecked. A form of error mitigation called zero noise extrapolation (ZNE) can decrease an algorithm’s sensitivity to these errors without increasing the number of required qubits. Here we explore different methods for integrating this error mitigation technique into the Variational Quantum Eigensolver (VQE) algorithm for calculating the ground state of the HeH + molecule at 0.8 Å in the presence of experimental noise. Using the Quantum Scientific Computing Open User Testbed (QSCOUT) trapped-ion device, we test three methods of scaling noise for extrapolation: time stretching the two-qubit gates, scaling the sideband detuning parameter, and inserting two-qubit gate identity operations into the ansatz circuit. We find that time stretching and sideband detuning scaling fail to scale the noise on our particular hardware in a way that can be extrapolated to zero noise. Scaling our noise with global gate identity insertions and extrapolating after variational optimization, we achieve error suppression of 96.8%, resulting in an energy estimate within –0.004 ± 0.04 hartree of the ground state energy. This is an improvement, but still outside the chemical accuracy threshold of 0.0016 hartree. Furthermore, our results show that the efficacy of this error mitigation technique depends on choosing the correct implementation for a given device architecture.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Predicting Hugoniot equation of state in erythritol with ab initio and reactive molecular dynamics

Erythritol has been proposed as an inert surrogate for developing theoretical and computational models to study aging in energetic materials. In this work, we present a comparison of mechanical and shock properties of erythritol computed using the ReaxFF reactive force field and from ab initio calculations employing density functional theory (DFT). We screened eight different ReaxFF parameterizations, of which the CHO parameters developed for hydrocarbon oxidation provide the most accurate predictions of mechanical properties and the crystal structure of erythritol. Further validation of the applicability of this ReaxFF parameterization for modeling erythritol is demonstrated by comparing predictions of the elastic constants, crystal structure, vibrational density of states, and Hugoniot curves against DFT calculations. The ReaxFF predictions are in close agreement with the DFT simulations for the elastic constants and shock Hugoniot when the crystal is loaded along its c axis but show as much as 30% disagreement in the elastic constants in the ab plane and 12% difference in shock pressures when shocked along the a or b crystal axes. Last, we compare thermomechanical properties predicted from classical molecular dynamics with those calculated using the quasi-harmonic approximation and show that quantum mechanical effects produce large discrepancies in the computed values of heat capacity and thermal expansion coefficients compared with classical assumptions. Combining classical molecular dynamics predictions of mechanical behavior with phonon-based calculations of thermal behaviors, we show that predicted shock-induced temperatures for pressures up to 6.5 GPa do not exceed the pressure-dependent melting point of erythritol.

Hu, Jing↗

A Scalable Quantum Cryptography Network for Protected Automation Communication (Final Report)

This is the final report for a CEDS-funded project aimed at developing a new quantum technology for securing utility communication networks used to control and monitor electrical grid equipment. Securing these control networks represents a unique challenge as the performance of the security solution has a direct impact on the stability and reliability of the electrical grid. Traditional, software-based solutions - developed for information networks - are not suitable for utility control networks because they introduce latency, require burdensome maintenance and upgrades, are often incompatible with legacy equipment, and introduce operational complexity that reduces grid reliability. Consequently, many U.S. utilities do not use existing solutions and, instead, protect their critical control networks through the careful isolation and obscuration of their networked equipment. With more utilities embracing grid automation, the attack surface that utilities must defend from hackers has grown to an unmanageable size. To address this situation, Qubitekk and its partners proposed and developed a hardware-based solution that can secure critical control networks without negatively impacting grid performance. This new solution is based on quantum key distribution (QKD) techniques that guarantee secure key generation and distribution across a utility control network. Through deployment and field testing of a prototype QKD system, we have shown that this solution delivers long-term network security, is technically feasible to implement and maintain on a utility’s distribution substation network and does not negatively impact grid operations. In addition, the project has identified and solved key challenges associated with generating, transmitting, and measuring coherent photonic quantum states on a real-world fiber optic network. These additional findings are playing a critical role in advancing quantum networks for quantum computing applications. An overview of the QKD prototype development effort, field testing activities and results, and additional findings relevant to emerging quantum networks are presented in this report.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Nearly optimal state preparation for quantum simulations of lattice gauge theories

Here, we present several improvements to the recently developed ground-state preparation algorithm based on the quantum eigenvalue transformation for unitary matrices (QETU), apply this algorithm to a lattice formulation of U(1) gauge theory in (2+1) dimensions, as well as propose an alternative application of QETU, a highly efficient preparation of Gaussian distributions. The QETU technique was originally proposed as an algorithm for nearly optimal ground-state preparation and ground-state energy estimation on early fault-tolerant devices. It uses the time-evolution input model, which can potentially overcome the large overall prefactor in the asymptotic gate cost arising in similar algorithms based on the Hamiltonian input model. We present modifications to the original QETU algorithm that significantly reduce the cost for the cases of both exact and Trotterized implementation of the time evolution circuit. We use QETU to prepare the ground state of a U(1) lattice gauge theory in two spatial dimensions, explore the dependence of computational resources on the desired precision and system parameters, and discuss the applicability of our results to general lattice gauge theories. We also demonstrate how the QETU technique can be utilized for preparing Gaussian distributions and wave packets in a way which outperforms existing algorithms for as little as n q ≳ 2–5 qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗