Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum machine learning”

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 973 records · Page 54

Physics-Informed Machine Learning for Predictive Turbulence Modeling: Towards a Complete Framework

Although increased availability of computational resources has enabled high-fidelity simulations (e.g., large eddy simulations) of turbulent flows, the Reynolds-Averaged Navier–Stokes (RANS) models are still the dominant tools in industrial applications. However, the predictive capabilities of RANS models are limited by large model-form discrepancies due to the Reynolds stress closure. Recently, a Physics-Informed Machine Learning (PIML) approach has been proposed to learn the functional form of Reynolds stress discrepancy in RANS simulations based on available data. It has been demonstrated that the learned discrepancy function can be used to improve Reynolds stresses in new flows where data are not available. However, due to a number of challenges, the improvements are only demonstrated in the Reynolds stress prediction but not in corresponding propagated quantities of interest (e.g., velocity field). In this work, we investigate the prediction performance on the velocity field by propagating the corrected Reynolds stresses in PIML approach. To enrich the input features, an integrity basis of invariants is implemented. The fully developed turbulent flow in a square duct is used as the test case. The discrepancy model is trained on flow fields from several Reynolds numbers and evaluated on a duct flow at a higher Reynolds number than any of the training cases. The predicted Reynolds stresses are propagated to velocity field via RANS equations. Numerical results show excellent predictive performances in both Reynolds stresses and their propagated velocities, demonstrating the merits of the PIML approach in predictive turbulence modeling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Characterizing Defect Dynamics in Silicon Carbide Using Symmetry-Adapted Collective Variables and Machine Learning Interatomic Potentials

Silicon carbide (SiC) divacancies are attractive candidates for spin-defect qubits possessing long coherence times and optical addressability. The high activation barriers associated with SiC defect formation and motion pose challenges for their study by first-principles molecular dynamics. In this work, we develop and deploy machine learning interatomic potentials (MLIPs) to accelerate defect dynamics simulations while retaining ab initio accuracy. We employ an active learning strategy comprising symmetry-adapted collective variable discovery and enhanced sampling to compile configurationally diverse training data, calculation of energies and forces using density functional theory (DFT), and training of an E(3)-equivariant MLIP based on the Allegro model. Here, the trained MLIP reproduces DFT-level accuracy in defect transition activation free energy barriers, enables the efficient and stable simulation of multidefect 216-atom supercells, and permits an analysis of the temperature dependence of defect thermodynamic stability and formation/annihilation kinetics to propose an optimal annealing temperature to maximally stabilize VV divacancies.

Computer simulations↗

Energy flow networks: deep sets for particle jets

A key question for machine learning approaches in particle physics is how to best represent and learn from collider events. As an event is intrinsically a variable-length unordered set of particles, we build upon recent machine learning efforts to learn directly from sets of features or “point clouds”. Adapting and specializing the “Deep Sets” framework to particle physics, we introduce Energy Flow Networks, which respect infrared and collinear safety by construction. We also develop Particle Flow Networks, which allow for general energy dependence and the inclusion of additional particle-level information such as charge and flavor. These networks feature a per-particle internal (latent) representation, and summing over all particles yields an overall event-level latent representation. We show how this latent space decomposition unifies existing event representations based on detector images and radiation moments. To demonstrate the power and simplicity of this set-based approach, we apply these networks to the collider task of discriminating quark jets from gluon jets, finding similar or improved performance compared to existing methods. We also show how the learned event representation can be directly visualized, providing insight into the inner workings of the model. These architectures lend themselves to efficiently processing and analyzing events for a wide variety of tasks at the Large Hadron Collider. Implementations and examples of our architectures are available online in our EnergyFlow package.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Searching for ternary magnetic Zr–Fe–B compounds through deep machine learning

