Search NASA⌕ Search

SEARCH · Search NASA

Results for “Speedup”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Probing Accuracy-Speedup Tradeoff in Machine Learning Surrogates for Molecular Dynamics Simulations

The performance promise of machine learning surrogates of molecular dynamics simulations of soft materials is significant but generally comes at the cost of acquiring large training datasets to learn the complex relationships between input soft material attributes and output properties. Under the constraint of limited high-performance computing resources, optimizing the size of the training datasets becomes paramount. Using an artificial neural network based surrogate for molecular dynamics simulations of confined electrolytes, we explore the tradeoff between surrogate accuracy and computational gains. Accuracy is assessed by computing the root-mean-square errors between the surrogate predictions and the ground truth results obtained via molecular dynamics simulations. The computational performance is judged by evaluating the speedup which incorporates the training dataset creation time. Improvement in accuracy occurs with a loss of speedup, which scales as the inverse of the training dataset size. Furthermore, the link between surrogate generalizability and the accuracy-speedup tradeoff is assessed by examining the errors incurred in surrogate predictions on unseen, interpolated input variables and developing a net speedup metric to capture the associated gains.

Anions↗
DOE OSTI2025

Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem

Simon’s problem is to find a hidden period (a bitstring) encoded into an unknown 2-to-1 function. It is one of the earliest problems for which an exponential quantum speedup was proven for ideal, noiseless quantum computers, albeit in the oracle model. Here, using two different 127-qubit IBM Quantum superconducting processors, we demonstrate an algorithmic quantum speedup for a variant of Simon’s problem where the hidden period has a restricted Hamming weight 𝑤. For sufficiently small values of 𝑤 and for circuits involving up to 58 qubits, we demonstrate an exponential speedup, albeit of a lower quality than the speedup predicted for the noiseless algorithm. The speedup exponent and the range of 𝑤 values for which an exponential speedup exists are significantly enhanced when the computation is protected by dynamical decoupling. Further enhancement is achieved with measurement error mitigation. This case constitutes a demonstration of a bona fide quantum advantage for an Abelian hidden subgroup problem.

computation↗
DOE OSTI2015

Probing for quantum speedup in spin-glass problems with planted solutions

The availability of quantum annealing devices with hundreds of qubits has made the experimental demonstration of a quantum speedup for optimization problems a coveted, albeit elusive goal. Going beyond earlier studies of random Ising problems, here we introduce a method to construct a set of frustrated Ising-model optimization problems with tunable hardness. We study the performance of a D-Wave Two device (DW2) with up to 503 qubits on these problems and compare it to a suite of classical algorithms, including a highly optimized algorithm designed to compete directly with the DW2. The problems are generated around predetermined ground-state configurations, called planted solutions, which makes them particularly suitable for benchmarking purposes. The problem set exhibits properties familiar from constraint satisfaction (SAT) problems, such as a peak in the typical hardness of the problems, determined by a tunable clause density parameter. We bound the hardness regime where the DW2 device either does not or might exhibit a quantum speedup for our problem set. While we do not find evidence for a speedup for the hardest and most frustrated problems in our problem set, we cannot rule out that a speedup might exist for some of the easier, less frustrated problems. Our empirical findings pertain to the specific D-Wave processor and problem set we studied and leave open the possibility that future processors might exhibit a quantum speedup on the same problem set.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Demonstration of Algorithmic Quantum Speedup

Despite the development of increasingly capable quantum computers, an experimental demonstration of a provable algorithmic quantum speedup employing today’s non-fault-tolerant devices has remained elusive. Here, in this study, we unequivocally demonstrate such a speedup within the oracular model, quantified in terms of the scaling with the problem size of the time-to-solution metric. We implement the single-shot Bernstein-Vazirani algorithm, which solves the problem of identifying a hidden bitstring that changes after every oracle query, using two different 27-qubit IBM Quantum superconducting processors. The speedup is observed on only one of the two processors when the quantum computation is protected by dynamical decoupling but not without it. The quantum speedup reported here does not rely on any additional assumptions or complexity-theoretic conjectures and solves a bona fide computational problem in the setting of a game with an oracle and a verifier.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Evaluating mesoscale model predictions of diurnal speedup events in the Altamont Pass Wind Resource Area of California

Mesoscale model predictions of wind, turbulence, and wind energy capacity factors are evaluated in the Altamont Pass Wind Resource Area of California (APWRA), where the diurnal regional sea breeze and associated terrain-driven speedup flows drive wind energy production during the summer months. Results from the Weather Research and Forecasting model version 4.4 using a novel three-dimensional planetary boundary layer (3D PBL) scheme, which treats both vertical and horizontal turbulent mixing, are compared to those using a well-established one-dimensional (1D) scheme that treats only vertical turbulent mixing. Each configuration is evaluated over a nearly 3-month-long period during the Hill Flow Study, and due to the recurring nature of the observed speedup flows, diurnal composite averaging is used to capture robust trends in model performance. Both model configurations showed similar overall skill. The general timing and direction of the speedup flows is captured, but their magnitude is overestimated within a typical wind turbine rotor layer. Both also fail to capture a persistent observed near-surface jet-like flow, likely due to the limited grid resolution that is typical of mesoscale models. However, the 3D PBL configuration shows several minor improvements over the 1D PBL configuration, including improved wind speed and turbulence kinetic energy profiles during the accelerating phase of the speedup events, as well as reduced positive wind speed bias at surface stations across the APWRA region. Using a mesoscale wind farm parameterization, modeled capacity factors are also compared to monthly data reported to the US Energy Information Administration (EIA) during the study period. Although the monthly trend in the data is captured, both model configurations overestimate capacity factors by roughly 7 %–11 %. Through model evaluation, this study provides confidence in the 3D PBL scheme for wind energy applications in complex terrain and provides guidance for future testing.

