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 397 records · Page 22

Optimization Stability in Excited-State-Specific Variational Monte Carlo

Here, we investigate the issue of optimization stability in variance-based state-specific variational Monte Carlo, discussing the roles of the objective function, the complexity of wave function ansatz, the amount of sampling effort, and the choice of minimization algorithm. Using a small cyanine dye molecule as a test case, we systematically perform minimizations using variants of the linear method as both a standalone algorithm and in a hybrid combination with accelerated descent. We demonstrate that adaptive step control is crucial for maintaining the linear method's stability when optimizing complicated wave functions and that the hybrid method enjoys both greater stability and minimization performance.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Implicit flux-split schemes for the Euler equations

Recent progress in the development of implicit algorithms for the Euler equations using the flux-vector splitting method is described. Comparisons of the relative efficiency of relaxation and spatially-split approximately factored methods on a vector processor for two-dimensional flows are made. For transonic flows, the higher convergence rate per iteration of the Gauss-Seidel relaxation algorithms, which are only partially vectorizable, is amply compensated for by the faster computational rate per iteration of the approximately factored algorithm. For supersonic flows, the fully-upwind line-relaxation method is more efficient since the numerical domain of dependence is more closely matched to the physical domain of dependence. A hybrid three-dimensional algorithm using relaxation in one coordinate direction and approximate factorization in the cross-flow plane is developed and applied to a forebody shape at supersonic speeds and a swept, tapered wing at transonic speeds.

Thomas, J. L.↗

Three-Phase Solid Oxide Fuel Cell Anode Microstructure Realization Using Two-Point Correlation Functions

A Monte Carlo methodology is developed as a means for three-dimensional (3D) reconstruction of the microstructure of a three-phase anode used in solid oxide fuel cells, based on two-point statistical functions. The salient feature of the presented reconstruction methodology is the ability to realize the 3D microstructure from its 2D SEM image for a three-phase medium extendable to n-phase media. In the realization procedure, different phases of the heterogeneous medium are represented by different cells which are allowed to grow. The growth of cells, however, are controlled via several optimization parameters related to rotation, shrinkage, translation, distribution and growth rates of the cells. Indeed, the proposed realization algorithm can be categorized as a member of dynamic programming methods and is designed so comprehensive that can realize any desired microstructure. To be more specific, at first the initial 2D image is successfully reconstructed and then the final optimization parameters are used as the initial values for the initiation of the 3D reconstruction algorithm. This paper presents a novel hybrid stochastic methodology based on the colony and kinetic algorithm for the simulation of the virtual microstructure. The simulation procedure involves repeated realizations where each realization in turn consists of nucleation and growth of cells. For each of the subsequent realizations, the controlling parameters get updated by minimization of an objective function at the end of the preceding realization. Here, the objective function is defined based on the two-point correlation functions from the simulated and real microstructures. The kinetic growth algorithm is established on the cellular automata approach which facilitates the simulation procedure. Comparison of the two-point correlation functions from different sections of the final 3D reconstructed microstructure with the initial real microstructure shows a satisfactory agreement which confirms the proposed methodology.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Near-optimal ground state preparation

Preparing the ground state of a given Hamiltonian and estimating its ground energy are important but computationally hard tasks. However, given some additional information, these problems can be solved efficiently on a quantum computer. We assume that an initial state with non-trivial overlap with the ground state can be efficiently prepared, and the spectral gap between the ground energy and the first excited energy is bounded from below. With these assumptions we design an algorithm that prepares the ground state when an upper bound of the ground energy is known, whose runtime has a logarithmic dependence on the inverse error. When such an upper bound is not known, we propose a hybrid quantum-classical algorithm to estimate the ground energy, where the dependence of the number of queries to the initial state on the desired precision is exponentially improved compared to the current state-of-the-art algorithm proposed in [Ge et al. 2019]. These two algorithms can then be combined to prepare a ground state without knowing an upper bound of the ground energy. We also prove that our algorithms reach the complexity lower bounds by applying it to the unstructured search problem and the quantum approximate counting problem.

97 MATHEMATICS AND COMPUTING↗

Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum Algorithms

