Search NASA⌕ Search

SEARCH · Search NASA

Results for “machine errors and corrections”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Flux-corrected transport techniques for multidimensional compressible magnetohydrodynamics

A prescription is given for conservatively integrating generalized hydromagnetic equations using flux-corrected transport (FCT) techniques. By placing the magnetic-field components at the interface locations of the finite-difference grid, the field is kept divergence-free to within machine roundoff error. The use of FCT techniques allows an integration scheme of high accuracy to be employed, while the numerical ripples associated with large dispersion errors are avoided. The method is particularly well suited for problems involving magnetohydrodynamic shocks and other discontinuities.

Devore, C. Richard↗
DOE OSTI2022

Noisy intermediate-scale quantum algorithms

A universal fault-tolerant quantum computer that can efficiently solve problems such as integer factorization and unstructured database search requires millions of qubits with low error rates and long coherence times. While the experimental advancement toward realizing such devices will potentially take decades of research, noisy intermediate-scale quantum (NISQ) computers already exist. These computers are composed of hundreds of noisy qubits, i.e., qubits that are not error corrected, and therefore perform imperfect operations within a limited coherence time. In the search for achieving quantum advantage with these devices, algorithms have been proposed for applications in various disciplines spanning physics, machine learning, quantum chemistry, and combinatorial optimization. The overarching goal of such algorithms is to leverage the limited available resources to perform classically challenging tasks. In this review, a thorough summary of NISQ computational paradigms and algorithms is provided. The key structure of these algorithms and their limitations and advantages are discussed. Finally, a comprehensive overview of various benchmarking and software tools useful for programming and testing NISQ devices is additionally provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1991

Permutation codes for the state assignment of fault tolerant sequential machines

A new fault-tolerant state assignment method is suggested for synchronous sequential machines. It is assumed that the inputs are fault free and that for no input it is possible to reach all or most of the states, whose number may be fairly large. Error correcting codes for the state assignment are generated by permutations of a chosen linear code. A state assignment algorithm is developed and its computational complexity is estimated. Examples are given.

Chen, M.↗
DOE OSTI2024

How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits

In the span of four decades, quantum computation has evolved from an intellectual curiosity to a potentially realizable technology. Today, small-scale demonstrations have become possible for quantum algorithmic primitives on hundreds of physical qubits and proof-of-principle error-correction on a single logical qubit. Nevertheless, despite significant progress and excitement, the path toward a full-stack scalable technology is largely unknown. There are significant outstanding quantum hardware, fabrication, software architecture, and algorithmic challenges that are either unresolved or overlooked. These issues could seriously undermine the arrival of utility-scale quantum computers for the foreseeable future. Here, we provide a comprehensive review of these scaling challenges. We show how the road to scaling could be paved by adopting existing semiconductor technology to build much higher-quality qubits, employing system engineering approaches, and performing distributed quantum computation within heterogeneous high-performance computing infrastructures. These opportunities for research and development could unlock certain promising applications, in particular, efficient quantum simulation/learning of quantum data generated by natural or engineered quantum systems. To estimate the true cost of such promises, we provide a detailed resource and sensitivity analysis for classically hard quantum chemistry calculations on surface-code error-corrected quantum computers given current, target, and desired hardware specifications based on superconducting qubits, accounting for a realistic distribution of errors. Furthermore, we argue that, to tackle industry-scale classical optimization and machine learning problems in a cost-effective manner, heterogeneous quantum-probabilistic computing with custom-designed accelerators should be considered as a complementary path toward scalability.

Mohseni, Masoud↗
DOE OSTI2021

The updated ITPA global H-mode confinement database: description and analysis