We use deep machine learning (ML) combined with first-principles calculations to search for energetically favorable ternary magnetic zirconium–iron borides. We show that an iterative ML approach enables efficient screening of vast structural libraries, effectively selecting promising candidates for subsequent first-principles investigations. Twenty-two new Fe-rich ternary compounds with formation energies within 60 meV atom −1 above the known ternary convex hull and with magnetic polarization larger than 0.6 T are identified, among which ten structures exhibit significant uniaxial anisotropy with magnetocrystalline anisotropy constant K 1 ⩾ 0.8 MJ m −3 , including a Zr 2 Fe 14 B phase. Such an ML-guided approach dramatically accelerates the discovery of rare-earth-free permanent magnetic materials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Factors Governing Oxygen Vacancy Formation in Oxide Perovskites

The control of oxygen vacancy (V O ) formation is critical to advancing multiple metal-oxide-perovskite-based technologies. In this work, we report the construction of a compact linear model for the neutral V O formation energy in ABO 3 perovskites that reproduces, with reasonable fidelity, Hubbard-U-corrected density functional theory calculations based on the state-of-the-art, strongly constrained and appropriately normed exchange-correlation functional. We obtain a mean absolute error of 0.45 eV for perovskites stable at 298 K, an accuracy that holds across a large, electronically diverse set of ABO 3 perovskites. Our model considers perovskites containing alkaline-earth metals (Ca, Sr, and Ba) and lanthanides (La and Ce) on the A-site and 3d transition metals (Ti, V, Cr, Mn, Fe, Co, and Ni) on the B-site in six different crystal systems (cubic, tetragonal, orthorhombic, hexagonal, rhombohedral, and monoclinic) common to perovskites. Physically intuitive metrics easily extracted from existing experimental thermochemical data or via inexpensive quantum mechanical calculations, including crystal bond dissociation energies and (solid phase) reduction potentials, are key components of the model. Beyond validation of the model against known experimental trends in materials used in solid oxide fuel cells, the model yields new candidate perovskites not contained in our training data set, such as (Bi,Y)(Fe,Co)O 3 , which we predict may have favorable thermochemical water-splitting properties. The confluence of sufficient accuracy, efficiency, and interpretability afforded by our model not only facilitates high-throughput computational screening for any application that requires the precise control of V O concentrations but also provides a clear picture of the dominant physics governing V O formation in metal-oxide perovskites.

08 HYDROGEN↗

IGBT PEBB Technology for Future High Energy Physics Machine Operation Applications

Terascale physics is driving the demand for innovative pulsed power modulators having greater compactness and better manufacturability with increasingly superior performance. A particularly promising route for such modulators is Marx-architecture based. Moreover, there is opportunity for improvement and gain of greater benefits through further development of topology and architecture, gate driver method, and control schemes. Prior work discussed a new concept of droop correction, which was the result of topology hybridisation using a nesting approach, and illustrated its great potential. This is further investigated here. This paper details various design aspects of a hybrid Marx cell Power Electronic Building Block (PEBB) and includes specifics about estimated losses and efficiency, thermal management issues, protection strategies, gate driver development, and control implementation. In addition, figures-of-merit of the cell design are given for comparison and evaluation purposes. Experimental results, based on both single-cell and three-cell hardware prototypes, are presented demonstrating the functionality and performance of the new topology. This is a significant milestone in the progression toward constructing a full 32-cell PEBB-based Marx klystron modulator with nested droop correction. Lessons learned during various stages of the prototype development and future directions are commented on.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Phase Equilibrium of Water with Hexagonal and Cubic Ice Using the SCAN Functional

Machine learning models are rapidly becoming widely used to simulate complex physicochemical phenomena with ab initio accuracy. Here, we use one such model as well as direct density functional theory (DFT) calculations to investigate the phase equilibrium of water, hexagonal ice (Ih), and cubic ice (Ic), with an eye toward studying ice nucleation. The machine learning model is based on deep neural networks and has been trained on DFT data obtained using the SCAN exchange and correlation functional. We use this model to drive enhanced sampling simulations aimed at calculating a number of complex properties that are out of reach of DFT-driven simulations and then employ an appropriate reweighting procedure to compute the corresponding properties for the SCAN functional. This approach allows us to calculate the melting temperature of both ice polymorphs, the driving force for nucleation, the heat of fusion, the densities at the melting temperature, the relative stability of ices Ih and Ic, and other properties. We find a correct qualitative prediction of all properties of interest. In some cases, quantitative agreement with experiment is better than for state-of-the-art semiempirical potentials for water. Furthermore, our results also show that SCAN correctly predicts that ice Ih is more stable than ice Ic.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Prediction of atomization energy using graph kernel and active learning

