Search NASA⌕ Search

SEARCH · Search NASA

Results for “classical optimizers”

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 541 records · Page 30
All sourcesNASA NTRSDOE OSTI
NASA NTRS2004

Fast Query-Optimized Kernel-Machine Classification

A recently developed algorithm performs kernel-machine classification via incremental approximate nearest support vectors. The algorithm implements support-vector machines (SVMs) at speeds 10 to 100 times those attainable by use of conventional SVM algorithms. The algorithm offers potential benefits for classification of images, recognition of speech, recognition of handwriting, and diverse other applications in which there are requirements to discern patterns in large sets of data. SVMs constitute a subset of kernel machines (KMs), which have become popular as models for machine learning and, more specifically, for automated classification of input data on the basis of labeled training data. While similar in many ways to k-nearest-neighbors (k-NN) models and artificial neural networks (ANNs), SVMs tend to be more accurate. Using representations that scale only linearly in the numbers of training examples, while exploring nonlinear (kernelized) feature spaces that are exponentially larger than the original input dimensionality, KMs elegantly and practically overcome the classic curse of dimensionality. However, the price that one must pay for the power of KMs is that query-time complexity scales linearly with the number of training examples, making KMs often orders of magnitude more computationally expensive than are ANNs, decision trees, and other popular machine learning alternatives. The present algorithm treats an SVM classifier as a special form of a k-NN. The algorithm is based partly on an empirical observation that one can often achieve the same classification as that of an exact KM by using only small fraction of the nearest support vectors (SVs) of a query. The exact KM output is a weighted sum over the kernel values between the query and the SVs. In this algorithm, the KM output is approximated with a k-NN classifier, the output of which is a weighted sum only over the kernel values involving k selected SVs. Before query time, there are gathered statistics about how misleading the output of the k-NN model can be, relative to the outputs of the exact KM for a representative set of examples, for each possible k from 1 to the total number of SVs. From these statistics, there are derived upper and lower thresholds for each step k. These thresholds identify output levels for which the particular variant of the k-NN model already leans so strongly positively or negatively that a reversal in sign is unlikely, given the weaker SV neighbors still remaining. At query time, the partial output of each query is incrementally updated, stopping as soon as it exceeds the predetermined statistical thresholds of the current step. For an easy query, stopping can occur as early as step k = 1. For more difficult queries, stopping might not occur until nearly all SVs are touched. A key empirical observation is that this approach can tolerate very approximate nearest-neighbor orderings. In experiments, SVs and queries were projected to a subspace comprising the top few principal- component dimensions and neighbor orderings were computed in that subspace. This approach ensured that the overhead of the nearest-neighbor computations was insignificant, relative to that of the exact KM computation.

Mazzoni, Dominic↗
NASA NTRSDate not supplied

Quantum-Assisted Variational Segmentation for Image-to-Image Wildfire Detection Using Satellite Data

