Search NASA⌕ Search

SEARCH · Search NASA

Results for “hybrid algorithm”

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

Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations

We develop new approximate compilation schemes that significantly reduce the expense of compiling the Quantum Approximate Optimization Algorithm (QAOA) for solving the Max-Cut problem. Our main focus is on compilation with trapped-ion simulators using Pauli-X operations and all-to-all Ising Hamiltonian HIsing evolution generated by Molmer-Sorensen or optical dipole force interactions, though some of our results also apply to standard gate-based compilations. Our results are based on principles of graph sparsification and decomposition; the former reduces the number of edges in a graph while maintaining its cut structure, while the latter breaks a weighted graph into a small number of unweighted graphs. Though these techniques have been used as heuristics in various hybrid quantum algorithms, there have been no guarantees on their performance, to the best of our knowledge. This work provides the first provable guarantees using sparsification and decomposition to improve quantum noise resilience and reduce quantum circuit complexity. For quantum hardware that uses edge-by-edge QAOA compilations, sparsification leads to a direct reduction in circuit complexity. For trapped-ion quantum simulators implementing all-to-all HIsing pulses, we show that for a (1−ϵ) factor loss in the Max-Cut approximation (ϵ>0), our compilations improve the (worst-case) number of HIsing pulses from O(n2) to O(nlog(n/ϵ)) and the (worst-case) number of Pauli-X bit flips from O(n2) to O(nlog(n/ϵ)ϵ2) for n-node graphs. This is an asymptotic improvement for any constant ϵ>0. We demonstrate that significant improvements to the approximation ratio are obtained using decomposition in simulated trapped-ion experiments with dephasing noise. We further present a generic argument showing that sparsification results in an exponentially improved circuit fidelity lower bound in digital computing schemes based on one- and two-qubit gates, which are relevant to a wide variety of hardwares such as superconducting qubits and certain neutral atom or trapped ion setups, and more sophisticated noise models. We anticipate these approximate compilation techniques will be useful tools in a variety of future quantum computing experiments.

Moondra, Jai [Georgia Institute of Technology]↗

Genetic Algorithm Optimization of a Cost Competitive Hybrid Rocket Booster

Performance, reliability and cost have always been drivers in the rocket business. Hybrid rockets have been late entries into the launch business due to substantial early development work on liquid rockets and later on solid rockets. Slowly the technology readiness level of hybrids has been increasing due to various large scale testing and flight tests of hybrid rockets. A remaining issue is the cost of hybrids vs the existing launch propulsion systems. This paper will review the known state of the art hybrid development work to date and incorporate it into a genetic algorithm to optimize the configuration based on various parameters. A cost module will be incorporated to the code based on the weights of the components. The design will be optimized on meeting the performance requirements at the lowest cost.

Story, George↗

Genetic Algorithm Optimization of a Cost Competitive Hybrid Rocket Booster

Performance, reliability and cost have always been drivers in the rocket business. Hybrid rockets have been late entries into the launch business due to substantial early development work on liquid rockets and solid rockets. Slowly the technology readiness level of hybrids has been increasing due to various large scale testing and flight tests of hybrid rockets. One remaining issue is the cost of hybrids versus the existing launch propulsion systems. This paper will review the known state-of-the-art hybrid development work to date and incorporate it into a genetic algorithm to optimize the configuration based on various parameters. A cost module will be incorporated to the code based on the weights of the components. The design will be optimized on meeting the performance requirements at the lowest cost.

Story, George↗

Arbitrage and Capacity Firming in Coordination with Day-Ahead Bidding of a Hybrid PV Plant: Preprint

