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 253 records · Page 14

SU-F-J-58: Evaluation of RayStation Hybrid Deformable Image Registration for Accurate Contour Propagation in Adaptive Planning

Purpose: Adaptive radiotherapy requires complete new sets of regions of interests (ROIs) delineation on the mid-treatment CT images. This work aims at evaluating the accuracy of the RayStation hybrid deformable image registration (DIR) algorithm for its overall integrity and accuracy in contour propagation for adaptive planning. Methods: The hybrid DIR is based on the combination of intensity-based algorithm and anatomical information provided by contours. Patients who received mid-treatment CT scans were identified for the study, including six lung patients (two mid-treatment CTs) and six head-and-neck (HN) patients (one mid-treatment CT). DIRpropagated ROIs were compared with physician-drawn ROIs for 8 ITVs and 7 critical organs (lungs, heart, esophagus, and etc.) for the lung patients, as well as 14 GTVs and 20 critical organs (mandible, eyes, parotids, and etc.) for the HN patients. Volume difference, center of mass (COM) difference, and Dice index were used for evaluation. Clinical-relevance of each propagated ROI was scored by two physicians, and correlated with the Dice index. Results: For critical organs, good agreement (Dice>0.9) were seen on all 7 for lung patients and 13 out of 20 for HN patients, with the rest requiring minimal edits. For targets, COM differences were within 5 mm on average for all patients. For Lung, 5 out of 8 ITVs required minimal edits (Dice 0.8–0.9), with the rest 2 needed re-drawn due to their small volumes (<10 cc). However, the propagated HN GTVs resulted in relatively low Dice values (0.5–0.8) due to their small volumes (3–40 cc) and high variability, among which 2 required re-drawn due to new nodal target identified on the mid-treatment CT scans. Conclusion: The hybrid DIR algorithm was found to be clinically useful and efficient for lung and HN patients, especially for propagated critical organ ROIs. It has potential to significantly improve the workflow in adaptive planning.

60 APPLIED LIFE SCIENCES↗

Implementation of a hybrid particle code with a PIC description in r–z and a gridless description in ϕ into OSIRIS

For many plasma physics problems, three-dimensional and kinetic effects are very important. However, such simulations are very computationally intensive. Fortunately, there is a class of problems for which there is nearly azimuthal symmetry and the dominant three-dimensional physics is captured by the inclusion of only a few azimuthal harmonics. Recently, it was proposed [1] to model one such problem, laser wakefield acceleration, by expanding the fields and currents in azimuthal harmonics and truncating the expansion. The complex amplitudes of the fundamental and first harmonic for the fields were solved on an r–z grid and a procedure for calculating the complex current amplitudes for each particle based on its motion in Cartesian geometry was presented using a Marder's correction to maintain the validity of Gauss's law. In this paper, we describe an implementation of this algorithm into OSIRIS using a rigorous charge conserving current deposition method to maintain the validity of Gauss's law. We show that this algorithm is a hybrid method which uses a particles-in-cell description in r–z and a gridless description in ϕ. We include the ability to keep an arbitrary number of harmonics and higher order particle shapes. Examples for laser wakefield acceleration, plasma wakefield acceleration, and beam loading are also presented and directions for future work are discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Multilevel Combinatorial Optimization across Quantum Architectures

Emerging quantum processors provide an opportunity to explore new approaches for solving traditional problems in the post Moore’s law supercomputing era. However, the limited number of qubits makes it infeasible to tackle massive real-world datasets directly in the near future, leading to new challenges in utilizing these quantum processors for practical purposes. Furthermore, hybrid quantum-classical algorithms that leverage both quantum and classical types of devices are considered as one of the main strategies to apply quantum computing to large-scale problems. In this article, we advocate the use of multilevel frameworks for combinatorial optimization as a promising general paradigm for designing hybrid quantum-classical algorithms. To demonstrate this approach, we apply this method to two well-known combinatorial optimization problems, namely, the Graph Partitioning Problem, and the Community Detection Problem. We develop hybrid multilevel solvers with quantum local search on D-Wave’s quantum annealer and IBM’s gate-model based quantum processor. We carry out experiments on graphs that are orders of magnitude larger than the current quantum hardware size, and we observe results comparable to state-of-the-art solvers in terms of quality of the solution.

97 MATHEMATICS AND COMPUTING↗

Strategy and gaps for modeling, simulation, and control of hybrid systems