The multi-machine ITPA Global H-mode Confinement Database has been upgraded with new data from JET with the ITER-like wall and ASDEX Upgrade with the full tungsten wall. This paper describes the new database and presents results of regression analysis to estimate the global energy confinement scaling in H-mode plasmas using a standard power law. Various subsets of the database are considered, focusing on type of wall and divertor materials, confinement regime (all H-modes, ELMy H or ELM-free) and ITER-like constraints. Apart from ordinary least squares, two other, robust regression techniques are applied, which take into account uncertainty on all variables. Regression on data from individual devices shows that, generally, the confinement dependence on density and the power degradation are weakest in the fully metallic devices. Using the multi-machine scalings, predictions are made of the confinement time in a standard ELMy H-mode scenario in ITER. The uncertainty on the scaling parameters is discussed with a view to practically useful error bars on the parameters and predictions. One of the derived scalings for ELMy H-modes on an ITER-like subset is studied in particular and compared to the IPB98(y,2) confinement scaling in engineering and dimensionless form. Transformation of this new scaling from engineering variables to dimensionless quantities is shown to result in large error bars on the dimensionless scaling. Regression analysis in the space of dimensionless variables is therefore proposed as an alternative, yielding acceptable estimates for the dimensionless scaling. The new scaling, which is dimensionally correct within the uncertainties, suggests that some dependencies of confinement in the multi- machine database can be reconciled with parameter scans in individual devices. This includes vanishingly small dependence of confinement on line-averaged density and normalized plasma pressure (β), as well as a noticeable, positive dependence on effective atomic mass and plasma triangularity. Extrapolation of this scaling to ITER yields a somewhat lower confinement time compared to the IPB98(y, 2) prediction, possibly related to the considerably weaker dependence on major radius in the new scaling (slightly above linear). Further studies are needed to compare more flexible regression models with the power law used here. In addition, data from more devices concerning possible ‘hidden variables’ could help to determine their influence on confinement, while adding data in sparsely populated areas of the parameter space may contribute to further disentangling some of the global confinement dependencies in tokamak plasmas.

Database↗
DOE OSTI2020

Machine Learning-Based Upscaling of Finite-Size Molecular Dynamics Diffusion Simulations for Binary Fluids

Molecular diffusion coefficients calculated using molecular dynamics (MD) simulations suffer from finite-size (i.e., finite box size and finite particle number) effects. Results from finite-sized MD simulations can be upscaled to infinite simulation size by applying a correction factor. For self-diffusion of single-component fluids, this correction has been well-studied by many researchers including Yeh and Hummer (YH); for binary fluid mixtures, a modified YH correction was recently proposed for correcting MD-predicted Maxwell–Stephan (MS) diffusion rates. In this study we use both empirical and machine learning methods to identify improvements to the finite-size correction factors for both self-diffusion and MS diffusion of binary Lennard-Jones (LJ) fluid mixtures. Using artificial neural networks (ANNs), the error in the corrected LJ fluid diffusion is reduced by an order of magnitude versus existing YH corrections, and the ANN models perform well for mixtures with large dissimilarities in size and interaction energies where the YH correction proves insufficient.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2021

A Machine Learning Approach to Objective Identification of Dust in Satellite Imagery

Airborne dust has broad adverse effects on human activity, including aviation, human health, and agriculture. Remote sensing observations are used to detect dust and aerosols in the atmosphere using long established techniques. False color Red-Green-Blue (RGB) imagery using band differences sensitive to dust absorption (Dust RGB) is currently used operationally to assist forecasters and decision-makers in identifying dust at night, but there are still limitations, subjectivity, and nuances to image interpretation making night-time dust identification difficult even for experts. This study applies machine learning to the problem of night-time dust detection with a simple random forest (RF) model using Geostationary Operational Environmental Satellite-16 (GOES-16) Advanced Baseline Imager (ABI) infrared imagery, band differences sensitive to dust absorption, and Dust RGB color components as inputs to the model. The RF model achieves an Area-Under-Curve (AUC) of 0.97 with a standard deviation of 0.04 for dust cases. For images with dust present, the model correctly labels 85% of dust pixels and 99.96% of no-dust pixels for all dust images in the validation data set. The addition of a single null case to the training data set drastically reduces error in labeling no-dust pixels as dust from 45% to 14.5%. Application of the machine learning model to the April 13–14, 2019 dust event demonstrates the ability of the model to identify dust during night-time hours when visual dust detection is limited by the cooling ground surface characteristics.

