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.

29 records · Page 2
All sourcesNASA NTRSDOE OSTI
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 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 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↗
DOE OSTI2025

Synthesis of aerosol-cloud interactions over the southeast Atlantic throughout the seasonal cycle (Final Technical Report)

An analysis of the aerosol compositional, physical and optical datasets towards understanding why the single‐scattering‐albedo of smoke is so much lower over the southeast Atlantic than elsewhere, in particular the northern hemisphere. This includes data from the complementary NASA ORACLES aircraft campaign, which sampled closer to the African coast. The first analysis resulting from this prong of research was published earlier this year (Dobracki et al., 2023, ACP) and focused more on the free-tropospheric biomass burning aerosol (BBA). We primarily attributed the low SSA to a high number/mass fraction of black carbon, ranging from 15 to 40% of the total aerosol. We are further able to use other literature, the modified combustion efficiency, and the black carbon and carbon monoxide values to highlight a common source in dry, flame-efficient burning conditions of grasses. Condensation and coagulation of smaller aerosol particles onto the larger black carbon aerosols can also increased the SSA as the aerosol ages from 4 to 5 days. A comparison to data gathered over Ascension Island during the UK CLARIFY aircraft campaign indicates an organic aerosol loss relative to black carbon of about 50%. This is high compared to findings from other campaigns.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Extending Symmetry-Preserving Attention Networks (SPANet) for Jet Assignment in Fully Hadronic \(t\bar{t}\) Events

Fully hadronic \(t\bar{t}\) reconstruction requires assigning reconstructed jets to the two top-quark decay branches, \(t\bar{t}\to(Wb)(Wb)\to(qqb)(qqb)\). This is a combinatorially large, symmetry-rich, and frequently underconstrained set-assignment problem due to detector effects and partial reconstructability. SPANet provides a strong symmetry-preserving baseline for this task, but its standard inference eagerly commits to a single hypothesis and does not explicitly treat branch-level reconstructability decisions. We present a two-stage extension of the SPANet pipeline for fully hadronic \(t\bar{t}\) events: (i) SPANet is modified into a proposal model that generates a shortlist of candidate jet assignments; (ii) a custom dual-head set transformer is trained to re-rank these candidates and identify reconstructible branches. Our extension gives modest improvements in candidate-selection efficiency, with SPANet achieving \(69.9\%\) and our extension achieving \(71.1\%\). Finally, an oracle study of the generated shortlist shows a substantial upper bound of \(88.5\%\) on the evaluated fully reconstructable subset, suggesting that the shortlist contains significant residual information that is not fully exploited.