A hybrid PV plant (HPP) combines a photovoltaic (PV) plant with a battery energy storage system (BESS), which is considered a promising step towards the future of renewable power plants by the U.S. Department of Energy. When the renewable penetration reaches a significant level, a hybrid PV plant can bid in as a controllable thermal plant in the future electricity market. In this study, a bidding and BESS scheduling model is proposed for the HPP. The robust optimization (RO) technique has been utilized to identify the worst-case scenario of uncertainties during the bidding process. To address the overly conservative issue of the single-stage RO, we have decoupled the BESS schedule for arbitrage and PV capacity firming by a two-stage RO formulation. By comparing the output of single-stage RO and two-stage RO, the two-stage RO bids and schedules in a more aggressive manner, which increases the income of HPP. Also, the penalty of under-generation is considered in our model so that the day-ahead bidding decision and arbitrage schedules can be adjusted based on the potential UNDER-GENERATION penalty. Because the proposed model is non-convex and contains multi-stages, the Column-and-Constraint Generation (C&CG) algorithm is applied to the model as the solution. The proposed model has shown better economic performance compared to a state-of-art single-stage bidding method in case studies.

BESS scheduling↗

A Cartesian-diffusion Langevin method for hybrid kinetic-fluid Coulomb scattering in particle-in-cell plasma simulations

A novel, drag-diffusion Langevin method of hybrid, kinetic-fluid Coulomb scattering in plasmas is presented. Unlike previous methods, the frictional drag is always applied in the simulation frame of reference. The velocity-space diffusion is performed in the stationary-fluid frame of reference when anisotropic, and in the laboratory frame when isotropic. While the general method is mass-ratio independent, we focus on interactions of kinetic-ions and fluid-electrons to show first-order modifications to the electron velocity distribution function that are an important correction for the accurate calculation of electric resistivity. Inclusion of sub-cycling and a limit to the maximum collision frequency is shown to allow for arbitrarily large timesteps without numerical failure. Here the Langevin method is compared with a grid-based binary method and found to require a much less restrictive timestep in cases of ion–electron slowing and temperature equilibration; this finding differs from previous work and is dependent on the mass ratio.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Hybrid simulation of energetic particles interacting with magnetohydrodynamics using a slow manifold algorithm and GPU acceleration

The hybrid method combining particle-in-cell and magnetohydrodynamics can be used to study the interaction between energetic particles and global plasma modes. In this paper we introduce the M3D-C1-K code, which is developed based on the M3D-C1 finite element code solving the magnetohydrodynamics equations, with a newly developed kinetic module simulating energetic particles. The particle pushing is done using a new algorithm by applying the Boris pusher to the classical Pauli particles to simulate the slow-manifold of particle orbits, with long-term accuracy and fidelity. The particle pushing can be accelerated using GPUs with a significant speedup. The moments of the particles are calculated using the δƒ method, and are coupled into the magnetohydrodynamics simulation through pressure or current coupling schemes. Several linear simulations of magnetohydrodynamics modes driven by energetic particles have been conducted using M3D-C1-K with the δƒ method, including fishbone, toroidal Alfvén eigenmodes and reversed shear Alfvén eigenmodes. Good agreement with previous results from other eigenvalue, kinetic and hybrid codes have been achieved.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Leveraging operator learning to accelerate convergence of the preconditioned conjugate gradient method

We propose a new deflation strategy to accelerate the convergence of the preconditioned conjugate gradient (PCG) method for solving parametric large-scale linear systems of equations. Unlike traditional deflation techniques that rely on eigenvector approximations or recycled Krylov subspaces, we generate the deflation subspaces using operator learning, specifically the Deep Operator Network (DeepONet). To this aim, we introduce two complementary approaches for assembling the deflation operators. The first approach approximates near-null space vectors of the discrete PDE operator using the basis functions learned by the DeepONet. The second approach directly leverages solutions predicted by the DeepONet. To further enhance convergence, we also propose several strategies for prescribing the sparsity pattern of the deflation operator. Here, a comprehensive set of numerical experiments encompassing steady-state, time-dependent, scalar, and vector-valued problems posed on both structured and unstructured geometries is presented and demonstrates the effectiveness of the proposed DeepONet-based deflated PCG method, as well as its generalization across a wide range of model parameters and problem resolutions.

