Search NASA⌕ Search

SEARCH · Search NASA

Results for “errors”

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 343 records · Page 19

Investigating lab-scaled offshore wind aerodynamic testing failure and developing solutions for early anomaly detections

As offshore wind systems become more complex, the risk of human error or equipment malfunction increases during experimental testing. This study investigates a lab-scale incident involving a 1 : 50 scale 5 MW wind turbine, where a generator failure led to rotor overspeed and a blade–tower strike. To improve early fault detection, we propose a data-driven method based on multivariate long short-term memory (LSTM) models. High-frequency measurements are projected onto principal components, and anomalies are identified using reconstruction error and its time derivative. Two models are trained on different healthy datasets and tested using single- and multi-principal component (1PC and MPC) variations. Results show that combining both error and error derivative improves detection accuracy. The 1PC model detects faults faster, has a higher recall rate, and achieves a 43 % improvement in anomaly detection accuracy, while the MPC model yields higher precision. This approach provides a simple and effective tool for early anomaly detection in lab-scale experiments, helping to reduce the risk of future failures during the testing of new technologies.

17 WIND ENERGY↗

NLR HPC Eagle GPU Node Metrics

Ganglia node metrics and iLO (Integrated Lights Out) power data captured from six representative Eagle GPU nodes The Eagle HPC operated at NLR from 2019 through 2024. Eagle was a 2,000-node, 8-petaflop system. This dataset is a representative sample of metrics for 6 of the GPU nodes. Each GPU node contained 2 CPUs and 2 GPUs. Data provided in compressed CSV format. Ganglia and iLO Power Time Series Fields ts: Timestamp dv: Device / Node - Rack and Unit - r103u17 == r(ack)103u(nit)17 mt: Metric (only present for Ganglia) vl: Value - Value in watts for iLO power (instantaneous value at sampling time) or specified Ganglia metric below Ganglia Metrics Metric name -- Metric description -- Unit cpu_aidle -- Percent of time since boot idle CPU -- Percent cpu_idle -- Percent CPU idle -- Percent cpu_nice -- Percent CPU nice -- Percent cpu_speed -- Speed in MHz of CPU -- MHz cpu_user -- Percent CPU user -- Percent cpu_wio -- The percentage of CPU Wait I/O -- Percent gpu0_bar1_memory -- Used GPU bar1 memory -- MB gpu0_decoder_util -- GPU decoder utilization -- Percent gpu0_ecc_db_error -- Total ECC error counts for the GPU -- Number gpu0_encoder_util -- GPU encoder utilization -- Percent gpu0_fan -- Fan speed -- RPM gpu0_fb_memory -- Used GPU framebuffer memory -- MB gpu0_graphics_clock_report -- Current clock speeds for the device -- MHz gpu0_mem_total -- Memory total -- MB gpu0_mem_util -- Memory utilization -- Percent gpu0_power_usage_report -- Power usage report -- Watts gpu0_temp -- GPU 1 temperature -- Celsius gpu1_bar1_memory -- Used GPU bar1 memory -- MB gpu1_decoder_util -- GPU decoder utilization -- Percent gpu1_ecc_db_error -- Total ECC error counts for the GPU -- Number gpu1_encoder_util -- GPU encoder utilization -- Percent gpu1_fan -- Fan speed -- RPM gpu1_fb_memory -- Used GPU framebuffer memory -- MB gpu1_graphics_clock_report -- Current clock speeds for the GPU -- MHz gpu1_mem_total -- Memory total -- MB gpu1_mem_util -- Memory utilization -- MB gpu1_power_usage_report -- Power usage report -- Watts gpu1_temp -- GPU 1 temperature -- Celsius ipmi_cpu1_temp -- CPU 1 temperature -- Celsius ipmi_cpu2_temp -- CPU 2 temperature -- Celsius ipmi_inlet_ambient_temp -- Temperature measured at intake -- Celsius ipmi_vr_p1_temp -- CPU 1 voltage regulator temperature -- Celsius ipmi_vr_p2_temp -- CPU 2 voltage regulator temperature -- Celsius mem_buffers -- Amount of buffered memory -- Bytes mem_cached -- Amount of cached memory -- Bytes mem_free -- Amount of available memory -- Bytes mem_shared -- Amount of shared memory -- Bytes mem_total -- Amount of available memory -- Bytes

97 MATHEMATICS AND COMPUTING↗