The quantum approximate optimization algorithm (QAOA) has enjoyed increasing attention in noisy, intermediate-scale quantum computing with its application to combinatorial optimization problems. QAOA has the potential to demonstrate a quantum advantage for NP-hard combinatorial optimization problems. As a hybrid quantum-classical algorithm, the classical component of QAOA resembles a simulation optimization problem in which the simulation outcomes are attainable only through a quantum computer. The simulation that derives from QAOA exhibits two unique features that can have a substantial impact on the optimization process: (i) the variance of the stochastic objective values typically decreases in proportion to the optimality gap, and (ii) querying samples from a quantum computer introduces an additional latency overhead. In this paper, we introduce a novel stochastic trust-region method derived from a derivative-free, adaptive sampling trust-region optimization method intended to efficiently solve the classical optimization problem in QAOA by explicitly taking into account the two mentioned characteristics. The key idea behind the proposed algorithm involves constructing two separate local models in each iteration: a model of the objective function and a model of the variance of the objective function. Exploiting the variance model allows us to restrict the number of communications with the quantum computer and also helps navigate the nonconvex objective landscapes typical in QAOA optimization problems. In conclusion, we numerically demonstrate the superiority of our proposed algorithm using the SimOpt library and Qiskit when we consider a metric of computational burden that explicitly accounts for communication costs.

Derivative-free Optimization↗

Single- and Multiple-Objective Optimization with Differential Evolution and Neural Networks

Genetic and evolutionary algorithms have been applied to solve numerous problems in engineering design where they have been used primarily as optimization procedures. These methods have an advantage over conventional gradient-based search procedures became they are capable of finding global optima of multi-modal functions and searching design spaces with disjoint feasible regions. They are also robust in the presence of noisy data. Another desirable feature of these methods is that they can efficiently use distributed and parallel computing resources since multiple function evaluations (flow simulations in aerodynamics design) can be performed simultaneously and independently on ultiple processors. For these reasons genetic and evolutionary algorithms are being used more frequently in design optimization. Examples include airfoil and wing design and compressor and turbine airfoil design. They are also finding increasing use in multiple-objective and multidisciplinary optimization. This lecture will focus on an evolutionary method that is a relatively new member to the general class of evolutionary methods called differential evolution (DE). This method is easy to use and program and it requires relatively few user-specified constants. These constants are easily determined for a wide class of problems. Fine-tuning the constants will off course yield the solution to the optimization problem at hand more rapidly. DE can be efficiently implemented on parallel computers and can be used for continuous, discrete and mixed discrete/continuous optimization problems. It does not require the objective function to be continuous and is noise tolerant. DE and applications to single and multiple-objective optimization will be included in the presentation and lecture notes. A method for aerodynamic design optimization that is based on neural networks will also be included as a part of this lecture. The method offers advantages over traditional optimization methods. It is more flexible than other methods in dealing with design in the context of both steady and unsteady flows, partial and complete data sets, combined experimental and numerical data, inclusion of various constraints and rules of thumb, and other issues that characterize the aerodynamic design process. Neural networks provide a natural framework within which a succession of numerical solutions of increasing fidelity, incorporating more realistic flow physics, can be represented and utilized for optimization. Neural networks also offer an excellent framework for multiple-objective and multi-disciplinary design optimization. Simulation tools from various disciplines can be integrated within this framework and rapid trade-off studies involving one or many disciplines can be performed. The prospect of combining neural network based optimization methods and evolutionary algorithms to obtain a hybrid method with the best properties of both methods will be included in this presentation. Achieving solution diversity and accurate convergence to the exact Pareto front in multiple objective optimization usually requires a significant computational effort with evolutionary algorithms. In this lecture we will also explore the possibility of using neural networks to obtain estimates of the Pareto optimal front using non-dominated solutions generated by DE as training data. Neural network estimators have the potential advantage of reducing the number of function evaluations required to obtain solution accuracy and diversity, thus reducing cost to design.

Rai, Man Mohan↗

Variational quantum and neural quantum states algorithms for the linear complementarity problem

Variational quantum algorithms (VQAs) are promising hybrid quantum-classical methods designed to leverage the computational advantages of quantum computing while mitigating the limitations of current noisy intermediate-scale quantum (NISQ) hardware. Although VQAs have been demonstrated as proofs of concept, their practical utility in solving real-world problems—and whether quantum-inspired classical algorithms can match their performance—remains an open question. We present a novel application of the variational quantum linear solver (VQLS) and its classical neural quantum states-based counterpart, the variational neural linear solver (VNLS), as key components within a minimum map Newton solver for a complementarity-based rigid-body contact model. We demonstrate using the VNLS that our solver accurately simulates the dynamics of rigid spherical bodies during collision events. These results suggest that quantum and quantum-inspired linear algebra algorithms can serve as viable alternatives to standard linear algebra solvers for modelling certain physical systems.

neural quantum states↗

Parallel Breadth-First Search on Distributed Memory Systems