The quantum computing community has been searching for suitable applications to demonstrate the potential of near-term quantum devices. Quantum machine learning is a potential candidate, particularly using models that cannot be efficiently simulated with classical computers [1, 2]. This work focuses on a transition phase of quantum computers where the quantum machine learning model is still simulable classically but projected not to be simulable as the size of the model grows. Ultimately quantum computers may have advantages for high-dimensional real-world problems. Due to the limited number of qubits in current noisy intermediate-scale quantum (NISQ) devices, the direct application of quantum computers in high dimensional data is not feasible. To remedy this problem, an encoder-decoder architecture can be utilized. The encoder model would transform the high-dimensional data into a compact representation, to a level that small quantum computers can be used today (or in the near future), and the decoder would take the quantum processed outputs back to the high-dimensional space. Addressing the two challenges of quantum machine learning, this work investigates a hybrid supervised generative model with a quantum Ising Born machine embedded as the latent distribution. The model contains four main parts (Figure 1.a.): (1) a U-NET architecture responsible for learning segmentation flow, (2) a Prior network responsible for learning an encoded latent distribution of the input data, (3) a Born machine which represents the latent distribution, and (4) a Posterior network in charge of learning the joint encoded latent distribution of inputs and target data. The initial model, proposed by [3], is optimized by (1) maximizing the overlap of the prior and posterior latent distributions, and (2) minimizing the segmentation loss. The proposed model is designed to be investigated in a simulation environment applied to the real-world application of wildfire segmentation. Specifically, the model is designed to solve the patchy wildfire segmentations of Moderate Resolution Imaging Spectroradiometer (MODIS) by taking the MODIS observations and using Visible Infrared Imaging Radiometer Suite’s (VIIRS) consistent wildfire product as the target. The model solves patchy wildfire segmentations and provides insight into the epistemic errors sourced from model variation. The model utilizes the Born machine as a QUBO solver to represent the latent space as a Bernoulli distribution. The proposed configuration allows the variational segmentation model to leverage the true quantum probabilistic nature and derive a more expressive latent configuration, increasing the model performance in describing wildfire segmentations. The quantum probabilistic information of the Born machine is directly incorporated in the Kullback-Leibler divergence loss in the prior and posterior distributions, forcing the Bernoulli latent distribution to maximize the overlap of input and joint input-target distributions. The proposed model is then trained and compared with a baseline only consisting of direct Bernoulli latent distribution with no Born machine representing the latent space. The models are evaluated based on the segmentation metrics, such as precision, recall, intersect of union, with uncertainty boundaries accounting for the stochastic nature of the model. Our findings show that even in low latent-dimensional space (due to the limit in computational power of the classical quantum simulator), we are able to effectively capture the latent representation and hence the model performs better than the baseline. The findings are a projection for scaling the model into higher dimensional latent space with the Born machine surpassing the baseline performance. Figure 1. Sub-figure (a) demonstrates the architecture for the training phase. The model consists of a Prior and Posterior network that encode inputs and joint input-target data into compact representations, respectively. The Born machine represents the latent distribution, and the U-NET branch learns the segmentation patterns of the data. The stochasticity is introduced to the U-NET through its last layer to create meaningful but stochastic segmentations. Sub-figure (b) represents the inference phase where the model takes the stochastic behavior from the prior network and injects that into the U-NET. Each attempt of inference will generate different but similar segmentations from the same distribution of the wildfire event. REFERENCES [1] Coyle, B., Mills, D., Danos, V., & Kashefi, E. (2020). The Born supremacy: quantum advantage and training of an Ising Born machine. npj Quantum Information, 6(1), 1-11. [2] Liu, J. G., & Wang, L. (2018). Differentiable learning of quantum circuit born machines. Physical Review A, 98(6), 062324. [3] Kohl, S., Romera-Paredes, B., Meyer, C., De Fauw, J., Ledsam, J. R., Maier-Hein, K., ... & Ronneberger, O. (2018). A probabilistic u-net for segmentation of ambiguous images. Advances in neural information processing systems, 31.

quantum machine learning↗
DOE OSTI2026

Methanol Partial Oxidation on Cu(111) and PtCu(111) Single-Atom Alloy Surfaces: Effect of Surface Oxygen Coverage on Selectivity