Physics-Based Machine Learning Methods for U-235 Forensics Signatures

Signatures of low-intensity U-235 sources have been recently studied by utilizing a variety of machine learning (ML) classifiers using features derived from gamma spectral measurements collectedunder structured campaigns. Several ML classifiers, such as ensemble of tress and classification trees, revealed misleadingly-optimistic training error due to over-fitting, and furthermore,their performance is not directly relatable to the physical properties due to their data-driven, opaque designs. We present a regression-based ML method that first estimates the inverse distanceto the source and then utilizes a threshold to infer its presence, by representing the background as a source located at an infinite distance. For the inverse distance estimation, we study the ensembleof trees and Gaussian process regression methods, and a hyper parameter auto-tuning and selection method that employs five regression estimators. These methods avoid the over-fittingobserved in several ML classifiers, while providing the classification error nearly comparable to them based on independent test data. Their error is directly related to estimates of the inversephysical distance to source, and the precision of error determines the seperability property that determines the false alarm and missed detection rates. The property of monotonic decrease of thesource strength with increasing detector distance combined with Poisson distribution of measurements is utilized to analytically validate these methods by deriving the generalization equations ofunderlying regression methods.

Rao, Nageswara↗

Physics-Based Machine Learning Methods for U-235 Forensics Signatures

Signatures of low-intensity U-235 sources have been recently studied by utilizing a variety of machine learning (ML) classifiers using features derived from gamma spectral measurements collected under structured campaigns. Several ML classifiers, such as ensemble of tress and classification trees, revealed misleadingly-optimistic training error due to over-fitting, and furthermore, their performance is not directly relatable to the physical properties due to their data-driven, opaque designs. We present a regression-based ML method that first estimates the inverse distance to the source and then utilizes a threshold to infer its presence, by representing the background as a source located at an infinite distance. For the inverse distance estimation, we study the ensemble of trees and Gaussian process regression methods, and a hyper parameter auto-tuning and selection method that employs five regression estimators. These methods avoid the over-fitting observed in several ML classifiers, while providing the classification error nearly comparable to them based on independent test data. Their error is directly related to estimates of the inverse physical distance to source, and the precision of error determines the seperability property that determines the false alarm and missed detection rates. The property of monotonic decrease of the source strength with increasing detector distance combined with Poisson distribution of measurements is utilized to analytically validate these methods by deriving the generalization equations of underlying regression methods.

Rao, Nageswara↗

Detailed Characterization of CZT Detector Response for Improved Coded-Aperture Imaging Performance

Gamma-ray imaging is a powerful method for locating and quantifying sources of radiation. The coded-aperture technique demonstrates superior angular resolution in comparison to other methods (e.g., Compton reconstruction). In this method, a mask constructed of highly attenuating material encodes the scene as a shadow pattern on a position-sensitive detector; this pattern can then be used to recreate the origin(s) of incident radiation. This is typically done through convolution of the mask and shadow patterns. Iterative methods which attempt to reconstruct the observed shadow pattern using a weighted combination of simulated patterns may also be employed. In either case, errors in event position reconstruction due to detector imperfections alter the shadow pattern and will therefore degrade system performance and may introduce imaging artifacts. These effects can be mitigated with a detailed understanding of such errors – allowing for the generation of representative simulations that include the errors and/or correction of raw imager data to remove the errors. We present a calibration process for a commercially available cadmium zinc telluride (CZT) gamma imager which provides a comprehensive characterization of the spatial and energy dependence of event reconstruction. By illuminating a mask featuring a regular grid of pinholes with a calibration source, the localized response of the detector can be measured with fine granularity. These local responses are combined to generate a full detector response map which can be used to distort simulations in a manner that is representative of the observed detector data. Details of the calibration procedure and an assessment of the impact of its end products on the performance of iterative imaging methods will be presented.

Ziock, Klaus-Peter↗

Enhancing Sterile Neutrino Oscillation Sensitivities using SBND-PRISM at the Short-Baseline Neutrino Programme