The purpose of this report is to establish a strategy for modeling and simulation of candidate hybrid energy systems. Modeling and simulation is necessary to design, evaluate, and optimize the system technical and economic performance. Accordingly, this report first establishes the simulation requirements to analysis candidate hybrid systems. Simulation fidelity levels are established based on the temporal scale, real and synthetic data availability or needs, solution accuracy, and output parameters needed to evaluate case-specific figures of merit. Accordingly, the associated computational and co-simulation resources needed are established; including physical models when needed, code assembly and integrated solutions platforms, mathematical solvers, and data processing. This report first attempts to describe the figures of merit, systems requirements, and constraints that are necessary and sufficient to characterize the grid and hybrid systems behavior and market interactions. Loss of Load Probability (LOLP) and effective cost of Effective Cost of Energy (ECE), as opposed to the standard Levelized Cost of Electricty (LCOE), are introduced as technical and economical indices for integrated energy system evaluations. Financial assessment methods are subsequently introduced for evaluation of non-traditional, hybrid energy systems. Algorithms for coupled and iterative evaluation of the technical and economic performance are subsequently discussed. This report further defines modeling objectives, computational tools, solution approaches, and real-time data collection and processing (in some cases using real test units) that will be required to model, co-simulate, and optimize; (a) an energy system components (e.g., power generation unit, chemical process, electricity management unit), (b) system domains (e.g., thermal, electrical or chemical energy generation, conversion, and transport), and (c) systems control modules. Co-simulation of complex, tightly coupled, dynamic energy systems requires multiple simulation tools, potentially developed in several programming languages and resolved on separate time scales. Whereas further investigation and development of hybrid concepts will provide a more complete understanding of the joint computational and physical modeling needs, this report highlights areas in which co-simulation capabilities are warranted. The current development status, quality assurance, availability and maintainability of simulation tools that are currently available for hybrid systems modeling is presented. Existing gaps in the modeling and simulation toolsets and development needs are subsequently discussed. This effort will feed into a broader Roadmap activity for designing, developing, and demonstrating hybrid energy systems.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Hybrid Multiscale Finite Volume Method for Advection-Diffusion Equations Subject to Heterogeneous Reactive Boundary Conditions

We present a hybrid scheme for the coupling of macro and microscale continuum models for reactive contaminant transport in fractured and porous media. The transport model considered is the advection-dispersion equation, subject to linear heterogeneous reactive boundary conditions. The Multiscale Finite Volume method (MsFV) is employed to define an approximation to the microscale concentration field defined in terms of macroscopic or \emph{global} degrees of freedom, together with local interpolator and corrector functions capturing microscopic spatial variability. The macroscopic mass balance relations for the MsFV global degrees of freedom are coupled with the macroscopic model, resulting in a global problem for the simultaneous time-stepping of all macroscopic degrees of freedom throughout the domain. In order to perform the hybrid coupling, the micro and macroscale models are applied over overlapping subdomains of the simulation domain, with the overlap denoted as the handshake subdomain $\Omega^{hs}$, over which continuity of concentration and transport fluxes between models is enforced. Continuity of concentration is enforced by posing a restriction relation between models over $\Omega^{hs}$. Continuity of fluxes is enforced by prolongating the macroscopic model fluxes across the boundary of $\Omega^{hs}$ to microscopic resolution. The microscopic interpolator and corrector functions are solutions to local microscopic advection-diffusion problems decoupled from the global degrees of freedom and from each other by virtue of the MsFV decoupling ansatz. The error introduced by the decoupling ansatz is reduced iteratively by the preconditioned GMRES algorithm, with the hybrid MsFV operator serving as the preconditioner.

Barajas-Solano, David A.↗

A systematic feature extraction and selection framework for data-driven whole-building automated fault detection and diagnostics in commercial buildings

In data-driven automated fault detection and diagnostics (AFDD) modeling for building energy systems, feature engineering is a critical process of extracting information from high-dimensional and noisy sensor measurement and turning it into informative and representative inputs or features for data-driven modeling. However, few studies specifically discuss the feature engineering, especially the interactions between feature extraction and feature selection in whole-building AFDD. We developed a systematic feature extraction and selection framework for whole-building AFDD. In this framework, features are aggressively extracted from raw sensor data using statistical feature extraction techniques with various window sizes and statistics. With many features extracted, a hybrid feature selection algorithm that combines the filter and wrapper method then selects the best feature set. The framework considers diversity in the duration of fault behavior among fault types in whole-building AFDD, thus achieving high model generalization. We implemented our developed framework in a virtual testbed calibrated with measured data from Oak Ridge National Laboratory's Flexible Research Platform designed to mimic the operation of a typical small commercial building. The AFDD model is trained by the simulation data generated from the virtual testbed. The results show that (1) the developed framework improves the generalization of the AFDD model by 10.7% compared with literature-reported feature extraction and selection methods and (2) features with diverse window sizes and statistics are selected, providing insight into physical systems beyond the current understanding of buildings and faults and improving the detection and diagnostics of multiple fault types.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Q-POP-Thermo: A general-purpose thermodynamics solver for ferroelectric materials