dust↗
DOE OSTI2025

Model Form Error Correction for a Black-Box Thermal Battery Heat Transfer Simulation

Thermal batteries are crucial for supplying power to high-consequence engineering applications such as rockets. Computational simulations have been developed to predict thermal battery behavior, but these simulations often suffer from modeling errors, including model form uncertainty. Addressing this uncertainty can be achieved by quantifying either the model discrepancy in the output or the model form error (MFE) in the governing equation. MFE is particularly valuable as it can be better extrapolated beyond observed outputs, which is essential for predictions involving changes in external system loading, system configuration and geometry, or output quantities. This paper employs a state estimation approach to estimate MFE using experimental data and then utilizes machine learning (ML) to model its relationship with state variables. A nonintrusive technique is used to estimate MFE in a black-box thermal battery heat transfer simulation. The trained machine learning model for MFE is then applied to correct simulation predictions under extrapolated initial conditions and battery configurations. In conclusion, the methodology's performance is evaluated using additional experimental data, demonstrating its effectiveness in improving prediction accuracy.

Batteries↗
NASA NTRS1991

Determination of real machine-tool settings and minimization of real surface deviation by computerized inspection

A numerical method is developed for the minimization of deviations of real tooth surfaces from the theoretical ones. The deviations are caused by errors of manufacturing, errors of installment of machine-tool settings and distortion of surfaces by heat-treatment. The deviations are determined by coordinate measurements of gear tooth surfaces. The minimization of deviations is based on the proper correction of initially applied machine-tool settings. The contents of accomplished research project cover the following topics: (1) Descriptions of the principle of coordinate measurements of gear tooth surfaces; (2) Deviation of theoretical tooth surfaces (with examples of surfaces of hypoid gears and references for spiral bevel gears); (3) Determination of the reference point and the grid; (4) Determination of the deviations of real tooth surfaces at the points of the grid; and (5) Determination of required corrections of machine-tool settings for minimization of deviations. The procedure for minimization of deviations is based on numerical solution of an overdetermined system of n linear equations in m unknowns (m much less than n ), where n is the number of points of measurements and m is the number of parameters of applied machine-tool settings to be corrected. The developed approach is illustrated with numerical examples.

Litvin, Faydor L.↗
DOE OSTI2024

A Particle-in-Cell Method for Plasmas with a Generalized Momentum Formulation, Part II: Enforcing the Lorenz Gauge Condition

In a previous paper Christlieb et al. (A particle-in-cell method for plasmas with a generalized momentum formulation, part I: Model formulation, 2024), we developed a new particle-in-cell (PIC) method for the relativistic Vlasov–Maxwell system in which the electromagnetic fields and the equations of motion for the particles were cast in terms of scalar and vector potentials through a Hamiltonian formulation. This new method evolved the potentials under the Lorenz gauge using integral equation methods. New methods to construct spatial derivatives of the potentials that converge at the same rates as the fields were also presented. The new particle method was compared against standard explicit discretizations, including the well-known FDTD-PIC method, for a range of applications involving sheaths and particle beams. Here, this paper extends this new class of methods by focusing on the enforcement the Lorenz gauge condition in both exact and approximate forms using co-located meshes. A time-consistency property of the proposed field solver for the vector potential form of Maxwell’s equations is established, which is shown to preserve the equivalence between the semi-discrete Lorenz gauge condition and the analogous semi-discrete continuity equation. Using this property, we present three methods to enforce a semi-discrete gauge condition. The first method introduces an update for the continuity equation that is consistent with the discretization of the Lorenz gauge condition. Both the finite difference and spectral implementations satisfy this discrete gauge condition to machine precision. The second approach we propose enforces a semi-discrete continuity equation using the boundary integral solution to the field equations. The potential benefit of this approach is that it eliminates spatial derivatives that appear on the particle data, namely the current density, which is often calculated by linear combinations of low-order spline basis functions. This method is ideally suited to boundary integral equation methods that invert multi-dimensional operators without dimensional splitting techniques and will be the subject of future work. The third approach introduces a gauge correcting method that makes direct use of the gauge condition to modify the scalar potential and uses local maps for both the charge and current densities. This results in a gauge error, as the maps do not enforce the continuity equation. The vector potential coming from the current density is taken to be exact, and using the Lorenz gauge, we compute a correction to the scalar potential that makes the two potentials satisfy the gauge condition. This method also enforces the gauge condition to machine precision. We demonstrate two of the proposed methods in the context of periodic domains. Problems defined on bounded domains, including those with complex geometric features remain an ongoing effort. However, this work shows that it is possible to design computationally efficient methods that can effectively enforce the Lorenz gauge condition in a non-staggered PIC formulation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