The Short-Baseline Neutrino (SBN) Programme at Fermilab is comprised of two detectors, SBND and ICARUS, placed at $110$\,m and $600$\,m along the Booster Neutrino Beam at Fermilab. The key physics aim of the programme is to definitively test the sterile neutrino hypothesis, a proposed fourth flavour of neutrino that may explain certain experimental anomalies seen regarding standard model neutrino oscillations. To be able to detect the existence of sterile neutrinos, the uncertainties of the programme must be well constrained. To enable this, a robust analysis must be constructed that can consistently identify the correct values of systematic parameters and generate accurate predictions of what the neutrino energy spectrum at ICARUS should look like. SBND's design allows for the introduction of a technique called PRISM. In PRISM, the detector is divided into regions of different off axis angles from the beam, forming different samples where systematics impact each one in a distinct way. This allows any fits performed to obtain a better understanding of the correct value of the systematic parameters. The first analysis included in this thesis focuses on the improvements seen to the sensitivity of SBN to sterile oscillation parameters when using a PRISM configuration instead of treating SBND as a single whole. Focusing on the $5\sigma$ exclusion contour from the $\numu$ disappearance channel using three PRISM samples, an improvement on the order of $30$\,\% is seen, extending the parameter space for which the null hypothesis can be excluded. This thesis also presents a series of mock data studies comparing the abilities of SBND and PRISM analyses, concluding that in the case of simple changes between Monte Carlo (MC) and data, PRISM produces predictions of the ICARUS event rate spectrum that are more accurate and have smaller uncertainties. When moving to more realistic mock data, using different models to create the mock data than were used for the MC, the postfit predictions at ICARUS had a smaller difference between the postfit and mock data reconstructed energy spectra across all mock data samples tested. Finally, a covariance matrix defined by the maximum discrepancy between the postfit and mock data spectra at ICARUS from each of the SBND and PRISM fits across all the samples was constructed. The resultant $1\sigma$ fractional error induced by this bias systematic on the postfit spectrum has a smaller magnitude for PRISM than SBND, with the improvements ranging from $2.21$\,\% to $6.26$\,\% depending on the mock data samples. This summarises the reduction in systematic error when using PRISM instead of treating SBND as a single detector. *************************************** AUTHOR = Slater, Bethany University of Liverpool b.slater2@liverpool.ac.uk TITLE = Enhancing Sterile Neutrino Oscillation Sensitivities using SBND-PRISM at the Short-Baseline Neutrino Programme PAGES = 218 NOTE = Ph.D. University of Liverpool March 2026 ABSTRACT = The Short-Baseline Neutrino (SBN) Programme at Fermilab is comprised of two detectors, SBND and ICARUS, placed at $110$\,m and $600$\,m along the Booster Neutrino Beam at Fermilab. The key physics aim of the programme is to definitively test the sterile neutrino hypothesis, a proposed fourth flavour of neutrino that may explain certain experimental anomalies seen regarding standard model neutrino oscillations. To be able to detect the existence of sterile neutrinos, the uncertainties of the programme must be well constrained. To enable this, a robust analysis must be constructed that can consistently identify the correct values of systematic parameters and generate accurate predictions of what the neutrino energy spectrum at ICARUS should look like. SBND's design allows for the introduction of a technique called PRISM. In PRISM, the detector is divided into regions of different off axis angles from the beam, forming different samples where systematics impact each one in a distinct way. This allows any fits performed to obtain a better understanding of the correct value of the systematic parameters. The first analysis included in this thesis focuses on the improvements seen to the sensitivity of SBN to sterile oscillation parameters when using a PRISM configuration instead of treating SBND as a single whole. Focusing on the $5\sigma$ exclusion contour from the $\numu$ disappearance channel using three PRISM samples, an improvement on the order of $30$\,\% is seen, extending the parameter space for which the null hypothesis can be excluded. This thesis also presents a series of mock data studies comparing the abilities of SBND and PRISM analyses, concluding that in the case of simple changes between Monte Carlo (MC) and data, PRISM produces predictions of the ICARUS event rate spectrum that are more accurate and have smaller uncertainties. When moving to more realistic mock data, using different models to create the mock data than were used for the MC, the postfit predictions at ICARUS had a smaller difference between the postfit and mock data reconstructed energy spectra across all mock data samples tested. Finally, a covariance matrix defined by the maximum discrepancy between the postfit and mock data spectra at ICARUS from each of the SBND and PRISM fits across all the samples was constructed. The resultant $1\sigma$ fractional error induced by this bias systematic on the postfit spectrum has a smaller magnitude for PRISM than SBND, with the improvements ranging from $2.21$\,\% to $6.26$\,\% depending on the mock data samples. This summarises the reduction in systematic error when using PRISM instead of treating SBND as a single detector.