We report that Q-POP-Thermo is a program designed to compute thermodynamic monodomain equilibrium states and their properties for ferroelectric single crystals and thin films based on the Landau-Ginzburg-Devonshire (LGD) Theory. Utilizing symbolic manipulation with the SymPy Library, the governing equations along with appropriate boundary conditions are solved for speedy minimization of the free energy of a crystal. Utilizing the popular Differential Evolution algorithm, with appropriate hybridization, multiple phase diagrams, such as the pressure-temperature phase diagram for bulk single crystals and the common strain-temperature phase diagram for monodomain thin-film systems can be readily generated. Furthermore, a variety of material properties of stable ferroelectric phases, including dielectric, piezoelectric, and electrocaloric properties, can simultaneously be calculated. Validation studies are presented for both thin-film and single crystal systems to test the effectiveness and capability of the open-source program.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Is the Matrix Completion of Reduced Density Matrices Unique?

Reduced density matrices are central to describing observables in many-body quantum systems. In electronic structure theory, the two-particle reduced density matrix (2-RDM) suffices to determine the energy and other key properties. Recent work has used matrix completion, leveraging the low-rank structure of RDMs and approximate theoretical models, to reconstruct the 2-RDM from partial data and thus reduce the computational cost. However, matrix completion is, in general, an under-determined problem. Revisiting Rosina’s theorem (Rosina, M. Queen’s Papers on Pure and Applied Mathematics , 1968, No. 11, 369), we here show that the matrix completion is unique under certain conditions, identifying the subset of 2-RDM elements that enables its exact reconstruction from incomplete information. Building on this, we introduce a hybrid quantum–stochastic algorithm that achieves exact matrix completion, demonstrated through applications to the Fermi–Hubbard model.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Distribution Cutoff for Clusters near the Gel Point

The mechanical and dynamic properties of developing networks near the gel point are susceptible to the distribution of clusters coexisting with percolating networks. The distribution of cluster numbers follows a broad power law, wrapped by a cutoff function that rapidly decays at a characteristic size. The form of the cutoff function has been speculated based on known results from lattice percolation and, in certain cases, solved. We obtained this cutoff function from simulated dynamic clusters of polymeric precursor chains using a hybrid Monte Carlo algorithm. The results obtained from three different precursor chain lengths are consistent with each other and are consistent with the expectation from lattice percolation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Sequence Data for Clostridium autoethanogenum using Three Generations of Sequencing Technologies

During the past decade, DNA sequencing output has been mostly dominated by the second generation sequencing platforms which are characterized by low cost, high throughput and shorter read lengths for example, Illumina. The emergence and development of so called third generation sequencing platforms such as PacBio has permitted exceptionally long reads (over 20 kb) to be generated. Due to read length increases, algorithm improvements and hybrid assembly approaches, the concept of one chromosome, one contig and automated finishing of microbial genomes is now a realistic and achievable task for many microbial laboratories. In this paper, we describe high quality sequence datasets which span three generations of sequencing technologies, containing six types of data from four NGS platforms and originating from a single microorganism, Clostridium autoethanogenum. The dataset reported here will be useful for the scientific community to evaluate upcoming NGS platforms, enabling comparison of existing and novel bioinformatics approaches and will encourage interest in the development of innovative experimental and computational methods for NGS data.

59 BASIC BIOLOGICAL SCIENCES↗

Quantum computation of silicon electronic band structure

Development of quantum architectures during the last decade has inspired hybrid classical–quantum algorithms in physics and quantum chemistry that promise simulations of fermionic systems beyond the capability of modern classical computers, even before the era of quantum computing fully arrives. Strong research efforts have been recently made to obtain minimal depth quantum circuits which could accurately represent chemical systems. Here, we show that unprecedented methods used in quantum chemistry, designed to simulate molecules on quantum processors, can be extended to calculate properties of periodic solids. In particular, we present minimal depth circuits implementing the variational quantum eigensolver algorithm and successfully use it to compute the band structure of silicon on a quantum machine for the first time. We are convinced that the presented quantum experiments performed on cloud-based platforms will stimulate more intense studies towards scalable electronic structure computation of advanced quantum materials.