DPM: A deep learning PDE augmentation method with application to large-eddy simulation

A framework is introduced that leverages known physics to reduce overfitting in machine learning for scientific applications. The partial differential equation (PDE) that expresses the physics is augmented with a neural network that uses available data to learn a description of the corresponding unknown or unrepresented physics. Training within this combined system corrects for missing, unknown, or erroneously represented physics, including discretization errors associated with the PDE's numerical solution. For optimization of the network within the PDE, an adjoint PDE is solved to provide high-dimensional gradients, and a stochastic adjoint method (SAM) further accelerates training. Additionally, the approach is demonstrated for large-eddy simulation (LES) of turbulence. High-fidelity direct numerical simulations (DNS) of decaying isotropic turbulence provide the training data used to learn sub-filter-scale closures for the filtered Navier–Stokes equations. Out-of-sample comparisons show that the deep learning PDE method outperforms widely-used models, even for filter sizes so large that they become qualitatively incorrect. It also significantly outperforms the same neural network when a priori trained based on simple data mismatch, not accounting for the full PDE. Measures of discretization errors, which are well-known to be consequential in LES, point to the importance of the unified training formulation's design, which without modification corrects for them. For comparable accuracy, simulation runtime is significantly reduced. A relaxation of the typical discrete enforcement of the divergence-free constraint in the solver is also successful, instead allowing the DPM to approximately enforce incompressibility physics. Since the training loss function is not restricted to correspond directly to the closure to be learned, training can incorporate diverse data, including experimental data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Residual-based error correction for neural operator accelerated infinite-dimensional Bayesian inverse problems

We explore using neural operators, or neural network representations of nonlinear maps between function spaces, to accelerate infinite-dimensional Bayesian inverse problems (BIPs) with models governed by nonlinear parametric partial differential equations (PDEs). Neural operators have gained significant attention in recent years for their ability to approximate the parameter-to-solution maps defined by PDEs using as training data solutions of PDEs at a limited number of parameter samples. The computational cost of BIPs can be drastically reduced if the large number of PDE solves required for posterior characterization are replaced with evaluations of trained neural operators. However, reducing error in the resulting BIP solutions via reducing the approximation error of the neural operators in training can be challenging and unreliable. We provide an a priori error bound result that implies certain BIPs can be ill-conditioned to the approximation error of neural operators, thus leading to inaccessible accuracy requirements in training. To reliably deploy neural operators in BIPs, we consider a strategy for enhancing the performance of neural operators: correcting the prediction of a trained neural operator by solving a linear variational problem based on the PDE residual. We show that a trained neural operator with error correction can achieve a quadratic reduction of its approximation error, all while retaining substantial computational speedups of posterior sampling when models are governed by highly nonlinear PDEs. The strategy is applied to two numerical examples of BIPs based on a nonlinear reaction–diffusion problem and deformation of hyperelastic materials. We demonstrate that posterior representations of the two BIPs produced using trained neural operators are greatly and consistently enhanced by error correction.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

