Search NASA⌕ Search

SEARCH · Search NASA

Results for “Oracles”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Enabling Evaluation of a Southern Company Distribution Feeder on NREL ADMS Test Bed: Cooperative Research and Development (Final Report)

The objective of this project is to enable evaluation of a Southern Company distribution feeder on the Advanced Distribution Management System (ADMS) test bed. The long-term goal is to evaluate a federated distributed energy resource (DER) management solution that aggregates DERs through either direct control, transactive control or an aggregator to provide bulk services while observing distribution system voltage and power constraints. The DER aggregation needs to be coordinated with an ADMS that is responsible for reliable power delivery across the distribution systems. This project takes the first step towards enabling such evaluation by deploying an ADMS from Oracle (Southern Company's ADMS supplier) with a Southern Company feeder at NREL.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

A preliminary investigation into the feasibility of laser ablation U–Pb isotope ratio measurement via all‐faraday cup detection with 10 11 ‐ and 10 13 ‐Ω amplifiers on the Neoma multicollector‐inductively coupled plasma‐mass spectrometer

Rationale Signal detection for uranium–lead (U–Pb) dating of zircon is typically performed via ion counters. Here, we develop a preliminary understanding of the strengths and limitations of faraday‐cup‐based detection. Methods A suite of zircon reference materials and the NIST‐610 glass were sampled using laser ablation followed by U–Pb isotope ratio measurement on a Neoma multicollector‐inductively coupled plasma‐mass spectrometer. Results We were able to produce geologically accurate 207 Pb/ 206 Pb, 206 Pb/ 238 U, and 207 Pb/ 235 U ratios for the NIST‐610 glass and the zircon standards, with ages ranging from ~2.5 Ga to ~337 Ma (TanBrown A, Oracle, 91550, Mud Tank, Temora, and Plešovice). Two of the younger zircon standards examined (94‐35, ~55.6 Ma, and Fish Canyon, 28.6 Ma) yielded accurate 206 Pb/ 238 U but not 207 Pb/ 235 U or 207 Pb/ 206 Pb ratios, whereas the youngest zircon standard (Penglai, ~4.4 Ma) failed for all three ratios of interest. The accuracy and precision of the all‐faraday method are directly tied to signal intensity, with reliable data capable of being produced even when both isotopes in a ratio have signals below ~0.001 V (equivalent to ~62 500 cps on an ion counter). Conclusion The all‐faraday cup multicollection method provides sufficient sensitivity to obtain geologically meaningful U–Pb data, with possible advantages being that laser pit depth‐dependent changes in the observed interelemental fractionation behavior may be easier to correct using a static collector configuration compared to when the ion beam is swept across a single detector while also removing the need for an interdetector‐type calibration. Further work is needed to refine the all‐faraday cup method (e.g., application of background subtraction and common Pb corrections, outlier removal, and interelement as well as down‐hole fractionation corrections), but our initial results demonstrate that the faraday detector method has sufficient sensitivity to warrant further study.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

Using a Genetic Algorithm to Optimize Configurations in a Data-Driven Application

Users of highly-configurable software systems often want to optimize a particular objective such as improving a functional outcome or increasing system performance. One approach is to use an evolutionary algorithm. However, many applications today are data-driven, meaning they depend on inputs or data which can be complex and varied. Hence, a search needs to be run (and re-run) for all inputs, making optimization a heavy-weight and potentially impractical process. In this paper, we explore this issue on a data-driven highly-configurable scientific application. We build an exhaustive database containing 3,000 configurations and 10,000 inputs, leading to almost 100 million records as our oracle, and then run a genetic algorithm individually on each of the 10,000 inputs. We ask if (1) a genetic algorithm can find configurations to improve functional objectives; (2) whether patterns of best configurations over all input data emerge; and (3) if we can we use sampling to approximate the results. We find that the original (default) configuration is best only 34% of the time, while clear patterns emerge of other best configurations. Out of 3,000 possible configurations, only 112 distinct configurations achieve the optimal result at least once across all 10,000 inputs, suggesting the potential for lighter weight optimization approaches. We show that sampling of the input data finds similar patterns at a lower cost.

Sinha, Urjoshi↗
DOE OSTI2023

Stochastic projective splitting

Here, we present a new, stochastic variant of the projective splitting (PS) family of algorithms for inclusion problems involving the sum of any finite number of maximal monotone operators. This new variant uses a stochastic oracle to evaluate one of the operators, which is assumed to be Lipschitz continuous, and (deterministic) resolvents to process the remaining operators. Our proposal is the first version of PS with such stochastic capabilities. We envision the primary application being machine learning (ML) problems, with the method’s stochastic features facilitating “mini-batch” sampling of datasets. Since it uses a monotone operator formulation, the method can handle not only Lipschitz-smooth loss minimization, but also min–max and noncooperative game formulations, with better convergence properties than the gradient descent-ascent methods commonly applied in such settings. The proposed method can handle any number of constraints and nonsmooth regularizers via projection and proximal operators. We prove almost-sure convergence of the iterates to a solution and a convergence rate result for the expected residual, and close with numerical experiments on a distributionally robust sparse logistic regression problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Entropy Stable Conservative Flux Form Neural Networks

We propose an entropy-stable conservative flux form neural network (CFN) to predict the dynamics of unknown governing conservation laws. The design of the network is based on the entropy-stable, second-order, and non-oscillatory Kurganov-Tadmor (KT) scheme. The proposed entropy-stable CFN, hereafter referred to as ESCFN, uses slope limiting as a denoising mechanism, ensuring accurate predictions in both noisy and sparse observation environments, as well as in both smooth and discontinuous regions. Importantly, our method is designed to predict long term dynamics of the unknown conservation law exclusively from a short temporal window of observed data, that is, without oracle knowledge of the PDE or later-time solution profiles. Numerical experiments demonstrate that the ESCFN achieves both stability and conservation while maintaining accuracy over extended time domains, and successfully predicts shock propagation speeds in long-term simulations. Furthermore, it is also robust to both noisy and sparse data environments.

Hyperbolic conservation laws↗
DOE OSTI2025

Observable measurement-induced transitions

One of the main postulates of quantum mechanics is that measurements destroy quantum coherence (wave function collapse). Recently it was discovered that in a many-body system dilute local measurements still preserve some coherence across the entire system. As the measurement density is increased, a phase transition occurs that is characterized by the disentanglement of different parts of the system. Unfortunately, this transition is impossible to observe experimentally for macroscopic systems because it requires an exponentially costly full tomography of the many-body wave function or a comparison with the simulation on an oracle classical computer. In this work we report the discovery of another measurement-induced phase transition that can be observed experimentally if quantum dynamics can be reversed. On one side of this phase transition the quantum information encoded in some part of the Hilbert space is fully recovered after the time inversion. On the other side, all quantum information is corrupted. This transition also manifests itself as the change in the behavior of the probability to observe the same measurement outcome in the process that consists of identical blocks repeated many times. In each block the unitary evolution is followed by the measurement. On one side of the transition the probability decreases exponentially with the number of repetitions, on the other it tends to a constant as the number of repetitions is increased. We confirm the existence of the proposed phase transition through numerical simulations of realistic quantum circuits and analytical calculations using an effective random-matrix theory model.

Measurement-induced phase transitions↗
DOE OSTI2026

Neural entropy-stable conservative flux form neural networks for learning hyperbolic conservation laws

We propose a neural entropy-stable conservative flux form neural network (NESCFN) for learning hyperbolic conservation laws and their associated entropy functions directly from solution trajectories, without requiring any predefined numerical discretization. While recent neural network architectures have successfully integrated classical numerical principles into learned models, most rely on prior knowledge of the governing equations or assume a fixed discretization. Our approach removes this dependency by embedding entropy-stable design principles into the learning process itself, enabling the discovery of physically consistent dynamics in a fully data-driven setting. By jointly learning both the flux function and a corresponding entropy, NESCFN promotes conservation and entropy dissipation, which is critical for long-term stability and fidelity in the system of hyperbolic conservation laws. Furthermore, numerical results demonstrate that the method achieves stability and conservation over extended time horizons and accurately captures shock propagation speeds, even without oracle access to future-time solution profiles in the training data.

Conservative flux form↗
DOE OSTI2024

CoarsenConf: Equivariant Coarsening with Aggregated Attention for Molecular Conformer Generation

Molecular conformer generation (MCG) is an important task in cheminformatics and drug discovery. The ability to efficiently generate low-energy 3D structures can avoid expensive quantum mechanical simulations, leading to accelerated virtual screenings and enhanced structural exploration. Several generative models have been developed for MCG, but many struggle to consistently produce high-quality conformers for meaningful downstream applications. To address these issues, we introduce CoarsenConf, which coarse-grains molecular graphs based on torsional angles and integrates them into an SE(3)-equivariant hierarchical variational autoencoder. Through equivariant coarse-graining, we aggregate the fine-grained atomic coordinates of subgraphs connected via rotatable bonds, creating a variable-length coarse-grained latent representation. Our model uses a novel aggregated attention mechanism to restore fine-grained coordinates from the coarse-grained latent representation, enabling efficient generation of accurate conformers. Furthermore, we evaluate the chemical and biochemical quality of our generated conformers on multiple downstream applications, including property prediction and large-scale oracle-based protein docking. Overall, CoarsenConf generates more accurate conformer ensembles compared to prior generative models.

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

Can We Rely on Satellite Visible/Infrared Microphysical Retrievals of Boundary Layer Clouds in Partially Cloudy Scenes? Implications for Climate Research

This study addresses the longstanding question of the reliability of gridded visible/infrared satellite cloud properties in partially cloudy scenes. By using in-situ cloud probes and airborne Research Scanning Polarimeter (RSP) observations, we analyze bias changes in satellite retrievals from the Spinning Enhanced Visible Infra-Red Imager (SEVIRI) geostationary sensor during the ORACLES campaign. Biases in cloud optical depth (τ) and droplet effective radius (r e ) modestly change for cloud area fraction greater than 35%. The agreement between SEVIRI and RSP r e substantially improves when the retrievals are averaged after removing pixels with τ < 3.0, yielding biases indistinguishable from overcast scenes. In addition, satellite and RSP show an excellent agreement for closed- and open-cell stratocumulus clouds, showing that the satellite retrievals capture spatial changes of r e , and confirming that satellites can faithfully reproduce real physical features for optically thick and partially cloudy scenes. We demonstrate that a simple methodology can minimize uncertainties in satellite-based climate studies.

Painemal, David [NASA Langley Research Center, Ham↗
DOE OSTI2026

Model Sensitivities of Biomass-Burning Aerosol Chemical Aging, Sulfate Formation, and Cloud Droplet Activation in the Southeastern Atlantic Using CESM and E3SM

Biomass-burning smoke drives large uncertainty in climate projections of the Earth's radiative balance. This is due to the chemical and physical evolution of smoke and its impact on clouds and radiation. Here we focus on the southeastern Atlantic region and its inflow of African biomass-burning smoke during August 2017. We evaluate smoke properties and processes in two coupled earth-system models, the Energy Exascale Earth System Model (E3SM) and Community Earth System Model (CESM). These are compared against in situ aircraft observations from two field campaigns, ObseRvations of Aerosols above CLouds and their intEractionS (ORACLES) and CLoud–Aerosol–Radiation Interaction and Forcing: Year 2017 (CLARIFY-2017). Observations reveal an increase and subsequent decrease in smoke mean diameter, and a steady decrease in the mass ratio of organic aerosol (OA) to black carbon aerosol (BC) (OA:BC) over 4–12 days of aging, neither captured by the base models. Implementation of a photolytic loss scheme for secondary organic aerosol (SOA)—as a proxy for other heterogeneous volatilization chemistry—and a ∼1-day conversion for primary OA to SOA significantly improves the representation of this loss. In the boundary layer, both models show dimethyl sulfide driving a large increase in the sulfate aerosol mass fraction from the free troposphere, which is consistent with observations. Finally, models tend to underpredict cloud droplet number concentration partially due to weak modeled turbulent updraft strength, and model performance improves when the parameterized turbulent updraft strength is increased substantially. These results are expected to provide insights into future model development to reduce climate model uncertainties.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Multi-campaign ship and aircraft observations of marine cloud condensation nuclei and droplet concentrations

In situ marine cloud droplet number concentrations (CDNCs), cloud condensation nuclei (CCN), and CCN proxies, based on particle sizes and optical properties, are accumulated from seven field campaigns: ACTIVATE; NAAMES; CAMP 2 EX; ORACLES; SOCRATES; MARCUS; and CAPRICORN2. Each campaign involves aircraft measurements, ship-based measurements, or both. Measurements collected over the North and Central Atlantic, Indo-Pacific, and Southern Oceans, represent a range of clean to polluted conditions in various climate regimes. With the extensive range of environmental conditions sampled, this data collection is ideal for testing satellite remote detection methods of CDNC and CCN in marine environments. Remote measurement methods are vital to expanding the available data in these difficult-to-reach regions of the Earth and improving our understanding of aerosol-cloud interactions. The data collection includes particle composition and continental tracers to identify potential contributing CCN sources. Several of these campaigns include High Spectral Resolution Lidar (HSRL) and polarimetric imaging measurements and retrievals that will be the basis for the next generation of space-based remote sensors and, thus, can be utilized as satellite surrogates.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Derivative-free stochastic optimization via adaptive sampling strategies

In this paper, we present a novel derivative-free framework for solving unconstrained stochastic optimization problems. Many problems in fields ranging from simulation optimization to reinforcement learning to quantum computing involve settings where only stochastic function values are obtained via a zeroth-order oracle, which has no available gradient information and necessitates the usage of derivative-free optimization methodologies. Our approach includes estimating gradients using stochastic function evaluations and integrating adaptive sampling techniques to control the accuracy in these stochastic approximations. Our framework encapsulates several gradient estimation techniques, including standard finite-difference, Gaussian smoothing, sphere smoothing, randomized coordinate finite-difference, and randomized subspace finite-difference methods. We provide theoretical convergence guarantees for our framework and analyze the worst-case iteration and sample complexities associated with each gradient estimation method. Finally, we demonstrate the empirical performance of the methods on logistic regression and nonlinear least squares problems.

Adaptive sampling↗
DOE OSTI2021

Large gradients via correlation in random parameterized quantum circuits

Scaling of variational quantum algorithms to large problem sizes requires efficient optimization of random parameterized quantum circuits. For such circuits with uncorrelated parameters, the presence of exponentially vanishing gradients in cost function landscapes is an obstacle to optimization by gradient descent methods. In this work, we prove that reducing the dimensionality of the parameter space by utilizing circuit modules containing spatially or temporally correlated gate layers can allow one to circumvent the vanishing gradient phenomenon. Here, examples are drawn from random separable circuits and asymptotically optimal variational versions of Grover's algorithm based on the quantum alternating operator ansatz. In the latter scenario, our bounds on cost function variation imply a transition between vanishing gradients and efficient trainability as the number of layers is increased toward $\mathcal{O}\left({2}^{n/2}\right)$, the optimal oracle complexity of quantum unstructured search.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Quantum simulation of second-quantized Hamiltonians in compact encoding

We describe methods for simulating general second-quantized Hamiltonians using the compact encoding, in which qubit states encode only the occupied modes in physical occupation number basis states. These methods apply to second-quantized Hamiltonians composed of a constant number of interactions, i.e., linear combinations of ladder operator monomials of fixed form. Compact encoding leads to qubit requirements that are optimal up to logarithmic factors. Here, we show how to use sparse Hamiltonian simulation methods for second-quantized Hamiltonians in compact encoding, give explicit implementations for the required oracles, and analyze the methods. We also describe several example applications including the free boson and fermion theories, the φ 4 -theory, and the massive Yukawa model, all in both equal-time and light-front quantization. Our methods provide a general-purpose tool for simulating second-quantized Hamiltonians, with optimal or near-optimal scaling with error and model parameters.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Multinucleon structure and dynamics via quantum computing

We propose a framework for computing the structure and dynamics for second-quantized many-nucleon Hamiltonians on quantum computers. We develop an oracle-based Hamiltonian input model that computes the many-nucleon states and nonzero Hamiltonian matrix elements of the many-nucleon system. With our Fock-state based input model, we show how to implement the sparse matrix simulation algorithms to calculate the dynamics of the second-quantized many-nucleon Hamiltonian. Based on the dynamics simulation methods, we also present the methodology for structure calculations of the many-nucleon system. In this work, we provide an explicit circuit design of our input model of the second-quantized Hamiltonian within a direct encoding scheme that maps the occupation of each available single-particle state in the many-nucleon state to the state of specific qubit in a quantum register. Here, we analyze our method and provide the asymptotic cost in computing resources for structure and dynamics calculations of many-nucleon systems. For pedagogical purposes, we demonstrate our input model with two model problems in restricted model spaces.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
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 OSTI2024

Exponential Improvements in the Simulation of Lattice Gauge Theories Using Near-Optimal Techniques

We report a first-of-its-kind analysis on post-Trotter simulation of U(1), SU(2), and SU(3) lattice gauge theories including fermions in arbitrary spatial dimension. We provide explicit circuit constructions as well as T-gate counts and logical qubit counts for Hamiltonian simulation. We find a reduction of up to 25 orders of magnitude in space-time volume over Trotter methods for simulations of non-Abelian lattice gauge theories relevant to the standard model. This improvement results from our algorithm having polynomial scaling with the number of colors in the gauge theory, achieved by utilizing oracle constructions relying on the sparsity of physical operators, in contrast to the exponential scaling seen in state-of-the-art Trotter methods, which employ explicit mappings onto Pauli operators. Our work demonstrates that the use of advanced algorithmic techniques leads to dramatic reductions in the cost of simulating fundamental interactions, bringing it in step with resources required for first-principles quantum simulation of chemistry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