36 MATERIALS SCIENCE↗

Adaptive pruning-based optimization of parameterized quantum circuits

Abstract Variational hybrid quantum–classical algorithms are powerful tools to maximize the use of noisy intermediate-scale quantum devices. While past studies have developed powerful and expressive ansatze, their near-term applications have been limited by the difficulty of optimizing in the vast parameter space. In this work, we propose a heuristic optimization strategy for such ansatze used in variational quantum algorithms, which we call ‘parameter-efficient circuit training (PECT)’. Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms, in which each iteration of the algorithm activates and optimizes a subset of the total parameter set. To update the parameter subset between iterations, we adapt the Dynamic Sparse Reparameterization scheme which was originally proposed for training deep convolutional neural networks. We demonstrate PECT for the Variational Quantum Eigensolver, in which we benchmark unitary coupled-cluster ansatze including UCCSD and k -UpCCGSD, as well as the Low-Depth Circuit Ansatz (LDCA), to estimate ground state energies of molecular systems. We additionally use a layerwise variant of PECT to optimize a hardware-efficient circuit for the Sycamore processor to estimate the ground state energy densities of the one-dimensional Fermi-Hubbard model. From our numerical data, we find that PECT can enable optimizations of certain ansatze that were previously difficult to converge and more generally can improve the performance of variational algorithms by reducing the optimization runtime and/or the depth of circuits that encode the solution candidate(s).

Physics↗

sp3-hybridized framework structure of group-14 elements discovered by genetic algorithm

Group-14 elements, including C, Si, Ge, and Sn, can form various stable and metastable structures. Finding new metastable structures of group-14 elements with desirable physical properties for new technological applications has attracted a lot of interest. Using a genetic algorithm, we discovered a new low-energy metastable distorted sp3-hybridized framework structure of the group-14 elements. It has P42/mnm symmetry with 12 atoms per unit cell. The void volume of this structure is as large as 139.7Å3 for Si P42/mnm, and it can be used for gas or metal-atom encapsulation. Band-structure calculations show that P42/mnm structures of Si and Ge are semiconducting with energy band gaps close to the optimal values for optoelectronic or photovoltaic applications. With metal-atom encapsulation, the P42/mnm structure would also be a candidate for rattling-mediated superconducting or used as thermoelectric materials.

36 MATERIALS SCIENCE↗

Collective charge excitations and the metal-insulator transition in the square lattice Hubbard-Coulomb model

Here in this article, we discuss the nontrivial collective charge excitations (plasmons) of the extended square lattice Hubbard model. Using a fully nonperturbative approach, we employ the hybrid Monte Carlo algorithm to simulate the system at half-filling. A modified Backus-Gilbert method is introduced to obtain the spectral functions via numerical analytic continuation. We directly compute the single-particle density of states which demonstrates the formation of Hubbard bands in the strongly correlated phase. The momentum-resolved charge susceptibility also is computed on the basis of the Euclidean charge-density-density correlator. In agreement with previous extended dynamical mean-field theory studies, we find that, at high strength of the electron-electron interaction, the plasmon dispersion develops two branches.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum simulations in effective model spaces: Hamiltonian-learning variational quantum eigensolver using digital quantum computers and application to the Lipkin-Meshkov-Glick model