Data-driven prediction of molecular properties presents unique challenges to the design of machine learning methods concerning data structure/dimensionality, symmetry adaption, and confidence management. In this paper, we present a kernel-based pipeline that can learn and predict the atomization energy of molecules with high accuracy. The framework employs Gaussian process regression to perform predictions based on the similarity between molecules, which is computed using the marginalized graph kernel. To apply the marginalized graph kernel, a spatial adjacency rule is first employed to convert molecules into graphs whose vertices and edges are labeled by elements and interatomic distances, respectively. We then derive formulas for the efficient evaluation of the kernel. Specific functional components for the marginalized graph kernel are proposed, while the effects of the associated hyperparameters on accuracy and predictive confidence are examined. We show that the graph kernel is particularly suitable for predicting extensive properties because its convolutional structure coincides with that of the covariance formula between sums of random variables. Using an active learning procedure, we demonstrate that the proposed method can achieve a mean absolute error of 0.62 ± 0.01 kcal/mol using as few as 2000 training samples on the QM7 dataset.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Neural-network model for force prediction in multi-principal-element alloys

Atomistic simulations can provide useful insights into the physical properties of multi-principal-element alloys. However, classical potentials mostly fail to capture key quantum (electronic-structure) effects. Here we present a deep 3D convolutional neural network (3D CNN) based framework combined with a voxelization technique to design interatomic potentials for chemically complex alloys. We highlight the performance of the 3D CNN model and its efficacy in computing potentials using the medium-entropy alloy TaNbMo. In order to provide insights into the effect of voxel resolution, we implemented two approaches based on the inner and outer bounding boxes. An efficient 3D CNN model, which is as accurate as the density-functional theory (DFT) approach, for calculating potentials will provide a promising schema for accurate atomistic simulations of structure and dynamics of general multi-principle element alloys.

36 MATERIALS SCIENCE↗

Learning non-Higgsable gauge groups in 4D F-theory

We apply machine learning techniques to solve a specific classification problem in 4D F-theory. For a divisor D on a given complex threefold base, we want to read out the non-Higgsable gauge group on it using local geometric information near D. The input features are the triple intersection numbers among divisors near D and the output label is the non-Higgsable gauge group. We use decision tree to solve this problem and achieved 85%-98% out-of-sample accuracies for different classes of divisors, where the data sets are generated from toric threefold bases without (4,6) curves. We have explicitly generated a large number of analytic rules directly from the decision tree and proved a small number of them. As a crosscheck, we applied these decision trees on bases with (4,6) curves as well and achieved high accuracies. Additionally, we have trained a decision tree to distinguish toric (4,6) curves as well. Finally, we present an application of these analytic rules to construct local base configurations with interesting gauge groups such as SU(3).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Physics-driven learning of Wasserstein GAN for density reconstruction in dynamic tomography

Object density reconstruction from projections containing scattered radiation and noise is of critical importance in many applications. Existing scatter correction and density reconstruction methods may not provide the high accuracy needed in many applications and can break down in the presence of unmodeled or anomalous scatter and other experimental artifacts. Incorporating machine-learning models could prove beneficial for accurate density reconstruction, particularly in dynamic imaging, where the time evolution of the density fields could be captured by partial differential equations or by learning from hydrodynamics simulations. In this work, we demonstrate the ability of learned deep neural networks to perform artifact removal in noisy density reconstructions, where the noise is imperfectly characterized. Here, we use a Wasserstein generative adversarial network (WGAN), where the generator serves as a denoiser that removes artifacts in densities obtained from traditional reconstruction algorithms. We train the networks from large density time-series datasets, with noise simulated according to parametric random distributions that may mimic noise in experiments. The WGAN is trained with noisy density frames as generator inputs, to match the generator outputs to the distribution of clean densities (time series) from simulations. A supervised loss is also included in the training, which leads to an improved density restoration performance. In addition, we employ physics-based constraints such as mass conservation during the network training and application to further enable highly accurate density reconstructions. Our preliminary numerical results show that the models trained in our frameworks can remove significant portions of unknown noise in density time-series data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Polyconvex neural network models of thermoelasticity