17 WIND ENERGY↗
DOE OSTI2023

Blockage and speedup in the proximity of an onshore wind farm: A scanning wind LiDAR experiment

To maximize the profitability of wind power plants, wind farms are often characterized by high wind turbine density leading to operations with reduced turbine spacing. As a consequence, the overall wind farm power capture is hindered by complex flow features associated with flow modifications induced by the various wind turbine rotors. In addition to the generation of wakes, the velocity of the incoming wind field can reduce due to the increased pressure in the proximity of a single turbine rotor (named induction); a similar effect occurs at the wind-farm level (global blockage), which can have a noticeable impact on power production. On the other hand, intra-wind-farm regions featuring increased velocity compared to the freestream (speedups) have also been observed, which can be a source for a potential power boost. To quantify these rotor-induced effects on the incoming wind velocity field, three profiling LiDARs and one scanning wind LiDAR were deployed both before and after the construction of an onshore wind turbine array. The different wind conditions are classified according to the ambient turbulence intensity and streamwise/spanwise spacing among wind turbines. The analysis of the mean velocity field reveals enhanced induction and speedup under stably stratified atmospheric conditions. Additionally, a reduced horizontal area between adjacent turbines has a small impact on the induction zone but increases significantly the speedup between adjacent rotors.

17 WIND ENERGY↗
DOE OSTI2024

Grover-QAOA for 3-SAT: quadratic speedup, fair-sampling, and parameter clustering

Abstract The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it has long served as an essential benchmark for classical and quantum algorithms. This study shows numerical evidence for a quadratic speedup of the Grover Quantum Approximate Optimization Algorithm (G-QAOA) over random sampling for finding all solutions to 3-SAT (All-SAT) and Max-SAT problems. G-QAOA is less resource-intensive and more adaptable for these problems than Grover’s algorithm, and it surpasses conventional QAOA in its ability to sample all solutions. We show these benefits by classical simulations of many-round G-QAOA on thousands of random 3-SAT instances. We also observe G-QAOA advantages on the IonQ Aria quantum computer for small instances, finding that current hardware suffices to determine and sample all solutions. Interestingly, a single-angle-pair constraint that uses the same pair of angles at each G-QAOA round greatly reduces the classical computational overhead of optimizing the G-QAOA angles while preserving its quadratic speedup. We also find parameter clustering of the angles. The single-angle-pair protocol and parameter clustering significantly reduce obstacles to classical optimization of the G-QAOA angles.

Zhang, Zewen (ORCID:000000032258613X)↗
DOE OSTI2022

The contribution of Humboldt Glacier, northern Greenland, to sea-level rise through 2100 constrained by recent observations of speedup and retreat

Abstract. Humboldt Glacier, northern Greenland, has retreated and accelerated through the 21st century, raising concerns that it could be a significant contributor to future sea-level rise. We use a data-constrained ensemble of three-dimensional higher-order ice sheet model simulations to estimate the likely range of sea-level rise from the continued retreat of Humboldt Glacier. We first solve for basal traction using observed ice thickness, bed topography, and ice surface velocity from the year 2007 in a PDE-constrained (partial differential equation) optimization. Next, we impose calving rates to match mean observed retreat rates from winter 2007–2008 to winter 2017–2018 in a transient calibration of the exponent in the power-law basal friction relationship. We find that power-law exponents in the range of 1/7–1/5 – rather than the commonly used 1/3–1 – are necessary to reproduce the observed speedup over this period. We then tune an iceberg calving parameterization based on the von Mises stress yield criterion in another transient-calibration step to approximate both observed ice velocities and terminus position in 2017–2018. Finally, we use the range of basal friction relationship exponents and calving parameter values to generate the ensemble of model simulations from 2007–2100 under three climate forcing scenarios from CMIP5 (two RCP8.5 forcings, Representative Concentration Pathway) and CMIP6 (one SSP5-8.5 forcing, Shared Socioeconomic Pathway). Our simulations predict 5.2–8.7 mm of sea-level rise from Humboldt Glacier, significantly higher than a previous estimate (∼ 3.5 mm) and equivalent to a substantial fraction of the 40–140 mm predicted by ISMIP6 from the whole Greenland Ice Sheet. Our larger future sea-level rise prediction results from the transient calibration of our basal friction law to match the observed speedup, which requires a semi-plastic bed rheology. In many simulations, our model predicts the growth of a sizable ice shelf in the middle of the 21st century. Thus, atmospheric warming could lead to more retreat than predicted here if increased surface melt promotes hydrofracture of the ice shelf. Our data-constrained simulations of Humboldt Glacier underscore the sensitivity of model predictions of Greenland outlet glacier response to warming to choices of basal shear stress and iceberg calving parameterizations. Further, transient calibration of these parameterizations, which has not typically been performed, is necessary to reproduce observed behavior. Current estimates of future sea-level rise from the Greenland Ice Sheet could, therefore, contain significant biases.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