The selective oxidation of methanol to formaldehyde on Cu surfaces is an important and well-studied reaction. However, a systematic analysis of product selectivity as a function of oxygen coverage on Cu(111) and Cu-based single-atom alloys (SAAs) has not been previously reported. In this work, we present a comprehensive investigation of deuterated methanol (CD 3 OH) partial oxidation on Cu(111) and 1% PtCu(111) SAA surfaces as a function of preadsorbed oxygen coverage. Temperature-programmed desorption (TPD) and X-ray photoelectron spectroscopy (XPS) reveal that isolated Pt atoms inhibit the initial surface oxidation of Cu(111) under low oxygen exposures. Despite this difference in oxidation kinetics, the product selectivity remains largely unaffected: on both Cu(111) and PtCu(111), formaldehyde (CD 2 O) is the predominant partial oxidation product over a broad range of oxygen coverages. The selectivity toward formaldehyde peaks at intermediate oxygen coverages (∼0.3 monolayers, ML), indicating the existence of an optimal oxygen loading for partial oxidation. Notably, the similar product selectivities on Cu(111) and PtCu(111) over a range of surface oxygen coverage indicate that Pt single atoms do not significantly alter the reaction pathway or shift the optimal oxygen coverage for formaldehyde formation. Control experiments confirm that Cu(111) is unreactive toward methanol in the absence of oxygen, while PtCu(111) surfaces produce a small amount of formaldehyde even when oxygen is not preadsorbed, indicating that isolated Pt atoms facilitate O−H activation at below 150 K, leading to H 2 desorption, followed by C−D activation at higher temperatures (∼350 K). Density functional theory (DFT)-based calculations show that Pt atoms increase the O 2 dissociation barrier relative to Cu(111), consistent with the observed inhibition of oxidation at low exposures. Overall, this work provides the first detailed selectivity map for methanol oxidation on oxidized Cu(111) and PtCu(111) SAA surfaces. By linking classical mechanistic insights such as methoxy- and formate-mediated pathways with single-atom alloy catalyst design, this work demonstrates that while Pt substitution modulates the oxidation kinetics and oxygen binding, the overall selectivity toward formaldehyde is governed primarily by oxygen coverage. These findings underscore the potential of isolated dopants to tune surface oxidation behavior without compromising the intrinsic partial oxidation selectivity of copper-based catalysts.

36 MATERIALS SCIENCE↗
NASA NTRSDate not supplied

A NASA Perspective on Quantum Computing: Algorithmic Opportunities and Challenges

In the last couple of decades, the world has seen several stunning instances of quantum algorithms that provably outperform the best classical algorithms. For most problems, however, it is currently unknown whether quantum algorithms can provide an advantage, and if so how to design quantum algorithms that realize such advantages. Today, classical heuristics are used to solve many of the most challenging computational problems arising in the practical world, algorithms that have been shown to be effective empirically but have not been mathematically proven to outperform other approaches. With the advent of quantum advantage, the ability of current quantum hardware to do certain computations beyond the ability of even that largest supercomputers, we have an unprecedented opportunity to explore heuristic quantum algorithms. The next few years will be exciting as empirical testing of quantum heuristic algorithms becomes more and more feasible. The talk will begin overview of the NASA QuAIL team’s ongoing quantum computing investigations, and then focus on both near-term and longer term algorithms for optimization, including distributed algorithms.

quantum computing↗
NASA NTRSDate not supplied

Probing Sensitivity of Discharge Characteristics to Model Selection using Uncertainty Quantification in an aprotic Li-Oxygen Battery

Currently, there are several models in the literature, such as kinetic models, microstructural models, and mass transport models that describe a Li-air battery's discharge behavior. Many of these models are calibrated and tested at low current densities and cannot be easily transferred to high current densities. Even at low current densities, there is no quantitative method for a researcher to choose a reaction kinetic model such as classical Butler-Volmer and its derivatives, and modified Marcus-Hush-Chidsey, a resistance model for lithium peroxide such as electron transport via tunneling or linear resistivity, a surface coverage model (lithium peroxide growth) such as partial coverage or full coverage, and mass transport model (discussed in Ref. [1]). Also, it is time-consuming to test different models at high current density (1C) due to a lack of well-tested models and well-calibrated model parameters. For this presentation, we will develop an analytical model, which acts as a surrogate model for a sophisticated finite element model to predict discharge time and discharge voltage. Next, we use an uncertainty quantifying technique called reduced-order stochastic optimization [2, 3] to determine the uncertainty in model parameters for rate kinetics, lithium peroxide resistivity, and parasitic resistance. Finally, a finite element simulation is performed to determine the error introduced by the surrogate model and its influence on the uncertainty in the model parameters.