Quantum simulations offer the potential to predict the structure and dynamics of nuclear many-body systems that are beyond the capabilities of classical computing. Generally, preparing the ground state of strongly-interacting many-body systems relevant to nuclear physics is however inefficient, even using ideal quantum computers. In addition, currently available NISQ-era quantum devices possess modest numbers of qubits, limiting the size of quantum many-body systems that can be simulated. In this context, a reformulation of the quantum many-body problems using truncated model spaces and Hamiltonians is desirable to make them more amenable to near-term quantum computers. The importance of symmetries in low-energy theories, including effective field theories (EFTs), lattice quantum chromodynamics (QCD), and effective model spaces for nuclear systems, in particular their interplay with the reduction of active Hilbert spaces, is well known. Lesser known is the fact that the non-commutivity of some symmetries and truncations of the model space can be profitably combined with variational calculations to rearrange the entanglement into localized structures and enable more efficient simulations. Here, the goal of the present study is to explore and utilize the non-commutivity of symmetries and model-space truncations of quantum many-body systems important to nuclear physics, particularly in combination with variational algorithms for quantum simulations and effective Hamiltonian learning. We introduce an iterative hybrid classical-quantum algorithm, Hamiltonian learning variational quantum eigensolver (HL-VQE), that simultaneously optimizes an effective Hamiltonian, thereby rearranging entanglement into the effective model space, and the associated ground-state wavefunction. Quantum simulations, using classical computers and IBM's superconducting-qubit quantum computers, are performed to demonstrate the HL-VQE algorithm, in the context of the Lipkin-Meshkov-Glick (LMG) model of interacting fermions, where the Hamiltonian transformation corresponds to an orbital rotation. We use a mapping where the number of qubits scales with the $\log$ of the size of the effective model space, rather than the particle number. HL-VQE is found to provide an exponential improvement in LMG-model calculations of the ground-state energy and wavefunction, compared to naive truncations without Hamiltonian learning, throughout a significant fraction of the Hilbert space. In the context of EFT, this corresponds to counterterms scaling exponentially with the cut-off as opposed to power law. Implementations on IBM's QExperience quantum computers and simulators for 1- and 2-qubit effective model spaces are shown to provide accurate and precise results, reproducing classical predictions. For a range of parameters defining the LMG model, the HL-VQE algorithm is found to have better scaling of quantum resources requirements than previously explored algorithms. In particular, the HL-VQE scales efficiently over a large fraction of the model space, in contrast to VQE alone. This work constitutes a step in the development of entanglement-driven quantum algorithms for descriptions of nuclear many-body systems. This, in part, leverages the potential of noisy intermediate-scale quantum (NISQ) devices. The exponential scaling of counterterms observed in this study suggests the possibility of more general applicability to other non-perturbative EFTs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Lattice sine-Gordon model

We obtain nonperturbative results on the sine-Gordon model using the lattice field technique. In particular, we employ the Fourier accelerated hybrid Monte Carlo algorithm for our studies. We find the critical temperature of the theory based on autocorrelation time, as well as the finite size scaling of the "thickness" observable used in an earlier lattice study by Hasenbusch et al. We study the entropy, which is smooth across all temperatures, supportive of an infinite order transition. This system has a well-known duality with the massive Thirring model, which can play the role of a toy models for Montonen-Olive duality in $\mathcal {N}$ = 4 super-Yang-Mills theory, since it relates solitons to elementary field excitations. Our research lays a groundwork for such study on the lattice.

36 MATERIALS SCIENCE↗

Casimir scaling and string breaking in G{sub 2} gluodynamics

We study the potential energy between static charges in G{sub 2} gluodynamics in three and four dimensions. Our work is based on an efficient local hybrid Monte Carlo algorithm and a multilevel Luescher-Weisz algorithm with exponential error reduction to accurately measure expectation values of Wilson and Polyakov loops. Both in three and four dimensions we show that at intermediate scales the string tensions for charges in various G{sub 2} representations scale with the second order Casimir. In three dimensions Casimir scaling is confirmed within 4% for charges in representations of dimensions 7, 14, 27, 64, 77, 77{sup '}, 182, and 189 and in four dimensions within 5% for charges in representations of dimensions 7, 14, 27, and 64. In three dimensions we detect string breaking for charges in the two fundamental representations. The scale for string breaking agrees very well with the mass of the created pair of glue lumps. Close to the string breaking distance Casimir scaling between adjoint and defining representation is violated by 2.5%. The analytical prediction for the continuum string tension is confirmed for the defining representation in three dimensions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Particle-Tracking Proton Computed Tomography—Data Acquisition, Preprocessing, and Preconditioning

Proton CT (pCT) is a promising new imaging technique that can reconstruct relative stopping power (RSP) more accurately than x-ray CT in each cubic millimeter voxel of the patient. This, in turn, will result in better proton range accuracy and, therefore, smaller planned tumor volumes (PTV). The hardware description and some reconstructed images have previously been reported. In a series of two contributions, we focus on presenting the software algorithms that convert pCT detector data to the final reconstructed pCT images for application in proton treatment planning. There were several options on how to accomplish this, and we will describe our solutions at each stage of the data processing chain. In the first paper of this series, we present the data acquisition with the pCT tracking and energy-range detectors and how the data are preprocessed, including the conversion to the well-formatted track information from tracking data and water-equivalent path length from the data of a calibrated multi-stage energy-range detector. These preprocessed data are then used for the initial image formation with an FDK cone-beam CT algorithm. The output of data acquisition, preprocessing, and FDK reconstruction is presented along with illustrative imaging results for two phantoms, including a pediatric head phantom. The second paper in this series will demonstrate the use of iterative solvers in conjunction with the superiorization methodology to further improve the images resulting from the upfront FDK image reconstruction and the implementation of these algorithms on a hybrid CPU/GPU computer cluster.

42 ENGINEERING↗