Deflation↗

Sustainable network design for multi-purpose pellet processing depots under biomass supply uncertainty

This work develops a two-stage stochastic mixed-integer programming model to manage multi- purpose pellet processing depots under feedstock supply uncertainty. The proposed optimization model would help to minimize cost and to mitigate emissions from the supply chain network. We consider three alternative Biomass Processing and Densi cation Depot (BPDD) technologies; namely, conventional pellet processing, high moisture pellet processing, and ammonia ber expansion. These three technologies pre-process/pre-treat and densify different types of biomass into more highly densi ed intermediate products for different markets in order to improve movability and overall supply network performance in terms of costs and emissions. A hybrid decomposition algorithm was developed that combines sample average approximation with an enhanced Progressive Hedging (PH) algorithm to solve this challenging NP -hard problem. Some heuristics such as Rolling Horizon (RH) heuristic, variable xing technique were later applied to further enhance the PH algorithm. Mississippi and Alabama were selected as a testing ground and ArcGIS was employed to visualize and validate the modeling results. The results of the analysis reveal promising insights that could lead to recommendations to help decision makers achieve a more cost-effective environmentally-friendly supply chain network.

09 BIOMASS FUELS↗

Quantum Orbital Minimization Method for Excited States Calculation on a Quantum Computer

Herein we propose a quantum-classical hybrid variational algorithm, the quantum orbital minimization method (qOMM), for obtaining the ground state and low-lying excited states of a Hermitian operator. Given parametrized ansatz circuits representing eigenstates, qOMM implements quantum circuits to represent the objective function in the orbital minimization method and adopts a classical optimizer to minimize the objective function with respect to the parameters in ansatz circuits. The objective function has an orthogonality constraint implicitly embedded, which allows qOMM to apply a different ansatz circuit to each input reference state. We carry out numerical simulations that seek to find excited states of H 2 , LiH, and a toy model consisting of four hydrogen atoms arranged in a square lattice in the STO-3G basis with UCCSD ansatz circuits. Comparing the numerical results with existing excited states methods, qOMM is less prone to getting stuck in local minima and can achieve convergence with more shallow ansatz circuits.

97 MATHEMATICS AND COMPUTING↗

Prediction of Structures and Atomization Energies of Small Silver Clusters, (Ag) n , n < 100

Neutral silver clusters, Ag n , were studied using density functional theory (DFT) followed by high level coupled cluster CCSD(T) calculations to determine the low energy isomers for each cluster size for small clusters. The normalized atomization energy, heats of formation, and average bond lengths were calculated for each of the different isomeric forms of the silver clusters. For n = 2–6, the preferred geometry is planar, and the larger n = 7–8 clusters prefer higher symmetry, three-dimensional geometries. The low spin state is predicted to be the ground state for every cluster size. A number of new low energy isomers for the heptamer and octamer were found. Additional larger Ag n structures, n < 100, were initially optimized using a tree growth-hybrid genetic algorithm with an embedded atom method (EAM) potential. Finally, for n ≤ 20, DFT was used to optimize the geometries. DFT with benchmarked functionals were used to predict that the normalized atomization energies ((AE)s) for Ag n start to converge slowly to the bulk at n = 55. The (AE) for Ag 99 is predicted to be ~50 kcal/mol.

Environmental Molecular Sciences Laboratory↗

Structures and Stabilities of (MgO) n Nanoclusters