M Mehta↗
NASA NTRS1999

Development of Curved-Plate Elements for the Exact Buckling Analysis of Composite Plate Assemblies Including Transverse-Shear Effects

The analytical formulation of curved-plate non-linear equilibrium equations including transverse-shear-deformation effects is presented. A unified set of non-linear strains that contains terms from both physical and tensorial strain measures is used. Linearized, perturbed equilibrium equations (stability equations) that describe the response of the plate just after buckling occurs are derived. These equations are then modified to allow the plate reference surface to be located a distance z(sub c) from the centroidal surface. The implementation of the new theory into the VICONOPT exact buckling and vibration analysis and optimum design computer program is described. The terms of the plate stiffness matrix using both classical plate theory (CPT) and first-order shear-deformation plate theory (SDPT) are presented. The effects of in-plane transverse and in-plane shear loads are included in the in-plane stability equations. Numerical results for several example problems with different loading states are presented. Comparisons of analyses using both physical and tensorial strain measures as well as CPT and SDPT are made. The computational effort required by the new analysis is compared to that of the analysis currently in the VICONOPT program. The effects of including terms related to in-plane transverse and in-plane shear loadings in the in-plane stability equations are also examined. Finally, results of a design-optimization study of two different cylindrical shells subject to uniform axial compression are presented.

McGowan, David M.↗
DOE OSTI2024

Nonlinear model predictive control for mode‐switching operation of reversible solid oxide cell systems

Abstract Solid oxide cells (SOCs) are a promising dual‐mode technology for the production of hydrogen through high‐temperature water electrolysis, and the generation of power through a fuel cell reaction that consumes hydrogen. Switching between these two modes as the price of electricity fluctuates requires reversible SOC operation and accurate tracking of hydrogen and power production set points. Moreover, a well‐functioning control system is important to avoid cell degradation during mode‐switching operation. In this article, we apply nonlinear model predictive control (NMPC) to an SOC module and supporting equipment and compare NMPC performance to classical proportional‐integral (PI) control strategies, while switching between the modes of hydrogen and power production. While both control methods provide similar performance across various metrics during mode switching, NMPC demonstrates a significant advantage in reducing cell thermal gradients and curvatures (mixed spatial‐temporal partial derivatives), thereby helping to mitigate long‐term degradation.

08 HYDROGEN↗
DOE OSTI2025

Nonlinear Ensemble Filtering with Diffusion Models: Application to the Surface Quasigeostrophic Dynamics

The intersection between classical data assimilation methods and novel machine learning techniques has attracted significant interest in recent years. Here, we explore another promising solution in which diffusion models are used to formulate a robust nonlinear ensemble filter for sequential data assimilation. Unlike standard machine learning methods, the proposed ensemble score filter (EnSF) is completely training free and can efficiently generate a set of analysis ensemble members. Here, in this study, we apply the EnSF to a surface quasigeostrophic model and compare its performance against the popular local ensemble transform Kalman filter (LETKF), which makes Gaussian assumptions in the analysis step. Numerical tests demonstrate that EnSF maintains stable performance in the absence of localization and for a variety of experimental settings. We find that while LETKF maintains optimal performance in the case of linear observations of the entire state and a perfect model, EnSF shows improvements over LETKF when nonlinear observations are assimilated and the system is subject to unexpected model errors. A spectral decomposition of the analysis results in this nonlinear observation regime shows that the largest improvements over LETKF occur at large scales (small wavenumbers), where LETKF lacks sufficient ensemble spread. Overall, this initial application of EnSF to a geophysical model of intermediate complexity motivates further development of the algorithm for more realistic problems.

Artificial intelligence↗
DOE OSTI2025

LUNA: LUT-Based Neural Architecture for Fast and Low-Cost Qubit Readout