Slater, Bethany [Liverpool U.]↗

Enhancing Sterile Neutrino Oscillation Sensitivities using SBND-PRISM at the Short-Baseline Neutrino Programme

The Short-Baseline Neutrino (SBN) Programme at Fermilab is comprised of two detectors, SBND and ICARUS, placed at $110$\,m and $600$\,m along the Booster Neutrino Beam at Fermilab. The key physics aim of the programme is to definitively test the sterile neutrino hypothesis, a proposed fourth flavour of neutrino that may explain certain experimental anomalies seen regarding standard model neutrino oscillations. To be able to detect the existence of sterile neutrinos, the uncertainties of the programme must be well constrained. To enable this, a robust analysis must be constructed that can consistently identify the correct values of systematic parameters and generate accurate predictions of what the neutrino energy spectrum at ICARUS should look like. SBND's design allows for the introduction of a technique called PRISM. In PRISM, the detector is divided into regions of different off axis angles from the beam, forming different samples where systematics impact each one in a distinct way. This allows any fits performed to obtain a better understanding of the correct value of the systematic parameters. The first analysis included in this thesis focuses on the improvements seen to the sensitivity of SBN to sterile oscillation parameters when using a PRISM configuration instead of treating SBND as a single whole. Focusing on the $5\sigma$ exclusion contour from the $\numu$ disappearance channel using three PRISM samples, an improvement on the order of $30$\,\% is seen, extending the parameter space for which the null hypothesis can be excluded. This thesis also presents a series of mock data studies comparing the abilities of SBND and PRISM analyses, concluding that in the case of simple changes between Monte Carlo (MC) and data, PRISM produces predictions of the ICARUS event rate spectrum that are more accurate and have smaller uncertainties. When moving to more realistic mock data, using different models to create the mock data than were used for the MC, the postfit predictions at ICARUS had a smaller difference between the postfit and mock data reconstructed energy spectra across all mock data samples tested. Finally, a covariance matrix defined by the maximum discrepancy between the postfit and mock data spectra at ICARUS from each of the SBND and PRISM fits across all the samples was constructed. The resultant $1\sigma$ fractional error induced by this bias systematic on the postfit spectrum has a smaller magnitude for PRISM than SBND, with the improvements ranging from $2.21$\,\% to $6.26$\,\% depending on the mock data samples. This summarises the reduction in systematic error when using PRISM instead of treating SBND as a single detector. *************************************** AUTHOR = Slater, Bethany University of Liverpool b.slater2@liverpool.ac.uk TITLE = Enhancing Sterile Neutrino Oscillation Sensitivities using SBND-PRISM at the Short-Baseline Neutrino Programme PAGES = 218 NOTE = Ph.D. University of Liverpool March 2026 ABSTRACT = The Short-Baseline Neutrino (SBN) Programme at Fermilab is comprised of two detectors, SBND and ICARUS, placed at $110$\,m and $600$\,m along the Booster Neutrino Beam at Fermilab. The key physics aim of the programme is to definitively test the sterile neutrino hypothesis, a proposed fourth flavour of neutrino that may explain certain experimental anomalies seen regarding standard model neutrino oscillations. To be able to detect the existence of sterile neutrinos, the uncertainties of the programme must be well constrained. To enable this, a robust analysis must be constructed that can consistently identify the correct values of systematic parameters and generate accurate predictions of what the neutrino energy spectrum at ICARUS should look like. SBND's design allows for the introduction of a technique called PRISM. In PRISM, the detector is divided into regions of different off axis angles from the beam, forming different samples where systematics impact each one in a distinct way. This allows any fits performed to obtain a better understanding of the correct value of the systematic parameters. The first analysis included in this thesis focuses on the improvements seen to the sensitivity of SBN to sterile oscillation parameters when using a PRISM configuration instead of treating SBND as a single whole. Focusing on the $5\sigma$ exclusion contour from the $\numu$ disappearance channel using three PRISM samples, an improvement on the order of $30$\,\% is seen, extending the parameter space for which the null hypothesis can be excluded. This thesis also presents a series of mock data studies comparing the abilities of SBND and PRISM analyses, concluding that in the case of simple changes between Monte Carlo (MC) and data, PRISM produces predictions of the ICARUS event rate spectrum that are more accurate and have smaller uncertainties. When moving to more realistic mock data, using different models to create the mock data than were used for the MC, the postfit predictions at ICARUS had a smaller difference between the postfit and mock data reconstructed energy spectra across all mock data samples tested. Finally, a covariance matrix defined by the maximum discrepancy between the postfit and mock data spectra at ICARUS from each of the SBND and PRISM fits across all the samples was constructed. The resultant $1\sigma$ fractional error induced by this bias systematic on the postfit spectrum has a smaller magnitude for PRISM than SBND, with the improvements ranging from $2.21$\,\% to $6.26$\,\% depending on the mock data samples. This summarises the reduction in systematic error when using PRISM instead of treating SBND as a single detector.