Environment-assisted non-Markovian speedup dynamics control

For the damped Jaynes–Cummings model in the weak system–environment coupling regime, a scheme to manipulate the non-Markovian dynamics has been previously proposed in the controllable environment. We here mainly focus on the two-Lorentzian model and the band-gap model, which are composed by adding a new Lorentzian spectrum to the original single-Lorentzian spectrum. By manipulating the parameters of the new added Lorentzian spectrum, i.e., changing the weights of the two Lorentzians, and tuning the spectral width of the new second Lorentzian, the dynamical crossover from Markovian to non-Markovian is achieved in the weak system–environment coupling regime. In addition, according to the controllable non-Markovian dynamics behavior, the roles of the parameters of the environment on the speedup evolution of the system are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Speedup of UEDGE Parameter Scans Using Machine-Learning Optimized OpenMP Parallelization and a Continuation Solver

This article presents the OpenMP parallelization of the preconditioning Jacobian assembly and right‐hand side residual evaluation in UEDGE. A continuation algorithm, utilizing the internal NKSOL implicit Jacobian‐Free Newton‐Krylov solver to efficiently scan physical parameters, is also presented. The implemented parallelization reduces the computational time for a benchmark scan run on 32 threads by compared to the serial version when using trained random forest regression models to identify the optimal decomposition of the system of equations. Random forest regression models applied to the UEDGE time‐dependent and continuation solver algorithms did not yield meaningful improvement in computational performance. A benchmark DIII‐D gas injection rate scan in the 0.35–0.75 kA interval, performed on a test cluster using the parallelized code and continuation solver, produced 1066 steady‐state solutions with a 22 s average wall‐clock computational time per steady‐state solution.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Quantum optical classifier with superexponential speedup

Abstract Classification is a central task in deep learning algorithms. Usually, images are first captured and then processed by a sequence of operations, of which the artificial neuron represents one of the fundamental units. This paradigm requires significant resources that scale (at least) linearly in the image resolution, both in terms of photons and computational operations. Here, we present a quantum optical pattern recognition method for binary classification tasks. It classifies objects without reconstructing their images, using the rate of two-photon coincidences at the output of a Hong-Ou-Mandel interferometer, where both the input and the classifier parameters are encoded into single-photon states. Our method exhibits the behaviour of a classical neuron of unit depth. Once trained, it shows a constant $${{\mathcal{O}}}(1)$$ O ( 1 ) complexity in the number of computational operations and photons required by a single classification. This is a superexponential advantage over a classical artificial neuron.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Geometry optimization speedup through a geodesic approach to internal coordinates

We present a new geodesic-based method for geometry optimization in a basis set of redundant internal coordinates. Overall, our method updates the molecular geometry by following the geodesic generated by a displacement vector on the internal coordinate manifold, which dramatically reduces the number of steps required to converge to a minimum. Our method can be implemented in any existing optimization code, requiring only implementation of derivatives of the Wilson B-matrix and the ability to numerically solve an ordinary differential equation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2014

Pairing-induced speedup of nuclear spontaneous fission

Collective inertia is strongly influenced at the level crossing at which the quantum system changes its microscopic configuration diabatically. Pairing correlations tend to make the large-amplitude nuclear collective motion more adiabatic by reducing the effect of these configuration changes. Competition between pairing and level crossing is thus expected to have a profound impact on spontaneous fission lifetimes. To elucidate the role of nucleonic pairing on spontaneous fission, we study the dynamic fission trajectories of 264 Fm and 240 Pu using the state-of-the-art self-consistent framework. We employ the superfluid nuclear density functional theory with the Skyrme energy density functional SkM* and a density-dependent pairing interaction. Along with shape variables, proton and neutron pairing correlations are taken as collective coordinates. The collective inertia tensor is calculated within the nonperturbative cranking approximation. The fission paths are obtained by using the least action principle in a four-dimensional collective space of shape and pairing coordinates. Pairing correlations are enhanced along the minimum-action fission path. For the symmetric fission of 264 Fm, where the effect of triaxiality on the fission barrier is large, the geometry of the fission pathway in the space of the shape degrees of freedom is weakly impacted by pairing. This is not the case for 240 Pu, where pairing fluctuations restore the axial symmetry of the dynamic fission trajectory. The minimum-action fission path is strongly impacted by nucleonic pairing. In some cases, the dynamical coupling between shape and pairing degrees of freedom can lead to a dramatic departure from the static picture. As a result, in the dynamical description of nuclear fission, particle-particle correlations should be considered on the same footing as those associated with shape degrees of freedom.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