Qubit readout is a critical operation in quantum computing systems, which maps the analog response of qubits into discrete classical states. Deep neural networks (DNNs) have recently emerged as a promising solution to improve readout accuracy . Prior hardware implementations of DNN-based readout are resource-intensive and suffer from high inference latency, limiting their practical use in low-latency decoding and quantum error correction (QEC) loops. This paper proposes LUNA, a fast and efficient superconducting qubit readout accelerator that combines low-cost integrator-based preprocessing with Look-Up Table (LUT) based neural networks for classification. The architecture uses simple integrators for dimensionality reduction with minimal hardware overhead, and employs LogicNets (DNNs synthesized into LUT logic) to drastically reduce resource usage while enabling ultra-low-latency inference. We integrate this with a differential evolution based exploration and optimization framework to identify high-quality design points. Our results show up to a 10.95x reduction in area and 30% lower latency with little to no loss in fidelity compared to the state-of-the-art. LUNA enables scalable, low-footprint, and high-speed qubit readout, supporting the development of larger and more reliable quantum computing systems.

Farooq, M. A. [Arizona State U., Tempe]↗
DOE OSTI2024

Adsorption Thermodynamics for Process Simulation

Adsorption has rapidly evolved in recent decades and is an established separation technology extensively practiced in gas separation industries and others. However, rigorous thermodynamic modeling of multicomponent adsorption equilibrium remains elusive, and industrial practitioners rely heavily on expensive and time-consuming trial-and-error pilot studies to develop adsorption units. Here, this article highlights the need for rigorous adsorption thermodynamic models and the limitations and deficiencies of existing models such as the extended Langmuir isotherm, dual-process Langmuir isotherm, and adsorbed solution theory. It further presents a series of recent advances in the generalization of the classical Langmuir isotherm of single-component adsorption by deriving an activity coefficient model to account for the adsorbed phase adsorbate–adsorbent interactions, substituting adsorbed phase adsorbate and vacant site concentrations with activities, and extending to multicomponent competitive adsorption equilibrium, both monolayer and multilayer. Requiring a minimum set of physically meaningful model parameters, the generalized Langmuir isotherm for monolayer adsorption and the generalized Brunauer–Emmett–Teller isotherm for multilayer adsorption address various thermodynamic modeling challenges including adsorbent surface heterogeneity, isosteric enthalpies of adsorption, BET surface areas, adsorbed phase nonideality, adsorption azeotrope formation, and multilayer adsorption. Also discussed is the importance of quality adsorption data that cover sufficient temperature, pressure, and composition ranges for reliable determination of the model parameters to support adsorption process simulation, design, and optimization.

09 BIOMASS FUELS↗
NASA NTRS2000

Critical Questions for Space Human Factors

Traditional human factors contributions to NASA's crewed space programs have been rooted in the classic approaches to quantifying human physical and cognitive capabilities and limitations in the environment of interest, and producing recommendations and standards for the selection or design of mission equipment. Crews then evaluate the interfaces, displays, or equipment, and with the assistance of human factors experts, improvements are made as funds, time, control documentation, and weight allow. We have come a long way from the early spaceflight days, where men with the ' right stuff were the solution to operating whatever equipment was given to them. The large and diverse Shuttle astronaut corps has impacted mission designs to accommodate a wide range of human capabilities and preferences. Yet with existing long duration experience, we have seen the need to address a different set of dynamics when designing for optimal crew performance: critical equipment and mission situations degrade, and human function changes with mission environment, situation, and duration. Strategies for quantifying the critical nature of human factors requirements are being worked by NASA. Any exploration-class mission will place new responsibilities on mission designers to provide the crew with the information and resources to accomplish the mission. The current duties of a Mission Control Center to monitor system status, detect degradation or malfunction, and provide a proven solution, will need to be incorporated into on-board systems to allow the crew autonomous decision-making. The current option to resupply and replace mission systems and resources, including both vehicle equipment and human operators, will be removed, so considerations of maintenance, onboard training, and proficiency assessment are critical to providing a self-sufficient crew. As we 'move in' to the International Space Station, there are tremendous opportunities to investigate our ability to design for autonomous crews. Yet prioritizing the research that can and should be done by NASA will be based on the critical nature of the issues, and the impact of the individual research questions on mission design. The risks to crew health and safety associated with answering critical human factors issues must be properly included and communicated in order to support the Agency's decisions regarding future space programs.