Resilience Modeling in Complex Engineered Systems with Human-Machine Interactions

In recent times, there has been a growing interest in resilience-based design. Resilience-based design operates on the concept that failures and unexpected events will happen, and when they occur, complex engineered systems should be able to operate within acceptable bounds and recover reasonably. Humans can contribute to the resilience of a system by quickly detecting unforeseen events and taking corrective measures. To this effect, researchers have proposed guidelines and design approaches that can help promote human-system resilience. However, there is no early design stage tool to validate if a system is indeed resilient after applying these guidelines and design methods. In this research, we integrate the Human Error and Functional Failure Reasoning (HEFFR) framework into the fmdtools toolkit to enable designers to model the combined (machine, human, and joint) failures, including their propagation and dynamic effects, during early design stages. This integrated tool also allows designers to model the effects of performance shaping factors, team dynamics, and human-machine interactions in systems of systems. A demonstrative example of a remotely operated rover is explored to demonstrate how this approach can be applied to understand resilience in complex engineered systems with human interactions.

Lukman Irshad↗
NASA NTRS2026

Machine Learning for Predicting Team Functioning in HERA Missions

Team functioning is integral to success in future long term space exploration missions. Proactively detecting declines in team functioning can mitigate conflict and ensure mission success. This project developed a speech-based artificial intelligence (AI) system that unobtrusively predicts degradation in team functioning, including performance and cohesion, in the Human Exploration Research Analog (HERA) Campaigns 4 and 5. The AI system conducted automated analysis of the prosodic (tone of voice) and linguistic (language content) components of speech, modeling interpersonal dynamics at both the turn-taking and day-wide levels. We investigated team functioning via observing structured interactions (i.e., multi-mission space exploration vehicle-extra vehicular activity [MMSEV-EVA], team interaction battery [TIB]) and unstructured interactions before the MMSEV-EVA task. We developed machine learning models to predict team functioning (objective task accuracy, self reported team efficacy and self reported team cohesion) by analyzing OpenSmile acoustic features, linguistic descriptors extracted via the linguistic inquiry and word count (LIWC) dictionary, and semantic embeddings. In the TIB, static models using logistic regression and random forests were not able to predict task accuracy, but predicted team efficacy and cohesion during both the decision making and relational tasks to a moderate level (60-70%). Majority voting on the individual turns to predict day long team efficacy further increased accuracies (70-80%). Finally, long short-term memory (LSTM) models showed the best performance across all variables (80-91%), including task performance. In the MMSEV-EVA, static models achieved an accuracy of 60% with majority voting, which increased to 80% through the incorporation of mission day as a variable, accounting for the learning effect. A key finding across both tasks was the "team-dependent" nature of these interactions; models achieved much higher accuracy when trained on prior days of the same team's data rather than attempting to generalize across entirely different teams, with even 1-2 days of prior data per team achieving 5-15% improvement over team-independent models. In addition, the incorporation of pre-task data from the same team also improves model performance, e.g., incorporating data from the decision-making task of the TIB, which preceded the relational task, improved the prediction of team efficacy and cohesion during the latter. We compared model performance when trained on machine-generated data compared to data that had been further corrected by human annotators. Overall, models trained on human-corrected data exhibited a modest improvement in performance, particularly when acoustic features were used. We found no significant correlation between word error rate (WER) and model accuracy (r(55) = -0.08, p = 0.51), but model’s accuracy was significantly higher for medium/high quality transcription (0.74 (SD = 0.48)) compared to the low-quality group (0.64 (SD = 0.36)) (t(63)=2.82, p = 0.006). Based on these, several design recommendation emerge, that could inform Standards at NASA. Models predicting team functioning should incorporate at least one to two days of historical interaction data, include brief pre-task discussions, and explicitly model temporal learning effects, especially for longer operational tasks. Minimum quality standards for automated speech-processing pipelines are needed, given the performance gains observed with manually corrected acoustic data. Finally, systems should leverage both acoustic features and language embeddings in complementary ways, with modality choices and fusion strategies tailored to mission context, task demands, and data quality requirements.