Slater, Bethany [Liverpool U.]↗

Enhancing Sterile Neutrino Oscillation Sensitivities using SBND-PRISM at the Short-Baseline Neutrino Programme

The Short-Baseline Neutrino (SBN) Programme at Fermilab is comprised of two detectors, SBND and ICARUS, placed at $110$\,m and $600$\,m along the Booster Neutrino Beam at Fermilab. The key physics aim of the programme is to definitively test the sterile neutrino hypothesis, a proposed fourth flavour of neutrino that may explain certain experimental anomalies seen regarding standard model neutrino oscillations. To be able to detect the existence of sterile neutrinos, the uncertainties of the programme must be well constrained. To enable this, a robust analysis must be constructed that can consistently identify the correct values of systematic parameters and generate accurate predictions of what the neutrino energy spectrum at ICARUS should look like. SBND's design allows for the introduction of a technique called PRISM. In PRISM, the detector is divided into regions of different off axis angles from the beam, forming different samples where systematics impact each one in a distinct way. This allows any fits performed to obtain a better understanding of the correct value of the systematic parameters. The first analysis included in this thesis focuses on the improvements seen to the sensitivity of SBN to sterile oscillation parameters when using a PRISM configuration instead of treating SBND as a single whole. Focusing on the $5\sigma$ exclusion contour from the $\numu$ disappearance channel using three PRISM samples, an improvement on the order of $30$\,\% is seen, extending the parameter space for which the null hypothesis can be excluded. This thesis also presents a series of mock data studies comparing the abilities of SBND and PRISM analyses, concluding that in the case of simple changes between Monte Carlo (MC) and data, PRISM produces predictions of the ICARUS event rate spectrum that are more accurate and have smaller uncertainties. When moving to more realistic mock data, using different models to create the mock data than were used for the MC, the postfit predictions at ICARUS had a smaller difference between the postfit and mock data reconstructed energy spectra across all mock data samples tested. Finally, a covariance matrix defined by the maximum discrepancy between the postfit and mock data spectra at ICARUS from each of the SBND and PRISM fits across all the samples was constructed. The resultant $1\sigma$ fractional error induced by this bias systematic on the postfit spectrum has a smaller magnitude for PRISM than SBND, with the improvements ranging from $2.21$\,\% to $6.26$\,\% depending on the mock data samples. This summarises the reduction in systematic error when using PRISM instead of treating SBND as a single detector. *************************************** AUTHOR = Slater, Bethany University of Liverpool b.slater2@liverpool.ac.uk TITLE = Enhancing Sterile Neutrino Oscillation Sensitivities using SBND-PRISM at the Short-Baseline Neutrino Programme PAGES = 218 NOTE = Ph.D. University of Liverpool March 2026 ABSTRACT = The Short-Baseline Neutrino (SBN) Programme at Fermilab is comprised of two detectors, SBND and ICARUS, placed at $110$\,m and $600$\,m along the Booster Neutrino Beam at Fermilab. The key physics aim of the programme is to definitively test the sterile neutrino hypothesis, a proposed fourth flavour of neutrino that may explain certain experimental anomalies seen regarding standard model neutrino oscillations. To be able to detect the existence of sterile neutrinos, the uncertainties of the programme must be well constrained. To enable this, a robust analysis must be constructed that can consistently identify the correct values of systematic parameters and generate accurate predictions of what the neutrino energy spectrum at ICARUS should look like. SBND's design allows for the introduction of a technique called PRISM. In PRISM, the detector is divided into regions of different off axis angles from the beam, forming different samples where systematics impact each one in a distinct way. This allows any fits performed to obtain a better understanding of the correct value of the systematic parameters. The first analysis included in this thesis focuses on the improvements seen to the sensitivity of SBN to sterile oscillation parameters when using a PRISM configuration instead of treating SBND as a single whole. Focusing on the $5\sigma$ exclusion contour from the $\numu$ disappearance channel using three PRISM samples, an improvement on the order of $30$\,\% is seen, extending the parameter space for which the null hypothesis can be excluded. This thesis also presents a series of mock data studies comparing the abilities of SBND and PRISM analyses, concluding that in the case of simple changes between Monte Carlo (MC) and data, PRISM produces predictions of the ICARUS event rate spectrum that are more accurate and have smaller uncertainties. When moving to more realistic mock data, using different models to create the mock data than were used for the MC, the postfit predictions at ICARUS had a smaller difference between the postfit and mock data reconstructed energy spectra across all mock data samples tested. Finally, a covariance matrix defined by the maximum discrepancy between the postfit and mock data spectra at ICARUS from each of the SBND and PRISM fits across all the samples was constructed. The resultant $1\sigma$ fractional error induced by this bias systematic on the postfit spectrum has a smaller magnitude for PRISM than SBND, with the improvements ranging from $2.21$\,\% to $6.26$\,\% depending on the mock data samples. This summarises the reduction in systematic error when using PRISM instead of treating SBND as a single detector.