Woolford, Barbara↗
NASA NTRS1990

Nonlinear feedback control for high alpha flight

Analytical aerodynamic models are derived from a high alpha 6 DOF wind tunnel model. One detail model requires some interpolation between nonlinear functions of alpha. One analytical model requires no interpolation and as such is a completely continuous model. Flight path optimization is conducted on the basic maneuvers: half-loop, 90 degree pitch-up, and level turn. The optimal control analysis uses the derived analytical model in the equations of motion and is based on both moment and force equations. The maximum principle solution for the half-loop is poststall trajectory performing the half-loop in 13.6 seconds. The agility induced by thrust vectoring capability provided a minimum effect on reducing the maneuver time. By means of thrust vectoring control the 90 degrees pitch-up maneuver can be executed in a small place over a short time interval. The agility capability of thrust vectoring is quite beneficial for pitch-up maneuvers. The level turn results are based currently on only outer layer solutions of singular perturbation. Poststall solutions provide high turn rates but generate higher losses of energy than that of classical sustained solutions.

Stalford, Harold↗
NASA NTRS1992

Study of basic physical processes in liquid rocket engines

Inconsistencies between analytical results and measurements for liquid rocket thrust chamber performance, which escape suitable explanations, have motivated the examination of the basic phys ical modeling formulations as to their unlimited application. The publication of Prof. D. Straub's book, 'Thermofluid-dynamics of Optimized Rocket Propulsions,' further stimulated the interest of understanding the gas dynamic relationships in chemically reacting mixtures. A review of other concepts proposed by Falk-Ruppel (Gibbsian Thermodynamics), Straub (Alternative Theory, AT), Prigogine (Non-Equilibrium Thermodynamics), Boltzmann (Kinetic Theory), and Truesdell (Rational Mechanism) has been made to obtain a better understanding of the Navier-Stokes equation, which is now used extensively for chemically reacting flow treatment in combustion chambers. In addition to the study of the different concepts, two workshops were conducted to clarify some of the issues. The first workshop centered on Falk-Ruppel's new 'dynamics' concept, while the second one concentrated on Straub's AT. In this report brief summaries of the reviewed philosophies are presented and compared with the classical Navier-Stokes formulation in a tabular arrangement. Also the highlights of both workshops are addressed.

Wu, S. T.↗
DOE OSTI2024

SQMS Quantum R&D in Machine Learning, Optimization and Sensing beyond Fundamental Physics Applications