Machine-learning function representations such as neural networks have proven to be excellent constructs for constitutive modeling due to their flexibility to represent highly nonlinear data and their ability to incorporate constitutive constraints, which also allows them to generalize well to unseen data. Here, in this work, we extend a polyconvex hyperelastic neural network framework to (isotropic) thermo-hyperelasticity by specifying the thermodynamic and material theoretic requirements for an expansion of the Helmholtz free energy expressed in terms of deformation invariants and temperature. Different formulations which a priori ensure polyconvexity with respect to deformation and concavity with respect to temperature are proposed and discussed. The physics-augmented neural networks are furthermore calibrated with a recently proposed sparsification algorithm that not only aims to fit the training data but also penalizes the number of active parameters, which prevents overfitting in the low data regime and promotes generalization. The performance of the proposed framework is demonstrated on synthetic data, which illustrate the expected thermomechanical phenomena, and existing temperature-dependent uniaxial tension and tension-torsion experimental datasets.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Recurrent convolutional neural networks for modeling nonadiabatic dynamics of quantum-classical systems

Recurrent neural networks (RNNs) have recently been extensively applied to model the time evolution in fluid dynamics, weather predictions, and even chaotic systems due to their ability to capture temporal dependencies and sequential patterns in data. Here we present an RNN model based on convolutional neural networks for modeling the nonlinear nonadiabatic dynamics of hybrid quantum-classical systems. The dynamical evolution of the hybrid systems is governed by equations of motion for classical degrees of freedom and von Neumann equation for electrons. The Physics-Aware Recurrent Convolution (PARC) neural network structure incorporates a differentiator-integrator architecture that inductively models the spatiotemporal dynamics of generic physical systems. Here, we apply our RNN approach to learn the space-time evolution of a one-dimensional semiclassical Holstein model after an interaction quench. For shallow quenches (small changes in electron-lattice coupling), the deterministic dynamics can be accurately captured using a single-CNN-based recurrent network. In contrast, deep quenches induce chaotic evolution, making long-term trajectory prediction significantly more challenging. Nonetheless, we demonstrate that the PARC-CNN architecture can effectively learn the statistical climate of the Holstein model under deep-quench conditions.

Holstein model↗

MICCO: An Enhanced Multi-GPU Scheduling Framework for Many-Body Correlation Functions

Calculation of many-body correlation functions is one of the critical kernels utilized in many scientific computing areas, especially in Lattice Quantum Chromodynamics (Lattice QCD). It is formalized as a sum of a large number of contraction terms each of which can be represented by a graph consisting of vertices describing quarks inside a hadron node and edges designating quark propagations at specific time intervals. Due to its computation- and memory-intensive nature, real-world physics systems (e.g., multi-meson or multi-baryon systems) explored by Lattice QCD prefer to leverage multi-GPUs. Different from general graph processing, many-body correlation function calculations show two specific features: a large number of computation-/data-intensive kernels and frequently repeated appearances of original and intermediate data. The former results in expensive memory operations such as tensor movements and evictions. The latter offers data reuse opportunities to mitigate the data-intensive nature of many-body correlation function calculations. However, existing graph-based multi-GPU schedulers cannot capture these data-centric features, thus resulting in a sub-optimal performance for many-body correlation function calculations. To address this issue, this paper presents a multi-GPU scheduling framework, MICCO, to accelerate contractions for correlation functions particularly by taking the data dimension (e.g., data reuse and data eviction) into account. This work first performs a comprehensive study on the interplay of data reuse and load balance, and designs two new concepts: local reuse pattern and reuse bound to study the opportunity of achieving the optimal trade-off between them. Based on this study, MICCO proposes a heuristic scheduling algorithm and a machine-learning-based regression model to generate the optimal setting of reuse bounds. Specifically, MICCO is integrated into a real-world Lattice QCD system, Redstar, for the first time running on multiple GPUs. The evaluation demonstrates MICCO outperforms other state-of-art works, achieving up to 2.25× speedup in synthesized datasets, and 1.49× speedup in real-world correlation functions.