Data-intensive, graph-based computations are pervasive in several scientific applications, and are known to be quite challenging to implement on distributed memory systems. In this work, we explore the design space of parallel algorithms for Breadth-First Search (BFS), a key subroutine in several graph algorithms. We present two highly-tuned parallel approaches for BFS on large parallel systems: a level-synchronous strategy that relies on a simple vertex-based partitioning of the graph, and a two-dimensional sparse matrix-partitioning-based approach that mitigates parallel communication overhead. For both approaches, we also present hybrid versions with intra-node multithreading. Our novel hybrid two-dimensional algorithm reduces communication times by up to a factor of 3.5, relative to a common vertex based approach. Our experimental study identifies execution regimes in which these approaches will be competitive, and we demonstrate extremely high performance on leading distributed-memory parallel systems. For instance, for a 40,000-core parallel execution on Hopper, an AMD Magny-Cours based system, we achieve a BFS performance rate of 17.8 billion edge visits per second on an undirected graph of 4.3 billion vertices and 68.7 billion edges with skewed degree distribution.

97 MATHEMATICS AND COMPUTING↗

Diagnosing Hybrid Systems: a Bayesian Model Selection Approach

In this paper we examine the problem of monitoring and diagnosing noisy complex dynamical systems that are modeled as hybrid systems-models of continuous behavior, interleaved by discrete transitions. In particular, we examine continuous systems with embedded supervisory controllers that experience abrupt, partial or full failure of component devices. Building on our previous work in this area (MBCG99;MBCG00), our specific focus in this paper ins on the mathematical formulation of the hybrid monitoring and diagnosis task as a Bayesian model tracking algorithm. The nonlinear dynamics of many hybrid systems present challenges to probabilistic tracking. Further, probabilistic tracking of a system for the purposes of diagnosis is problematic because the models of the system corresponding to failure modes are numerous and generally very unlikely. To focus tracking on these unlikely models and to reduce the number of potential models under consideration, we exploit logic-based techniques for qualitative model-based diagnosis to conjecture a limited initial set of consistent candidate models. In this paper we discuss alternative tracking techniques that are relevant to different classes of hybrid systems, focusing specifically on a method for tracking multiple models of nonlinear behavior simultaneously using factored sampling and conditional density propagation. To illustrate and motivate the approach described in this paper we examine the problem of monitoring and diganosing NASA's Sprint AERCam, a small spherical robotic camera unit with 12 thrusters that enable both linear and rotational motion.

McIlraith, Sheila A.↗

Mosaics , The Best of Both Worlds: Analog devices with Digital Spiking Communication to build a Hybrid Neural Network Accelerator

Neuromorphic architectures have seen a resurgence of interest in the past decade owing to 100x-1000x efficiency gain over conventional Von Neumann architectures. Digital neuromorphic chips like Intel's Loihi have shown efficiency gains compared to GPUs and CPUs and can be scaled to build larger systems. Analog neuromorphic architectures promise even further savings in energy efficiency, area, and latency than their digital counterparts. Neuromorphic analog and digital technologies provide both low-power and configurable acceleration of challenging artificial intelligence (AI) algorithms. We present a hybrid analog-digital neuromorphic architecture that can amplify the advantages of both high-density analog memory and spike-based digital communication while mitigating each of the other approaches' limitations.

97 MATHEMATICS AND COMPUTING↗

Strategic planning for power system restorations

This paper considers the power system restoration planning problem (PSRPP) for disaster recovery, a fundamental problem faced by all populated areas. PSRPPs are complex stochastic optimization problems that combine resource allocation, warehouse location, and vehicle routing considerations. Furthermore, electrical power systems are complex systems whose behavior can only be determined by physics simulations. Moreover, these problems must be solved under tight runtime constraints to be practical in real-world disaster situations. This work is three fold: (1) it formalizes the specification of PSRPPs; (2) introduces a simple optimization-simulation hybridization necessary for solving PSRPPs; and (3) presents a complete restoration algorithm that utilizes the strengths of mixed integer programming, constraint programming, and large neighborhood search. This paper studied a novel problem in the field of humanitarian logistics, the Power System Restoration Problem (PSRPP). The PSRPP models the strategic planning process for post disaster power system recovery. The paper proposed a multi-stage stochastic hybrid optimization algorithm that yields high quality solutions to real-world benchmarks provided by Los Alamos National Laboratory (LANL). The algorithm uses a variety of technologies, including MIP, constraint programming, and large neighborhood search, to exploit the structure of each individual optimization subproblem. The experimental results on hurricane disaster benchmarks indicate that the algorithm is practical from a computational standpoint and produce significant improvements over existing relief delivery procedures.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Gutzwiller hybrid quantum-classical computing approach for correlated materials