This newly formed team at SQMS under the Ecosystem Thrust is looking to develop capabilities impacting societal advances outside the core domain of HEP and condensed matter physics. We explicitly leverage the experimental and algorithmic innovations developed across all groups as well as connect to broad-scope external projects of the diverse team of PIs. As the inaugural set of projects, we are studying numerically quantum machine learning models inspired by efficiently trainable echo-state and orthogonal neural networks and developing designs for related experiments to be performed on quantum processors based on SQMS SRF cQED technology and Rigetti s transmon arrays. Investigated models exploit ideas and lessons learned from multiple prior work by SQMS team members in a variety of internal and external activities [R1]. Target initial applications include noisy signal processing, potentially captured by quantum sensors or noisy QPUs, as well as simulation and classification of healthcare data. For instance, image reconstruction of the brain s electrical properties by solving the inverse Maxwell equation problem with uncertainty [R2] through a hybrid quantum-classical physics-informed architecture for time-dependent processes [R3]. The group is also investigating the application and development of novel quantum sensors based on magnetic levitation of a superconducting sphere coupled to a superconducting qubit. This coupling enables high-precision measurements of the position of the sphere, which can be used for sensitive detection of forces, enabling practical applications such as gravimetry for geophysics analysis, or accelerometry for GPS-denied navigation [R4] [R1] Rieffel, Eleanor G., Ata Akbari Asanjan, M. Sohaib Alam, Namit Anand, David E. Bernal Neira, Sophie Block, Lucas T. Brady et al. "Assessing and advancing the potential of quantum computing: A NASA case study." Future Generation Computer Systems (2024). [R2] Yu, X., Serrall s, J.E., Giannakopoulos, I.I., Liu, Z., Daniel, L., Lattanzi, R. and Zhang, Z., 2023. Pifon-ept: Mr-based electrical property tomography using physics-informed fourier networks. IEEE Journal on Multiscale and Multiphysics Computational Techniques. [R3] Wudarski, Filip, Daniel OConnor, Shaun Geaney, Ata Akbari Asanjan, Max Wilson, Elena Strbac, P. Aaron Lott, and Davide Venturelli. "Hybrid quantum-classical reservoir computing for simulating chaotic systems." arXiv preprint arXiv:2311.14105 (2023). [R4] Higgins, Gerard, Saarik Kalia, and Zhen Liu. "Maglev for dark matter: Dark-photon and axion dark matter sensing with levitated superconductors." Physical Review D 109.5 (2024): 055024.

Venturelli, Davide↗
DOE OSTI2026

Quantum computing approach for building surface sunlit in urban-scale energy modeling

Solar shadow calculations are needed in building energy modeling and performance simulation of PV systems installed on roofs or facades of buildings. We present a quantum computing approach for calculation of building surface sunlit fractions by recasting solar visibility as a binary optimization problem solved by quantum annealing. Each triangulated surface centroid is encoded as a binary qubit indicating sunlit or shaded status. Geometric visibility constraints are derived from the Möller-Trumbore intersection algorithm and converted into a constrained quadratic binary model compatible with contemporary quantum annealers. The coefficients were embedded to D-Wave quantum computer. To demonstrate feasibility, we conducted a case study in San Francisco for a target building with 52 triangles and roughly 2700 nearby triangles within 50 m evaluated at representative winter and summer solar positions. The results demonstrated that quantum annealing can reliably calculate and distinguish sunlit from shaded surfaces. Quantum samples achieved average accuracy exceeding 92.4 %, with the aggregate surface-level agreement approaching 99.9 %. The outputs of quantum computers agreed closely with classical algorithms, indicating practical feasibility and promising scalability. Finally, the hourly sunlit fractions of building surfaces can be obtained for urban energy modelling. This is the first study to apply quantum computing to the solar shadow and building surface sunlit calculation. It introduces a new paradigm that differs fundamentally from traditional approaches.

Deng, Zhipeng↗
DOE OSTI2026

Data Summarization and Inference at Scale