Global minima for (MgO) n structures were optimized using a tree growth–hybrid genetic algorithm in conjunction with MNDO/MNDO/d semiempirical molecular orbital calculations followed by density functional theory geometry optimizations with the B3LYP functional. New lowest energy isomers were found for a number of (MgO) n clusters. The most stable isomers for (MgO) n (n > 3) are 3-dimensional. For n < 20, hexagonal tubular (MgO)n structures are more favored in energy than the cubic structures. The cubic structures and their variations dominate after n = 20. For the cubic isomers, increasing the size of the cluster in any dimension improves the stability. The effectiveness of increasing the size of the cluster in a specific dimension to improve stability diminishes as the size in that dimension increases. For cubic structures of the same size, the most compact cubic structure is expected to be the more stable cubic structure. The average Mg–O bond distance and coordination number both increase as n increases. The calculated average Mg–O bond distance is 2.055 Å at n = 40, slightly smaller than the bulk value of 2.104 Å. The average coordination number is predicted to be 4.6 for the lowest energy (MgO) 40 as compared to the bulk value of 6. As n increases, the normalized clustering energy ΔE(n) for the (MgO) n increases and the slope of the ΔE(n) vs n curve decreases. The value of ΔE(40) is predicted to be 150 kcal/mol, as compared to the bulk value ΔE(∞) = 176 kcal/mol. Finally, the electronic properties of the clusters are presented and the reactive sites are predicted to be at the corners.

Environmental Molecular Sciences Laboratory↗

Structures and Energetics of (MgCO 3 ) n Clusters ( n ≤ 16)

There is significant interest in the role of carbonate minerals for the storage of CO 2 and the role of prenucleation dusters in their formation. Global minima for (MgCO 3 ) n (n ≤ 16) structures were optimized using a tree growth-hybrid genetic algorithm in conjunction with MNDO/MNDO/d semiempirical molecular orbital calculations followed by density functional theory geometry optimizations with the B3LYP functional. The most stable isomers for (MgCO 3 ) n (n < 5) are approximately 2-dimensional. Mg can be bonded to one or two 0 atoms of a CO 3 2- , and the 1-O bonding scheme is more favored as the cluster becomes larger. The average C-Mg coordination number increases as the cluster size increases, and at n = 16, the average C-Mg coordination number was calculated to be 5.2. The normalized dissociation energy to form monomers increases as n increases. At n = 16, the normalized dissociation energy is calculated to be 116.2 kcal/mol, as compared to the bulk value of 153.9 kcal/mol. The adiabatic reaction energies for the recombination reactions of (MgO) n clusters and CO 2 to form (MgCO 3 ) n were calculated. The exothermicity of the normalized recombination energy < RE >(CO 2 ) decreases as n increases and converged to the experimental bulk limit rapidly. The normalized recombination energy < RE >(CO 2 ) was calculated to be -52.2 kcal/mol for the monomer and -30.7 kcal/mol for n = 16, as compared to the experimental value of -27.9 kcal/mol for the solid phase reaction. Infrared spectra for the lowest energy isomers were calculated, and absorption bands in the previous experimental infrared studies were assigned with our density functional theory predictions. The 13 C, 17 O, and 25 Mg NMR chemical shifts for the clusters were predicted. We found that the results provide insights into the structural and energetic transitions from nanoclusters of (MgCO 3 ) n to the bulk and the spectroscopic properties of clusters for their experimental identification.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Experimental determination of the complex stiffness tensor and Euler angles in anisotropic media using ultrasonic waves

The aim of this work is to measure the complex elastic tensor and Euler angles in very complex anisotropic media like austenitic steel welds, by inverse problem resolution from experimental data. The obtained experimental characteristics of the anisotropic material will be injected in a FE code developed by EDF enabling the simulation of an actual ultrasonic NDE of welds. The present work aims to provide reliable input data to the 3D future development of the code. In particular, this complex elastic tensor will allow to predict by modeling beam skewing ant attenuation in an austenitic weld. The investigation of such anisotropic media is very complex because of the directional dependency of the elastic stiffness tensor. Then we will discuss the use of a hybrid genetic algorithm to overcome this difficulty. The identification method is based on waveforms spectra reconstruction associated to a physical model describing wave propagation in plates, during underwater measurements. The entire procedure is qualified and validated using simulated data. Moreover, a comparison of the estimated elastic coefficients with literature values and ultrasonic measurements obtained in transmission is also given, at the end of the paper.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mesoscopic-microscopic spatial stochastic simulation with automatic system partitioning