Shrivatsa Mishra↗
DOE OSTI2022

Correcting for filter-based aerosol light absorption biases at the Atmospheric Radiation Measurement program's Southern Great Plains site using photoacoustic measurements and machine learning

Abstract. Measurement of light absorption of solar radiation by aerosols is vital for assessing direct aerosol radiative forcing, which affects local and global climate. Low-cost and easy-to-operate filter-based instruments, such as the Particle Soot Absorption Photometer (PSAP), that collect aerosols on a filter and measure light attenuation through the filter are widely used to infer aerosol light absorption. However, filter-based absorption measurements are subject to artifacts that are difficult to quantify. These artifacts are associated with the presence of the filter medium and the complex interactions between the filter fibers and accumulated aerosols. Various correction algorithms have been introduced to correct for the filter-based absorption coefficient measurements toward predicting the particle-phase absorption coefficient (Babs). However, the inability of these algorithms to incorporate into their formulations the complex matrix of influencing parameters such as particle asymmetry parameter, particle size, and particle penetration depth results in prediction of particle-phase absorption coefficients with relatively low accuracy. The analytical forms of corrections also suffer from a lack of universal applicability: different corrections are required for rural and urban sites across the world. In this study, we analyzed and compared 3 months of high-time-resolution ambient aerosol absorption data collected synchronously using a three-wavelength photoacoustic absorption spectrometer (PASS) and PSAP. Both instruments were operated on the same sampling inlet at the Department of Energy's Atmospheric Radiation Measurement program's Southern Great Plains (SGP) user facility in Oklahoma. We implemented the two most commonly used analytical correction algorithms, namely, Virkkula (2010) and the average of Virkkula (2010) and Ogren (2010)–Bond et al. (1999) as well as a random forest regression (RFR) machine learning algorithm to predict Babs values from the PSAP's filter-based measurements. The predicted Babs was compared against the reference Babs measured by the PASS. The RFR algorithm performed the best by yielding the lowest root mean square error of prediction. The algorithm was trained using input datasets from the PSAP (transmission and uncorrected absorption coefficient), a co-located nephelometer (scattering coefficients), and the Aerosol Chemical Speciation Monitor (mass concentration of non-refractory aerosol particles). A revised form of the Virkkula (2010) algorithm suitable for the SGP site has been proposed; however, its performance yields approximately 2-fold errors when compared to the RFR algorithm. To generalize the accuracy and applicability of our proposed RFR algorithm, we trained and tested it on a dataset of laboratory measurements of combustion aerosols. Input variables to the algorithm included the aerosol number size distribution from the Scanning Mobility Particle Sizer, absorption coefficients from the filter-based Tricolor Absorption Photometer, and scattering coefficients from a multiwavelength nephelometer. The RFR algorithm predicted Babs values within 5 % of the reference Babs measured by the multiwavelength PASS during the laboratory experiments. Thus, we show that machine learning approaches offer a promising path to correct for biases in long-term filter-based absorption datasets and accurately quantify their variability and trends needed for robust radiative forcing determination.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1985

Automatic oscillator frequency control system

A frequency control system makes an initial correction of the frequency of its own timing circuit after comparison against a frequency of known accuracy and then sequentially checks and corrects the frequencies of several voltage controlled local oscillator circuits. The timing circuit initiates the machine cycles of a central processing unit which applies a frequency index to an input register in a modulo-sum frequency divider stage and enables a multiplexer to clock an accumulator register in the divider stage with a cyclical signal derived from the oscillator circuit being checked. Upon expiration of the interval, the processing unit compares the remainder held as the contents of the accumulator against a stored zero error constant and applies an appropriate correction word to a correction stage to shift the frequency of the oscillator being checked. A signal from the accumulator register may be used to drive a phase plane ROM and, with periodic shifts in the applied frequency index, to provide frequency shift keying of the resultant output signal. Interposition of a phase adder between the accumulator register and phase plane ROM permits phase shift keying of the output signal by periodic variation in the value of a phase index applied to one input of the phase adder.