This is the final report for the DOE ASCR grant SC-0022260, Data Summarization and Inference at Scale, PI: Alex Pothen, Purdue University. The goal of the project was to solve data-intensive and compute-intensive problems in the physical sciences, engineering, information science, data science, etc. by designing and implementing new algorithms that could work with a subset of the data. The four subgoals were: (a) The solution of problems where the data is too large to be stored in the memory of a computer. In this streaming model of computation, the data arrives as a stream of elements to the computer, each element is processed as it arrives, and a decision is made to discard the data or to store it; only a small subset of the data proportional to the size of the output solution is stored, and when all the data has been streamed, a solution to the problem is computed from the stored subset. (b) The use of machine learning methods to compute solutions to data-intensive problems. The use of GPUs is critical to obtain high performance on machine learning tasks, but their memory sizes are smaller relative to that of CPUs. For large-scale problems, the data is sampled many times, and small samples are used with repetition, for robustness, to compute solutions to inference tasks. This sampling reduces the memory required to solve the problem, but attention is needed to avoid slow convergence to the solutions, and reduced accuracy of inference. We propose submodular optimization, Large Language Models, and physics-informed neural networks to enable GPU computations here. (c) Modeling and visualization of high-dimensional data using interpretable features. Clinical proteomic data sets from immunology for the detection of cancer and other diseases are temporal and high-dimensional, and algorithms for visualizing these data sets using clinically interpretable features are lacking. We propose methods that compute distances based on the optimal transportation problem and graph edit distances to address this problem. We also propose the use of optimal transport-based distances, spatial statistics, and network structure to classify image data sets, We apply these algorithms to electron micrographs of the peripheral nervous system in the digestive tract. (d) The design of data-intensive algorithms on emerging architectures, specifically, noisy, intermediate-scale quantum (NISQ) devices. Quantum computers offer the possibility of exploring large solution spaces due to the principle of superposition, but current quantum computers are limited by few qubits, short coherence times due to noise, poor interconections among the qubits, etc. We propose the use of the divide and conquer paradigm to solve large-scale problems, wherein collections of small subproblems are solved on the quantum devices, and the solutions to the subproblems are integrated into a solution for the original problem on a classical computer.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2011

The Interstellar Bullet Engine IRAS 05506+2414

Throughout their life-cycles, high-mass stars inject large amounts of energy and momentum into theirenvironments through stellar winds. Results from a study of the Orion BN/KL region indicate that disruption of a massive young stellar system can lead to an explosive event producing a wide-angle outflow, different from the classical bipolar flows driven by young stellar object (YSO) accretion disks. The discovery of a massive YSO, IRAS 05506+2414, may prove to be the second instance of this uncommon outflow. Prior to this study, data was collected using the Arizona Radio Observatory's 10-meter and 12-meter telescopes. Spectra of 16 different molecular line transitions were organized, reduced, and prepared for further analysis. A variety of molecular transitions were observed, such as 12CO 2-1, HCO+ 3-2, CS 3-2, in order to probe physical conditions of the YSO. From line transitions like HCO+ 3-2, we will determine physical properties like density, temperature, and velocity of our source object. For each molecular transition, the spectra were averaged in subsets, which were then averaged to produce a final spectra with an optimal signal to noise ratio. Future radiative modeling will yield mass and energetics of IRAS05506+2414.

millimeter-wave↗
DOE OSTI2024

Error mitigation, optimization, and extrapolation on a trapped-ion testbed

Current noisy intermediate-scale quantum (NISQ) trapped-ion devices are subject to errors which can significantly impact the accuracy of calculations if left unchecked. A form of error mitigation called zero noise extrapolation (ZNE) can decrease an algorithm’s sensitivity to these errors without increasing the number of required qubits. Here we explore different methods for integrating this error mitigation technique into the Variational Quantum Eigensolver (VQE) algorithm for calculating the ground state of the HeH + molecule at 0.8 Å in the presence of experimental noise. Using the Quantum Scientific Computing Open User Testbed (QSCOUT) trapped-ion device, we test three methods of scaling noise for extrapolation: time stretching the two-qubit gates, scaling the sideband detuning parameter, and inserting two-qubit gate identity operations into the ansatz circuit. We find that time stretching and sideband detuning scaling fail to scale the noise on our particular hardware in a way that can be extrapolated to zero noise. Scaling our noise with global gate identity insertions and extrapolating after variational optimization, we achieve error suppression of 96.8%, resulting in an energy estimate within –0.004 ± 0.04 hartree of the ground state energy. This is an improvement, but still outside the chemical accuracy threshold of 0.0016 hartree. Furthermore, our results show that the efficacy of this error mitigation technique depends on choosing the correct implementation for a given device architecture.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