Search NASA⌕ Search

SEARCH · Search NASA

Results for “probabilistic computing”

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.

227 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Remote-Contact Catalysis for Target-Diameter Semiconducting Carbon Nanotube Arrays

Electrostatic catalysis has been an exciting development in chemical synthesis (beyond enzymes catalysis1 ) in recent years, boosting reaction rates and selectively producing certain reaction products2 . Most of the studies to date have been focused on using external electric field (EEF) to rearrange the charge distribution in small molecule reactions such as Diels-Alder addition3 , carbene reaction4 , etc. However, in order for these EEFs to be effective, a field on the order of 1 V/nm (10 MV/cm) is required, and the direction of the EEF has to be aligned with the reaction axis5 . Such a large and oriented EEF will be challenging for large-scale implementation, or materials growth with multiple reaction axis or steps. Here, we demonstrate that the energy band at the tip of an individual single-walled carbon nanotube6 (SWCNT) can be spontaneously shifted in a high-permittivity growth environment, with its other end in contact with a low-work function electrode (e.g., hafnium carbide or titanium carbide7 ). By adjusting the Fermi level at a point where there is a substantial disparity in the density of states (DOS) between semiconducting (s-) and metallic (m-) SWCNTs8 , we achieve effective electrostatic catalysis for s-SWCNT growth assisted by a weak EEF perturbation (200V/cm). This approach enables the production of high-purity (99.92%) s-SWCNT horizontal arrays with narrow diameter distribution (0.95±0.04 nm), targeting the requirement of advanced SWCNT-based electronics for future computing9-11. These findings highlight the potential of electrostatic catalysis in precise materials growth, especially for s-SWCNTs, and pave the way for the development of advanced SWCNT-based electronics12.