The reaction-diffusion master equation (RDME) is a model that allows for efficient on-lattice simulation of spatially resolved stochastic chemical kinetics. Compared to off-lattice hard-sphere simulations with Brownian dynamics or Green’s function reaction dynamics, the RDME can be orders of magnitude faster if the lattice spacing can be chosen coarse enough. However, strongly diffusion-controlled reactions mandate a very fine mesh resolution for acceptable accuracy. It is common that reactions in the same model differ in their degree of diffusion control and therefore require different degrees of mesh resolution. This renders mesoscopic simulation inefficient for systems with multiscale properties. Mesoscopic-microscopic hybrid methods address this problem by resolving the most challenging reactions with a microscale, off-lattice simulation. However, all methods to date require manual partitioning of a system, effectively limiting their usefulness as “black-box” simulation codes. In this paper, we propose a hybrid simulation algorithm with automatic system partitioning based on indirect a priori error estimates. We demonstrate the accuracy and efficiency of the method on models of diffusion-controlled networks in 3D.

97 MATHEMATICS AND COMPUTING↗

Magnetic phases of spatially modulated spin-1 chains in Rydberg excitons: Classical and quantum simulations

Here, in this work, we study the magnetic phases of a spatially modulated chain of spin-1 Rydberg excitons. Using the Density Matrix Renormalization Group (DMRG) technique, we study various magnetic and topologically nontrivial phases using both single-particle properties, such as local magnetization and quantum entropy, and many-body ones, such as pair-wise Néel and long-range string correlations. In particular, we investigate the emergence and robustness of the Haldane phase, a topological phase of anti-ferromagnetic spin-1 chains. Furthermore, we devise a hybrid quantum algorithm employing restricted Boltzmann machine to simulate the ground state of such a system that shows very good agreement with the results of exact diagonalization and DMRG.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Physics makes the difference: Bayesian optimization and active learning via augmented Gaussian process

Abstract Both experimental and computational methods for the exploration of structure, functionality, and properties of materials often necessitate the search across broad parameter spaces to discover optimal experimental conditions and regions of interest in the image space or parameter space of computational models. The direct grid search of the parameter space tends to be extremely time-consuming, leading to the development of strategies balancing exploration of unknown parameter spaces and exploitation towards required performance metrics. However, classical Bayesian optimization (BO) strategies based on the Gaussian process (GP) do not readily allow for the incorporation of the known physical behaviors or past knowledge. Here we explore a hybrid optimization/exploration algorithm created by augmenting the standard GP with a structured probabilistic model of the expected system’s behavior. This approach balances the flexibility of the non-parametric GP approach with a rigid structure of physical knowledge encoded into the parametric model. The fully Bayesian treatment of the latter allows additional control over the optimization via the selection of priors for the model parameters. The method is demonstrated for a noisy version of a standard univariate test function used to evaluate optimization algorithms and further extended to physical lattice models. This methodology is expected to be universally suitable for injecting prior knowledge in the form of physical models and past data in the BO framework.

42 ENGINEERING↗

Variational Adiabatic Gauge Transformation on Real Quantum Hardware for Effective Low-Energy Hamiltonians and Accurate Diagonalization

Effective low-energy theories represent powerful theoretical tools to reduce the complexity in modeling interacting quantum many-particle systems. However, common theoretical methods rely on perturbation theory, which limits their applicability to weak interactions. Here we introduce the Variational Adiabatic Gauge Transformation (VAGT), a nonperturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit that brings the Hamiltonian to either its block-diagonal or full-diagonal form. If a Hamiltonian can be diagonalized via a shallow quantum circuit, then VAGT can learn the optimal parameters using a polynomial number of runs. The accuracy of VAGT is tested through numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