Lisondodi Tada, Mateo [Puerto Rico U., Mayaguez] (↗
DOE OSTI2024

NDBC Buoy 46026

The purpose of this dataset is to provide filtered, averaged buoy surface meteorological and oceanographic data and standardize the data format into NetCDF. The buoy was deployed by NDBC. These data are part of the observational database created for supporting the floating offshore wind project within the DOE-funded ORACLE project.

17 WIND ENERGY↗
DOE OSTI2025

Block encoding bosons by signal processing

Block Encoding (BE) is a crucial subroutine in many modern quantum algorithms, including those with near-optimal scaling for simulating quantum many-body systems, which often rely on Quantum Signal Processing (QSP). Currently, the primary methods for constructing BEs are the Linear Combination of Unitaries (LCU) and the sparse oracle approach. In this work, we demonstrate that QSP-based techniques, such as Quantum Singular Value Transformation (QSVT) and Quantum Eigenvalue Transformation for Unitary Matrices (QETU), can themselves be efficiently utilized for BE implementation. Specifically, we present several examples of using QSVT and QETU algorithms, along with their combinations, to block encode Hamiltonians for lattice bosons, an essential ingredient in simulations of high-energy physics. We also introduce a straightforward approach to BE based on the exact implementation of Linear Operators Via Exponentiation and LCU (LOVE-LCU). We find that, while using QSVT for BE results in the best asymptotic gate count scaling with the number of qubits per site, LOVE-LCU outperforms all other methods for operators acting on up to qubits, highlighting the importance of concrete circuit constructions over mere comparisons of asymptotic scalings. Using LOVE-LCU to implement the BE, we simulate the time evolution of single-site and two-site systems in the lattice theory using the Generalized QSP algorithm and compare the gate counts to those required for Trotter simulation.

Kane, Christopher F↗
DOE OSTI2025

Testing convolutional neural network based deep learning systems: a statistical metamorphic approach

Machine learning technology spans many areas and today plays a significant role in addressing a wide range of problems in critical domains,i.e., healthcare, autonomous driving, finance, manufacturing, cybersecurity,etc. Metamorphic testing (MT) is considered a simple but very powerful approach in testing such computationally complex systems for which either an oracle is not available or is available but difficult to apply. Conventional metamorphic testing techniques have certain limitations in verifying deep learning-based models (i.e., convolutional neural networks (CNNs)) that have a stochastic nature (because of randomly initializing the network weights) in their training. In this article, we attempt to address this problem by using a statistical metamorphic testing (SMT) technique that does not require software testers to worry about fixing the random seeds (to get deterministic results) to verify the metamorphic relations (MRs). We propose seven MRs combined with different statistical methods to statistically verify whether the program under test adheres to the relation(s) specified in the MR(s). We further use mutation testing techniques to show the usefulness of the proposed approach in the healthcare space and test two CNN-based deep learning models (used for pneumonia detection among patients). The empirical results show that our proposed approach uncovers 85.71% of the implementation faults in the classifiers under test (CUT). Furthermore, we also propose an MRs minimization algorithm for the CUT, thus saving computational costs and organizational testing resources.

Computer Science↗
DOE OSTI2026

Exact and Fixed-Point Grover Search with Qudits

Grover's algorithm provides a quadratic speedup for searching unstructured databases and is traditionally implemented with qubits in Hilbert spaces whose dimensions are powers of two. With the advent of quantum platforms utilizing qudits---quantum systems with more than two levels---there is a need to generalize Grover search to these architectures, including heterogeneous systems with qudits of varying dimensions. Here, we present a unified framework for qudit-based Grover search, detailing the construction of oracles and diffusion operators with and without ancilla qubits and generalizing deterministic and fixed-point search variants that ensure exact or bounded success probabilities. We analyze phase-matching techniques and provide explicit circuit decompositions suitable for diverse hardware platforms. We also compare the corresponding trajectories on the Bloch sphere to provide an intuitive visualization of how the different phase choices amplify the target state. These results facilitate flexible, hardware-oriented protocols for implementing Grover search on qudit processors, potentially reducing circuit depth and enhancing success probabilities, thereby offering a practical toolkit for quantum computation and sensing applications leveraging multilevel quantum systems.

Roy, Tanay [Fermilab] (ORCID:000000019442862X)↗
DOE OSTI2026

Quantum block encoding for one-pair semiseparable matrices

Quantum block encoding (QBE) is a crucial step in the development of most quantum algorithms, as it provides an embedding of a given matrix into a suitable larger unitary matrix. Historically, the development of efficient techniques for QBE has mostly focused on sparse matrices; less effort has been devoted to data-sparse (e.g., rank-structured) matrices. In this work we examine a particular case of rank structure, namely, one-pair semiseparable matrices. We present a new block encoding approach that relies on a suitable factorization of the given matrix as the product of triangular and diagonal factors. To encode the matrix, the algorithm needs $2\log(N)+7$ ancillary qubits. Assuming that the data input oracles can be implemented with polylogarithmic depth, or that a QRAM input model is available, our proposed method requires $\mathcal{O}({\rm polylog} (N))$ time and has an error of $\mathcal{O}(N^2)$, where $N$ is the matrix size.

Antonioli, Giacomo [Pisa U.; CERN] (ORCID:00090000↗