Wang, Jiangtao [Department of Electrical Engineeri↗
DOE OSTI2026

Classical-Quantum Algorithm for Solving Stochastic Programs

Stochastic programming provides a rigorous mathematical framework for making decisions under uncertainty in a risk-aware manner. Two-stage stochastic programming is, perhaps, the simplest form of this framework. Here the first-stage variables represent decisions that must be made "here and now" in the face of uncertainty, while the second-stage variables are decisions made after uncertain events. However, the broad adoption of stochastic programming has been hindered by computational challenges caused by the two-stage stochastic programming formulation which requires solving an ensemble of optimization problems. Using quantum amplitude estimation (QAE), quantum computers have shown the theoretic ability to compute expectations with Monte-Carlo methods with quadratically fewer samples than classical methods. In this work, we present a quantum algorithm for computing the expectation term using QAE for given first-stage decisions. Further, we detail methods of computing gradient information from the quantum calculation enabling the application of classical gradient-based optimization techniques. The result is a classical-quantum hybrid method of solving two-stage stochastic programs. These techniques are demonstrated with computational experiments based an engineering optimization problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Revealing the evolution of order in materials microstructures using multi-modal computer vision

The development of high-performance materials for microelectronics, energy storage, and extreme environments depends on our ability to describe and direct property-defining microstructural order. Our present understanding is typically derived from laborious manual analysis of imaging and spectroscopy data, which is difficult to scale, challenging to reproduce, and lacks the ability to reveal latent associations needed for mechanistic models. Here, we demonstrate a multi-modal machine learning (ML) approach to describe order from electron microscopy analysis of the complex oxide La 1−x Sr x FeO 3 . We construct a hybrid pipeline based on fully and semi-supervised classification, allowing us to evaluate both the characteristics of each data modality and the value each modality adds to the ensemble. We observe distinct differences in the performance of uni- and multi-modal models, from which we draw general lessons in describing crystal order using computer vision.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Using scalable computer vision to automate high-throughput semiconductor characterization

Abstract High-throughput materials synthesis methods, crucial for discovering novel functional materials, face a bottleneck in property characterization. These high-throughput synthesis tools produce 10 4 samples per hour using ink-based deposition while most characterization methods are either slow (conventional rates of 10 1 samples per hour) or rigid (e.g., designed for standard thin films), resulting in a bottleneck. To address this, we propose automated characterization (autocharacterization) tools that leverage adaptive computer vision for an 85x faster throughput compared to non-automated workflows. Our tools include a generalizable composition mapping tool and two scalable autocharacterization algorithms that: (1) autonomously compute the band gaps of 200 compositions in 6 minutes, and (2) autonomously compute the environmental stability of 200 compositions in 20 minutes, achieving 98.5% and 96.9% accuracy, respectively, when benchmarked against domain expert manual evaluation. These tools, demonstrated on the formamidinium (FA) and methylammonium (MA) mixed-cation perovskite system FA 1−x MA x PbI 3 , 0 ≤ x ≤ 1, significantly accelerate the characterization process, synchronizing it closer to the rate of high-throughput synthesis.

Science & Technology - Other Topics↗
DOE OSTI2026

Polynomial-time preparation of low-temperature Gibbs states for two-dimensional toric code

In this work, we propose a polynomial-time algorithm for preparing the Gibbs state of the two-dimensional toric code Hamiltonian at any temperature, starting from any initial state, significantly improving upon prior estimates that suggested exponential scaling with inverse temperature. We prove that fast mixing at low temperature for the two-dimensional toric code can be achieved by augmenting local jump operators with simple global jump operators, which enable efficient transitions between logical sectors. To establish tight lower bounds on the spectral gap, we introduce a new reduction method that eventually maps the problem to estimating the spectral gap of a perturbed graph Laplacian on a stair graph. Our proof also shows that the Lindblad dynamics with a digitally implemented low-temperature local Davies generator is able to efficiently drive the quantum state toward the ground state manifold.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Knowledge-guided learning with curated prior genetic biomarkers for robust model interpretation

Abstract Motivation Knowledge-guided learning offers effective and robust model training strategies in data-scarce settings by incorporating established domain knowledge, thereby enhancing generalization, robustness, and interpretability. By contrast, conventional deep learning approaches rely purely on data-driven learning, which can limit robust model interpretability, particularly in high-dimensional settings with limited size samples. In computational biology, knowledge-guided learning has primarily leveraged network- and structural-based knowledge, leading to biologically interpretable representations and enhanced predictive performance compared to conventional approaches. However, curated biomarkers, one of the most accessible forms of biological knowledge, remain largely unexplored within knowledge-guided paradigms. Results In this study, we propose a model-agnostic training paradigm, Biomarker-driven Explainable Prior-guided Learning (BioExPL), that can be applied to any neural networks that incorporates curated prior knowledge. BioExPL enforces neural networks to reflect curated biomarker priors in their latent representations through a novel knowledge-alignment loss. BioExPL consistently demonstrated significantly improved predictive performance and enhanced model interpretability with minimized computational overhead in simulation studies and intensive experiments on multiple cancer datasets. BioExPL not only integrates prior curated knowledge into the model but also accurately identifies unknown associated signals additionally. BioExPL is model-agnostic and domain-independent, enabling its integration into diverse neural network architectures. Availability and implementation The open-source is publicly available at: https://github.com/datax-lab/BioExPL.

Baek, Beomsu [Department of Computer Science, Univ↗
DOE OSTI2025

Optoelectronic polymer memristors with dynamic control for power-efficient in-sensor edge computing

Abstract As the demand for edge platforms in artificial intelligence increases, including mobile devices and security applications, the surge in data influx into edge devices often triggers interference and suboptimal decision-making. There is a pressing need for solutions emphasizing low power consumption and cost-effectiveness. In-sensor computing systems employing memristors face challenges in optimizing energy efficiency and streamlining manufacturing due to the necessity for multiple physical processing components. Here, we introduce low-power organic optoelectronic memristors with synergistic optical and mV-level electrical tunable operation for a dynamic “control-on-demand” architecture. Integrating signal sensing, featuring, and processing within the same memristors enables the realization of each in-sensor analogue reservoir computing module, and minimizes circuit integration complexity. The system achieves 97.15% fingerprint recognition accuracy while maintaining a minimal reservoir size and ultra-low energy consumption. Furthermore, we leverage wafer-scale solution techniques and flexible substrates for optimal memristor fabrication. By centralizing core functionalities on the same in-sensor platform, we propose a resilient and adaptable framework for energy-efficient and economical edge computing.

Optics↗
DOE OSTI2026

String-Breaking Dynamics in Quantum Adiabatic and Diabatic Processes

Confinement prohibits isolation of color charges, e.g., quarks, in nature via a process called string breaking : the separation of two charges results in an increase in the energy of a color flux, visualized as a string, connecting those charges. Eventually, creating additional charges is energetically favored, hence breaking the string. Such a phenomenon can be probed in simpler models, including quantum spin chains, enabling enhanced understanding of string-breaking dynamics. A challenging task is to understand how string breaking occurs as time elapses, in an out-of-equilibrium setting. This work establishes the phenomenology of dynamical string breaking induced by a gradual increase of string tension over time. It, thus, goes beyond instantaneous quench processes and enables tracking the real-time evolution of strings in a more controlled setting. We focus on domain-wall confinement in a family of quantum Ising chains. Our results indicate that, for sufficiently short strings and slow evolution, string breaking can be described by the transition dynamics of a two-state quantum system akin to a Landau-Zener process. For longer strings, a more intricate spatiotemporal pattern emerges: the string breaks by forming a superposition of bubbles (domains of flipped spins of varying sizes), which involve highly excited states. We finally demonstrate that string breaking driven only by quantum fluctuations can be realized in the presence of sufficiently long-ranged interactions. This work holds immediate relevance for studying string breaking in quantum-simulation experiments.

Ising model↗
DOE OSTI2026

SENTRA: A Modular Computational Graph Framework for Critical Mineral and Materials Supply Chains: Part I: Network Construction Latent-Quantity Estimation, and Temporal Graph Forecasting

Global supply chains for critical minerals and materials are complex, evolving networks of countries, products, production stages, and trade relationships. Existing analytical approaches are limited by fragmented data and static network representations that do not capture the dynamic production dependencies linking raw materials, intermediate products, and final goods across multiple countries. Trade and production statistics provide only a partial view of domestic production, inventories, and material flows, making it difficult to identify indirect sourcing pathways, hidden dependencies, and embedded foreign exposures. This paper introduces the Supply Chain Exposure Network Tracking and Risk Assessment (SENTRA) framework, a modular graph-based computational framework for constructing, analyzing, and forecasting dynamic supply chain networks. As the first paper in a three-part methodological series, it establishes the computational foundation of SENTRA by constructing a temporal attributed multi-relational graph whose nodes represent product–country pairs and whose edges encode observed trade and within-country value-chain relationships. Statistical estimation and constrained optimization recover latent production, final demand, and product input dependency coefficients while enforcing economic accounting constraints. Graph-derived exposure measures quantify direct, transshipment, value-chain, and multi-hop supply chain dependencies independently of the forecasting model. A temporal graph forecasting architecture based on a relational graph neural network then forecasts the evolution of the graph under mass-balance constraints with distribution-free conformal uncertainty quantification. Validation on the global aluminum supply chain shows that the learned graph representations recover economically meaningful supply chain structure, accurately forecast out-of-sample trade relationships, and produce well-calibrated prediction intervals. Subsequent papers apply this computational foundation to exposure assessment, disruption analysis, and scenario-based policy analysis, and extend the framework to multimaterial supply chain modeling and decision support.

36 MATERIALS SCIENCE↗