Rapid progress in noisy intermediate-scale quantum (NISQ) computing technology has led to the development of novel resource-efficient hybrid quantum-classical algorithms, such as the variational quantum eigensolver (VQE), that can address open challenges in quantum chemistry, physics, and material science. Proof-of-principle quantum chemistry simulations for small molecules have been demonstrated on NISQ devices. While several approaches have been theoretically proposed for correlated materials, NISQ simulations of interacting periodic models on current quantum devices have not yet been demonstrated. Here, we develop a hybrid quantum-classical simulation framework for correlated electron systems based on the Gutzwiller variational embedding approach. We implement this framework on Rigetti quantum processing units (QPUs) and apply it to the periodic Anderson model, which describes a correlated heavy electron band hybridizing with noninteracting conduction electrons. Our simulation results quantitatively reproduce the known ground state quantum phase diagram including metallic, Kondo and Mott insulating phases. This is the first fully self-consistent hybrid quantum-classical simulation of an infinite correlated lattice model executed on QPUs, demonstrating that the Gutzwiller hybrid quantum-classical embedding framework is a powerful approach to simulate correlated materials on NISQ hardware. This benchmark study also puts forth a concrete pathway towards practical quantum advantage on NISQ devices.

36 MATERIALS SCIENCE↗

Quantum-assisted associative adversarial network: applying quantum annealing in deep learning

Abstract Generative models have the capacity to model and generate new examples from a dataset and have an increasingly diverse set of applications driven by commercial and academic interest. In this work, we present an algorithm for learning a latent variable generative model via generative adversarial learning where the canonical uniform noise input is replaced by samples from a graphical model. This graphical model is learned by a Boltzmann machine which learns low-dimensional feature representation of data extracted by the discriminator. A quantum processor can be used to sample from the model to train the Boltzmann machine. This novel hybrid quantum-classical algorithm joins a growing family of algorithms that use a quantum processor sampling subroutine in deep learning, and provides a scalable framework to test the advantages of quantum-assisted learning. For the latent space model, fully connected, symmetric bipartite and Chimera graph topologies are compared on a reduced stochastically binarized MNIST dataset, for both classical and quantum sampling methods. The quantum-assisted associative adversarial network successfully learns a generative model of the MNIST dataset for all topologies. Evaluated using the Fréchet inception distance and inception score, the quantum and classical versions of the algorithm are found to have equivalent performance for learning an implicit generative model of the MNIST dataset. Classical sampling is used to demonstrate the algorithm on the LSUN bedrooms dataset, indicating scalability to larger and color datasets. Though the quantum processor used here is a quantum annealer, the algorithm is general enough such that any quantum processor, such as gate model quantum computers, may be substituted as a sampler.

Wilson, Max (ORCID:0000000207983391)↗

Adaptive Generation of Multimaterial Grids from imaging data for Biomedical Lagrangian Fluid-Structure Simulations

Spatial discretization of complex imaging-derived fluid-solid geometries, such as the cardiac environment, is a critical but often overlooked challenge in biomechanical computations. This is particularly true in problems with Lagrangian interfaces, where, the fluid and solid phases must match geometrically. For simplicity and better accuracy, it is also highly desirable for the two phases to share the same surface mesh at the interface between them. We outline a method for solving this problem, and illustrate the approach with a 3D fluid-solid mesh of the mouse heart. An MRI perfusion-fixed dataset of a mouse heart with 50μm isotropic resolution was semi-automatically segmented using a customized multimaterial connected-threshold approach that divided the volume into non-overlapping regions of blood, tissue and background. Subsequently, a multimaterial marching cubes algorithm was applied to the segmented data to produce two detailed, compatible isosurfaces, one for blood and one for tissue. Both isosurfaces were simultaneously smoothed with a multimaterial smoothing algorithm that exactly conserves the volume for each phase. Using these two isosurfaces, we developed and applied novel automated meshing algorithms to generate anisotropic hybrid meshes on arbitrary biological geometries with the number of layers and the desired element anisotropy for each phase as the only input parameters. Since our meshes adapt to the local feature sizes and include boundary layer prisms, they are more efficient and accurate than non-adaptive, isotropic meshes, and the fluid-structure interaction computations will tend to have relative error equilibrated over the whole mesh.

59 BASIC BIOLOGICAL SCIENCES↗

Robust implementation of generative modeling with parametrized quantum circuits