Wang, Qihan↗

Discovering nuclear models from symbolic machine learning

Numerous phenomenological nuclear models have been proposed to describe specific observables within different regions of the nuclear chart. However, developing a unified model that describes the complex behavior of all nuclei remains an open challenge. Here, we explore whether symbolic Machine Learning (ML) can rediscover traditional nuclear physics models or identify alternatives with improved simplicity, fidelity, and predictive power. To address this challenge, we developed a Multi-objective Iterated Symbolic Regression approach that handles symbolic regressions over multiple target observables, accounts for experimental uncertainties and is robust against high-dimensional problems. As a proof of principle, we applied this method to describe the nuclear binding energies and charge radii of light and medium mass nuclei. Our approach identified simple analytical relationships based on the number of protons and neutrons, providing interpretable models with precision comparable to state-of-the-art nuclear models. Additionally, we integrated this ML-discovered model with an existing complementary model to estimate the limits of nuclear stability. These results highlight the potential of symbolic ML to develop accurate nuclear models and guide our description of complex many-body problems.

Nuclear structure↗

Minimization of Disorder as a Key Design Principle for Natural Sizes of Light Harvesting 2 Complexes

The light harvesting 2 (LH2) complex of purple bacteria has excellent energy conversion efficiency. Clarifying the design principle behind such efficiency at the atomistic level is crucial for understanding its structure–function relationship and can be utilized for the design of artificial light harvesting systems. To this end, we conducted comprehensive computational investigation of the dynamical and statistical nature of electronic excited states of pigment molecules in a natural LH2 complex with 9-fold symmetry and its two non-natural in silico analogues with 6- and 12-fold symmetries. To ensure reliable and efficient all-atomistic molecular dynamics simulations, we combined a well established interpolation approach for the construction of the potential energy surface with a neural network machine learning approach. Outcomes of these calculations clarify that non-natural forms of LH2-type complexes have significantly larger quasistatic disorder than those for the natural one. In addition, non-natural systems have more disruptions of the hydrogen bonding, underscoring its crucial role for reducing the disorder. On the other hand, local environmental dynamics are relatively insensitive to the structural changes although there is moderate enhancement in the anharmonic or interatomic components for the synthetic ones. These findings based on all-atomistic simulations provide direct computational evidence that the structure and sizes of natural LH2 complexes are designed to minimize the energetic disorder. We analyze quantitative implications of these for the energy transferring capability of the LH2 complex.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Selecting XFEL single-particle snapshots by geometric machine learning

A promising new route for structural biology is single-particle imaging with an X-ray Free-Electron Laser (XFEL). This method has the advantage that the samples do not require crystallization and can be examined at room temperature. However, high-resolution structures can only be obtained from a sufficiently large number of diffraction patterns of individual molecules, so-called single particles. Here, we present a method that allows for efficient identification of single particles in very large XFEL datasets, operates at low signal levels, and is tolerant to background. This method uses supervised Geometric Machine Learning (GML) to extract low-dimensional feature vectors from a training dataset, fuse test datasets into the feature space of training datasets, and separate the data into binary distributions of “single particles” and “non-single particles.” As a proof of principle, we tested simulated and experimental datasets of the Coliphage PR772 virus. We created a training dataset and classified three types of test datasets: First, a noise-free simulated test dataset, which gave near perfect separation. Second, simulated test datasets that were modified to reflect different levels of photon counts and background noise. These modified datasets were used to quantify the predictive limits of our approach. Third, an experimental dataset collected at the Stanford Linear Accelerator Center. The single-particle identification for this experimental dataset was compared with previously published results and it was found that GML covers a wide photon-count range, outperforming other single-particle identification methods. Moreover, a major advantage of GML is its ability to retrieve single particles in the presence of structural variability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