Smith, S. F.↗
DOE OSTI2024

Towards Precision Photometric Type ia Supernova Cosmology With Machine Learning

The revolutionary discovery of dark energy and accelerating cosmic expansion was made with just 42 type Ia supernovae (SNe Ia) in 1999. Since then, large synoptic surveys, e.g., Dark Energy Survey (DES), have observed thousands more SNe Ia and the upcoming Rubin Legacy Survey of Space and Time (LSST) and Roman Space Telescope promise to deliver millions in the next decade. This unprecedented data volume can produce the required precision to unambiguously test concordance cosmology which could represent a monumental shift in our understanding of dark energy and its role in cosmic history. However, extracting a pure SN Ia sample with accurate redshifts for such a large dataset will be a challenge. Specifically, spectroscopic classification will not be possible for the vast majority of discovered objects, and only ~25% will have spectroscopic redshifts. This thesis presents a series of observational and methodological studies designed to address the questions associated with this new era of photometric SN Ia cosmology. First, we present a machine learning method for photometric classification of SNe, Supernova Classification with a COnvolutional Neural Network (SCONE). Photometric classification enables SNe with no spectroscopic information to be confidently categorized, and is a critical component of current and future analysis pipelines. SCONE achieves >99% accuracy distinguishing simulated SNe Ia from non-Ia SNe, and has been integrated into DES, LSST, and Roman analysis pipelines. We also demonstrate the efficacy of SCONE on early-time photometric classification, which will be vital for optimal allocation of spectroscopic resources. We show that SCONE can distinguish between 6 SN types with 75% accuracy on the night of initial discovery, comparable to results in the literature for full-phase SNe. Next, we study current methods for estimating SN Ia redshifts and propose a machine learning alternative that uses SN photometry alone to extract redshift information. Most SNe Ia inherit redshift information from their host galaxy, but the process of matching SNe to the correct host galaxy can be challenging. We systematically analyze the impact of incorrect redshifts from host galaxy mismatch on 5 years of DES SN data, and conclude that improved host matching or redshift estimation methods can reduce our systematic errors by ~10%. In response to this finding, we present a SN photometry-only method for estimating redshifts independent of host galaxy information, Photo-zSNthesis. We show that Photo-zSNthesis redshift estimates are accurate to within 2% across the full redshift range of LSST, a first in the literature. Finally, we focus on the robustness of machine learning (ML) algorithms for real-world and scientific applications. ML models generalize poorly beyond their training set and often experience severe performance degradation when deployed on new data. We demonstrate a general method for improving robustness that achieves new state-of-the-art results on astronomical object classification, wildlife identification, and tumor detection.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Advancing Comprehension of Quantum Application Outputs: A Visualization Technique

Noise in quantum computers presents a challenge for the users of quantum computing despite the rapid progress we have seen in the past few years in building quantum computers. Existing works have addressed the noise in quantum computers using a variety of mitigation techniques since error correction requires a large number of qubits which is infeasible at present. One of the consequences of quantum computing noise is that users are unable to reproduce similar output from the same quantum computer at different times, let alone from various quantum computers. In this work, we have made initial attempts to visualize quantum basis states for all the circuits that were used in quantum machine learning from various quantum computers and noise-free quantum simulators. We have opened up a pathway for further research into this field where we will be able to isolate noisy states from non-noisy states leading to efficient error mitigation. This is where our work provides an important step in the direction of efficient error mitigation. Our work also provides a ground for quantum noise visualization in the case of large numbers of qubits.

Senapati, Priyabrata↗