Although the performance of hybrid quantum-classical algorithms is highly dependent on the selection of the classical optimizer and the circuit ansätze, a robust and thorough assessment on-hardware of such features has been missing to date. From the optimizer perspective, the primary challenge lies in the solver’s stochastic nature, and their significant variance over the random initialization. Therefore, a robust comparison requires one to perform several training curves for each solver before one can reach conclusions about their typical performance. Since each of the training curves requires the execution of thousands of quantum circuits in the quantum computer, such a robust study remained a steep challenge for most hybrid platforms available today. In this work, we leverage on Rigetti’s Quantum Cloud Services (QCS™) to overcome this implementation barrier, and we study the on-hardware performance of the data-driven quantum circuit learning (DDQCL) for three different state-of-the-art classical solvers, and on two-different circuit ansätze associated to different entangling connectivity graphs for the same task. Additionally, we assess the gains in performance from varying circuit depths. To evaluate the typical performance associated with each of these settings in this benchmark study, we use at least five independent runs of DDQCL towards the generation of quantum generative models capable of capturing the patterns of the canonical Bars and Stripes dataset. In this experimental benchmarking, the gradient-free optimization algorithms show an outstanding performance compared to the gradient-based solver. In particular, one of them had better performance when handling the unavoidable noisy objective function to be minimized under experimental conditions.

97 MATHEMATICS AND COMPUTING↗

Vlasov simulations of kinetic Alfvén waves at proton kinetic scales

Kinetic Alfvén waves represent an important subject in space plasma physics, since they are thought to play a crucial role in the development of the turbulent energy cascade in the solar wind plasma at short wavelengths (of the order of the proton gyro radius ρ{sub p} and/or inertial length d{sub p} and beyond). A full understanding of the physical mechanisms which govern the kinetic plasma dynamics at these scales can provide important clues on the problem of the turbulent dissipation and heating in collisionless systems. In this paper, hybrid Vlasov-Maxwell simulations are employed to analyze in detail the features of the kinetic Alfvén waves at proton kinetic scales, in typical conditions of the solar wind environment (proton plasma beta β{sub p} = 1). In particular, linear and nonlinear regimes of propagation of these fluctuations have been investigated in a single-wave situation, focusing on the physical processes of collisionless Landau damping and wave-particle resonant interaction. Interestingly, since for wavelengths close to d{sub p} and β{sub p} ≃ 1 (for which ρ{sub p} ≃ d{sub p}) the kinetic Alfvén waves have small phase speed compared to the proton thermal velocity, wave-particle interaction processes produce significant deformations in the core of the particle velocity distribution, appearing as phase space vortices and resulting in flat-top velocity profiles. Moreover, as the Eulerian hybrid Vlasov-Maxwell algorithm allows for a clean almost noise-free description of the velocity space, three-dimensional plots of the proton velocity distribution help to emphasize how the plasma departs from the Maxwellian configuration of thermodynamic equilibrium due to nonlinear kinetic effects.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems

Quantum computing (QC) has gained popularity due to its unique capabilities that are quite different from that of classical computers in terms of speed and methods of operations. This paper proposes hybrid models and methods that effectively leverage the complementary strengths of deterministic algorithms and QC techniques to overcome combinatorial complexity for solving large-scale mixed-integer programming problems. Four applications, namely the molecular conformation problem, job-shop scheduling problem, manufacturing cell formation problem, and the vehicle routing problem, are specifically addressed. Large-scale instances of these application problems across multiple scales ranging from molecular design to logistics optimization are computationally challenging for deterministic optimization algorithms on classical computers. To address the computational challenges, hybrid QC-based algorithms are proposed and extensive computational experimental results are presented to demonstrate their applicability and efficiency. The proposed QC-based solution strategies enjoy high computational efficiency in terms of solution quality and computation time, by utilizing the unique features of both classical and quantum computers.

97 MATHEMATICS AND COMPUTING↗

Hybrid massively parallel fast sweeping method for static Hamilton–Jacobi equations

The fast sweeping method is a popular algorithm for solving a variety of static Hamilton–Jacobi equations. Fast sweeping algorithms for parallel computing have been developed, but are severely limited. In this work, we present a multilevel, hybrid parallel algorithm that combines the desirable traits of two distinct parallel methods. The fine and coarse grained components of the algorithm take advantage of heterogeneous computer architecture common in high performance computing facilities. We present the algorithm and demonstrate its effectiveness on a set of example problems including optimal control, dynamic games, and seismic wave propagation. We give results for convergence, parallel scaling, and show state-of-the-art speedup values for the fast sweeping method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