Slater, Bethany [Liverpool U.]↗

LAF-Net: A Deep Residual and Cross-Attention Framework for Day-Ahead Load Forecasting: Preprint

Accurate day-ahead load forecasting is essential for reliable power system operations and market efficiency. System operators such as the Midcontinent Independent System Operator (MISO) rely on forecasts from multiple vendors, yet combining them effectively remains a persistent challenge due to vendor-specific biases. This paper presents a novel LSTM-Attention Fusion Network with Error Representation (LAF-Net) that enhances day-ahead hourly load forecasting through deep residual learning and multi-modal cross-attention. The proposed model builds a historical error memory from past vendor performance and dynamically queries it with future hour context to generate adaptive, hour-specific trust weights for each vendor. A bounded residual correction further refines forecasts by mitigating systematic and temporally localized errors. Tested on real MISO LBA data with multi-vendor forecasts, LAF-Net consistently outperforms the best vendor baseline across all 38 LBAs, achieving more than a 40% reduction in system-level mean absolute error (MAE) during peak load hours relative to the best vendor baseline.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Enhanced accuracy through ensembling of randomly initialized auto-regressive models for dynamical systems

Computational mechanics simulations using traditional finite element methods (FEM) require prohibitively expensive computational resources for real-time engineering applications, design optimization, and digital twin implementations. While machine learning (ML) surrogate models offer significant computational speedups, autoregressive ML models for time-dependent mechanical systems suffer from error accumulation that compromises long-term prediction reliability - a critical concern for engineering applications where accuracy over extended time horizons is essential for safety and performance assessments. Here, we propose a deep ensemble framework specifically designed to address this challenge in computational mechanics applications, where multiple ML surrogate models with random weight initializations are trained in parallel and their predictions aggregated during inference. This approach leverages statistical diversity to maximize information gain from a fixed set of training data and to mitigate error propagation, while maintaining the computational efficiency that makes ML surrogates attractive for engineering practice. We validate the framework on three representative problems spanning critical areas of computational mechanics: stress field evolution in heterogeneous microstructures under complex loading (relevant to advanced materials design and composite analysis), planetary-scale shallow water dynamics (applicable to environmental and geotechnical engineering), and Gray-Scott reaction-diffusion systems (relevant to mass transport and chemical process engineering). Across all test cases, the ensemble approach demonstrates consistent error reduction of 15-33% compared to individual models. The codes for this work are available on GitHub (https://github.com/Graham-Brady-Research-Group/AutoregressiveEnsemble_SpatioTemporal_Evolution).

autoregressive prediction↗

Characterization and thermometry of dissipatively stabilized steady states

In this work we study the properties of dissipatively stabilized steady states of noisy quantum algorithms, exploring the extent to which they can be well approximated as thermal distributions, and proposing methods to extract the effective temperature T. We study an algorithm called the relaxational quantum eigensolver (RQE), which is one of a family of algorithms that attempt to find ground states and balance error in noisy quantum devices. In RQE, we weakly couple a second register of auxiliary ‘shadow’ qubits to the primary system in Trotterized evolution, thus engineering an approximate zero-temperature bath by periodically resetting the auxiliary qubits during the algorithm’s runtime. Balancing the infinite temperature bath of random gate error, RQE returns states with an average energy equal to a constant fraction of the ground state. We probe the steady states of this algorithm for a range of base error rates, using several methods for estimating both T and deviations from thermal behavior. In particular, we both confirm that the steady states of these systems are often well-approximated by thermal distributions, and show that the same resources used for cooling can be adopted for thermometry, yielding a fairly reliable measure of the temperature. These methods could be readily implemented in near-term quantum hardware, and for stabilizing and probing Hamiltonians where simulating approximate thermal states is hard for classical computers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamical logical qubits in the Bacon-Shor code

The Bacon-Shor code is a quantum error correcting subsystem code composed of weight-2 check operators that admits a single logical qubit, and has distance 𝑑 on a 𝑑×𝑑 square lattice. We show that when viewed as a Floquet code, by choosing an appropriate measurement schedule of the check operators, it can additionally host several dynamical logical qubits. Specifically, we identify a period-4 measurement schedule of the check operators that preserves logical information between the instantaneous stabilizer groups. Such a schedule not only measures the usual stabilizers of the Bacon-Shor code, but also measures and promotes gauge operators of the parent subsystem code to additional temporary stabilizers that protect the dynamical logical qubits against errors. We show that the code distance of these Floquet-Bacon-Shor codes scales as Θ⁢(𝑑/√𝑘) on an 𝑛=𝑑×𝑑 lattice with 𝑘 dynamical logical qubits, along with the logical qubit of the parent subsystem code. Unlike the usual Bacon-Shor code, the Floquet-Bacon-Shor code family introduced here can therefore saturate the subsystem bound 𝑘⁢𝑑=𝑂⁡(𝑛). Moreover, several errors are shown to be self-corrected purely by the measurement schedule itself. This work provides insights into the design space for dynamical codes and expands the known approaches for constructing Floquet codes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improving precision and accuracy of genetic mapping with genotyping‐by‐sequencing data in outcrossing species

Abstract Genotyping‐by‐sequencing (GBS) is a widely used strategy for obtaining large numbers of genetic markers in model and non‐model organisms. In crop plants, GBS‐derived marker datasets are frequently used to perform quantitative trait locus (QTL) mapping. In some plant species, however, high heterozygosity and complex genome structure mean that researchers must use care in handling GBS data to conduct QTL mapping most effectively. Such outbred crops include most of the perennial grass and tree species used for bioenergy. To identify strategies for increasing accuracy and precision of QTL mapping using GBS data in outbred crops, we conducted an empirical study of SNP‐calling and genetic map‐building pipeline parameters in a Miscanthus sinensis population, and a complementary simulation study to estimate the relationship between genome‐wide error rate, read depth, and marker number. The bioenergy grass Miscanthus is an obligate outcrossing species with a recent (diploidized) whole‐genome duplication. For the study of empirical M. sinensis data, we compared two SNP‐calling methods (one non‐reference‐based and one reference‐based), a series of depth filters (12×, 20×, 30×, and 40×) and two map‐construction methods (i.e., marker ordering: linkage‐only and order‐corrected based on a reference genome). We found that correcting the order of markers on a linkage map by using a high‐quality reference genome improved QTL precision (shorter confidence intervals). For typical GBS datasets of between 1000 and 5000 markers to build a genetic map for biparental populations, a depth filter set at 30× to 40× applied to outbred populations provided a genome‐wide genotype‐calling error rate of less than 1%, improved accuracy of QTL point estimates and minimized type I errors for identifying QTL. Based on these results, we recommend using a reference genome to correct the marker order of genetic maps and a robust genotype depth filter to improve QTL mapping for outbred crops.

59 BASIC BIOLOGICAL SCIENCES↗

Quantum Information Encoding and Decoding for Quantum Sensi

This two-year theory project focused on theoretical investigations of novel paradigms for quantum sensing, building on information encoding and techniques from quantum error correction, quantum computing and other quantum information domains. The outcomes facilitate quantum information technology development, especially at the interface of quantum computing and quantum sensing. The results of the project show new use cases and new paradigms for quantum sensing beyond what has so far been considered. One outcome shows how quantum sensing opens new opportunities for fundamental physics such as the capability of single graviton detection. Another outcome reveals a new application of NISQ quantum computers with error correction for metrology, building on recent advances in practical quantum error correction implementation. The third outcome of the project creates new paradigms of back-action-evading sensing inspired by collective quantum information encoding, which achieves quantum sensing beyond the quantum limit without the use of entanglement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Universal framework for simultaneous tomography of quantum states and SPAM noise

We present a general denoising algorithm for performing simultaneous tomography of quantum states and measurement noise. This algorithm allows us to fully characterize state preparation and measurement (SPAM) errors present in any quantum system. Our method is based on the analysis of the properties of the linear operator space induced by unitary operations. Given any quantum system with a noisy measurement apparatus, our method can output the quantum state and the noise matrix of the detector up to a single gauge degree of freedom. We show that this gauge freedom is unavoidable in the general case, but this degeneracy can be generally broken using prior knowledge on the state or noise properties, thus fixing the gauge for several types of state-noise combinations with no assumptions about noise strength. Such combinations include pure quantum states with arbitrarily correlated errors, and arbitrary states with block independent errors. This framework can further use available prior information about the setting to systematically reduce the number of observations and measurements required for state and noise detection. Our method effectively generalizes existing approaches to the problem, and includes as special cases common settings considered in the literature requiring an uncorrelated or invertible noise matrix, or specific probe states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Deep nonparametric estimation of operators between infinite dimensional spaces

Learning operators between infinitely dimensional spaces is an important learning task arising in machine learning, imaging science, mathematical modeling and simulations, etc. This paper studies the nonparametric estimation of Lipschitz operators using deep neural networks. Non-asymptotic upper bounds are derived for the generalization error of the empirical risk minimizer over a properly chosen network class. Under the assumption that the target operator exhibits a low dimensional structure, our error bounds decay as the training sample size increases, with an attractive fast rate depending on the intrinsic dimension in our estimation. Our assumptions cover most scenarios in real applications and our results give rise to fast rates by exploiting low dimensional structures of data in operator estimation. We also investigate the influence of network structures (e.g., network width, depth, and sparsity) on the generalization error of the neural network estimator and propose a general suggestion on the choice of network structures to maximize the learning efficiency quantitatively.

97 MATHEMATICS AND COMPUTING↗

Anderson acceleration with approximate calculations: Applications to scientific computing

Here we provide rigorous theoretical bounds for Anderson acceleration (AA) that allow for approximate calculations when applied to solve linear problems. We show that, when the approximate calculations satisfy the provided error bounds, the convergence of AA is maintained while the computational time could be reduced. We also provide computable heuristic quantities, guided by the theoretical error bounds, which can be used to automate the tuning of accuracy while performing approximate calculations. For linear problems, the use of heuristics to monitor the error introduced by approximate calculations, combined with the check on monotonicity of the residual, ensures the convergence of the numerical scheme within a prescribed residual tolerance. Motivated by the theoretical studies, we propose a reduced variant of AA, which consists in projecting the least-squares used to compute the Anderson mixing onto a subspace of reduced dimension. The dimensionality of this subspace adapts dynamically at each iteration as prescribed by the computable heuristic quantities. We numerically show and assess the performance of AA with approximate calculations on: (i) linear deterministic fixed-point iterations arising from the Richardson's scheme to solve linear systems with open-source benchmark matrices with various preconditioners and (ii) non-linear deterministic fixed-point iterations arising from non-linear time-dependent Boltzmann equations.

97 MATHEMATICS AND COMPUTING↗

Quantifying uncertainty in uranium concentration measurements via K-edge densitometry

This study quantifies the uncertainty in uranium concentration predictions of fluoride and chloride-based salts within a steel pipe using K-edge densitometry. Modeling and simulation was conducted with the Monte Carlo N-Particle Transport (MCNP) code. The quality of of this technique’s prediction in a pipe requires proper characterization of the pipe’s thickness, which is dependent on the source size and axial offset from the pipe centerline. The thickness was determined as either the center-line thickness seen by the X-ray source or an average value determined through random sampling. Generally, the predicted concentrations were slightly better at lower offset with the random sampling thickness and using the center-line thickness for the highest offsets. For a line-beam source and varying axial offsets, the relative error of concentration was within 1% of the true value but uncertainty increased by 2 orders of magnitude. Similarly, for no axial offset, the relative error was significantly less than 1% while no trend for uncertainty was found. However, at the largest possible offset for a given source size, the concentrations become erroneous and greater than the allowable 1% relative error. Furthermore, high offsets tended to increase the variance of the transmission spectra by 3 orders of magnitude.

Characterization and Analytical Technique↗