SEARCH · Search NASA

Results for “error codes”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

DOE OSTI2026

ARC physics basis–magnetohydrodynamics

ARC is designed to produce 400 ⁢MW of net electricity and prove the commercial feasibility of a fusion power plant. In order to achieve this goal ARC has to operate with optimal core performance in a stationary scenario that minimises wear on the first wall and divertor. This requires avoiding or mitigating magnetohydrodynamic (MHD) instabilities which have the potential to not only degrade the plasma core but also lead to deleterious transient heat loads on plasma facing components. Therefore, this work aims at characterising the MHD stability of the high performance ARC scenario and inform the design of error field correction coils. Firstly, simulations of vertical displacement events show that an in-vessel coil is not needed and instead the poloidal shaping coils can be used to control vertical stability. These simulations also inform the demands on the corresponding coil power supplies. Stability analysis of the ideal kink mode with or without a conducting wall and kinetic effects suggests that the ARC baseline scenario operates deeply in the stable region. Using RDCON, tearing modes at the 𝑚/𝑛 =2/1 and 3/2 surfaces (with poloidal mode number 𝑚, and toroidal mode number 𝑛) are shown to be linearly stable, and including thermal transport effects in the rational surfaces lead to further stabilisation. However, other transient plasma instabilities can seed neoclassical tearing modes (NTMs). The marginally stable width of NTMs in ARC strongly depends on the internal inductance and can fall below 0.1% of the normalised poloidal flux. Furthermore, an empirical cross-machine model of the 𝑛 =1 error field leading to a disruption predicts a critical error field larger than SPARC but smaller than ITER. Three-dimensional coils can be designed with the Generalised Purturbed Equilbium Code based on a simple model that calculates the maximum correctable error field that is limited by the neoclassical toroidal viscosity torque. Broad scans of different coil geometries identify a set of 2 rows of off-midplane coils to be a suitable solution. It is also determined that such a set of three-dimensional coils is capable of correcting 𝑛 =2 error fields to some degree and creating strong enough 𝑛 =2 or 𝑛 =3 edge resonant perturbation fields for the suppression of edge-localised modes at reasonable coil currents. The final design of the first ARC will be further informed by results from SPARC.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2025

CFDverify

Estimating the discretization error of computational fluid dynamics (CFD) or other scientific codes as part of solution verification is often a non-trivial part of the analysis process. Methods can be complicated and may include assumptions/qualifications that need to be checked during analysis. CFD analysts, therefore, are likely to make errors when trying to conduct this necessary analysis on their own in not knowing about the best method for their problem, not correctly implementing a method, or in not have diagnostic tools to determine if the method was correctly applied.

Weinmeister, Justin [Oak Ridge National Laboratory↗

DOE OSTI2026

ChatMPI: LLM-Driven MPI Code Generation for HPC Workloads

The Message Passing Interface (MPI) standard plays a crucial role in enabling scientific applications for parallel computing and is an essential component in high-performance computing (HPC). However, implementing MPI code manually—especially applying a proper domain decomposition and communication pattern—is a challenging and error-prone task. We present ChatMPI, an AI assistant for MPI parallelization of sequential C codes. In our analysis, we focus on testing six essential HPC workloads, which are based on Basic Linear Algebra Subprograms levels 1, 2, and 3 as well as sparse, stencil, and iterative operations. We analyze the process of creating ChatMPI by using the ChatHPC library. This lightweight large language model (LLM)–based infrastructure enables HPC experts to efficiently create and supervise trustworthy AI capabilities for critical HPC software tasks. We study the data required for training (fine-tuning) ChatMPI to generate parallel codes that not only use MPI syntax correctly but also apply HPC techniques to reduce memory communication and maximize performance by using proper work decomposition. With a relatively small training dataset composed of a few dozen prompts and fewer than 15 minutes of fine-tuning on one node equipped with two NVIDIA H100 GPUs, ChatMPI elevates trustworthiness for MPI code generation of current LLMs (e.g., Code Llama, ChatGPT-4o and ChatGPT 5). Additionally, we evaluate the performance of the MPI codes generated by ChatMPI in comparison with the ones generated by ChatGPT-4o and ChatGPT-5. The codes generated by ChatMPI provide up to a 4 × boost in performance by using better problem decomposition, communication patterns, and HPC techniques (e.g., communication avoiding).

Valero Lara, Pedro [ORNL] (ORCID:0000000214794310)↗

DOE OSTI2025

Demonstration of TOFFEE: A Response Uncertainty Quantification Tool

A key characteristic in neutron transport is nuclear data. Cross-section uncertainty is not used in MCNP6.3 to propagate response uncertainty without external analysis. Here, the TOol For Fast Error Estimation (TOFFEE) is a Python-based code developed to automate the propagation of cross-section uncertainty for MCNP evaluations. TOFFEE implements the sandwich rule to calculate the uncertainty from cross sections with sensitivity coefficients from MCNP6.3 and ENDF/B covariance data. In this paper, TOFFEE has been tested with benchmark experiments, and it has been compared to the uncertainty quantification capabilities of Sampler and TSUNAMI, within SCALE, to verify the application’s capabilities.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures

Quantum low-density parity-check codes are promising candidates towards scalable fault-tolerant quantum computation. Among these, bivariate bicycle (BB) codes offer superior encoding rates and large code distance compared to surface codes. However, their requirement on long-range stabilizer measurements poses significant challenges for implementation on realistic hardware with limited connectivity, such as superconducting circuit platforms. In this work, we introduce a novel hardware-software co-design that leverages a programmable communication network architecture to address these limitations. Our approach utilizes a 2D toric network of oscillators as a flexible communication fabric linking qubits at each site. Such architecture significantly reduces the number of long-range couplers required from O ( n ) to O (√ n ). Dual-rail qubits, along with native gates including Swap-Wait-Swap gates and beamsplitter SWAPs, ensure that long-range two-qubit gates can be executed with high fidelity and low latency. To further enhance performance, our qubit layout and routing algorithm utilize symmetries of the codes and enable maximum parallelism for long-range two-qubit gates, maintaining a low syndrome extraction cycle duration and scalability over the code length. We perform circuit-level simulation with realistic noise modeling based on experimental hardware parameters, observing an logical error rate per logical qubit per cycle of 3.06% for [[18,4,4]] BB code, 2.6× less than the existing experimental result. These findings provide a practical roadmap and identify key technological advancements needed to achieve low-overhead fault-tolerant quantum computing at scale.

Liu, Kun [Yale Univ., New Haven, CT (United States↗

DOE OSTI2024

Fault-tolerant connection of error-corrected qubits with noisy links

Abstract One of the most promising routes toward scalable quantum computing is a modular approach. We show that distinct surface code patches can be connected in a fault-tolerant manner even in the presence of substantial noise along their connecting interface. We quantify analytically and numerically the combined effect of errors across the interface and bulk. We show that the system can tolerate 14 times higher noise at the interface compared to the bulk, with only a small effect on the code’s threshold and subthreshold behavior, reaching threshold with ~1% bulk errors and ~10% interface errors. This implies that fault-tolerant scaling of error-corrected modular devices is within reach using existing technology.

Physics↗

DOE OSTI2026

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↗

DOE OSTI2025

A Cascaded Random Access Quantum Memory

Dynamic random access memory is critical to classical computing but notably absent in experimental quantum computers. Here we realize an 8-bit cascaded random access quantum memory using superconducting circuits and cavities and showcase the ability to perform arbitrary gate operations on it. In addition to individual error channels such as photon loss, quantum memories can also experience decoherence from many-body self-interaction. We characterize the origin and contributions of many-body infidelity throughout the memory cycle. We find that individual modes can be accessed with $\lesssim 1.5\%$ infidelity per mode and that the entire memory can be accessed in arbitrary order with an error rate below the depolarization threshold of the surface code, paving the way for fault-tolerant quantum memories.

Li, Ziqian [Stanford U., Appl. Phys. Dept.; Stanfo↗

DOE OSTI2024

Development of an Improved RELAP5-3D Model for the High Temperature Test Facility

High-temperature gas-cooled reactors (HTGRs) are rapidly approaching deployment. Confidence in transient analysis of these systems for design, optimization, and licensing calculations requires modeling and simulation tools that have been validated against data relevant to HTGR conditions. The High Temperature Test Facility (HTTF) is an integral effects thermal hydraulics test facility for prismatic HTGRs. In spring and summer of 2019, HTTF was used for a series of experiments that now serve as the basis for the OECD/NEA Thermal Hydraulic Code Validation Benchmark for High Temperature Gas-Cooled Reactors using HTTF Data (HTGR T/H Benchmark). This benchmark contains problems for systems code, computational fluid dynamics (CFD), and coupled systems code/CFD modeling representing lower plenum mixing and both the depressurized and pressurized conduction cooldown (DCC and PCC respectively) transients. Benchmark problems include exercises for code-to-code and code-to-data comparisons as well as an exercise for error scaling between HTTF and the Modular High Temperature Gas-Cooled Reactor, which serves as the basis for the HTTF design. Previous analysis as part of the HTGR T/H benchmark used a RELAP5-3D model developed at Idaho National Laboratory (INL) and demonstrated an ability to reproduce trends in the measured data but difficulties reproducing experimental values within their uncertainty. These difficulties were largely attributed to assumptions made during the development of the initial RELAP5-3D model, which predated the HTTF experiments. A significant cause of difficulty reproducing the measured temperatures may be the radial nodalization of the previous RELAP5-3D model. The new model provides a finer nodalization to assess the impact of radial nodalization and allows for asymmetric heating within the core, which was a feature of multiple HTTF experiments. In this paper, we present the new RELAP5-3D model of HTTF. In addition to describing the new model, this paper compares the new and old models and provides results for a full-power steady state, a DCC, and a PCC in HTTF. These analyses are based on the code-to-code comparison exercises for the DCC and PCC problems of the HTGR T/H benchmark. We present the results of these exercises from the new model and compare them to the results of the old model.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2025

Three-Receiver Quantum Broadcast Channels: Classical Communication with Quantum Non-unique Decoding

In network communication, it is common in broadcasting scenarios for there to exist a hierarchy among receivers based on information they decode due, for example, to different physical conditions or premium subscriptions. This hierarchy may result in varied information quality, such as higher-quality video for certain receivers. This is modeled mathematically as a degraded message set, indicating a hierarchy between messages to be decoded by different receivers, where the default quality corresponds to a common message intended for all receivers, a higher quality is represented by a message for a smaller subset of receivers, and so forth. We extend these considerations to quantum communication, exploring three-receiver quantum broadcast channels with two- and three-degraded message sets. Our technical tool involves employing quantum non-unique decoding, a technique we develop by utilizing the simultaneous pinching method. Here, we construct one-shot codes for various scenarios and find achievable rate regions relying on various quantum Rényi mutual information error exponents. Our investigation includes a comprehensive study of pinching across tensor product spaces, presenting our findings as the asymptotic counterpart to our one-shot codes. By employing the non-unique decoding, we also establish a simpler proof to Marton’s inner bound for two-receiver quantum broadcast channels without the need for more involved techniques. Additionally, we derive no-go results and demonstrate their tightness in special cases.

Salek, Farzin [Technical University of Munich (Ger↗

DOE OSTI2025

A 3D helical filament surrogate model for 3D tokamak equilibria

A novel approach for efficient representation of three-dimensional (3D) tokamak equilibria is investigated, where a set of helical current filaments occupying the plasma region are employed to resolve deviations from the two-dimensional (2D) axi-symmetric state. A discrete set of 3D filaments, located at rational surfaces for a given toroidal mode number n and following the 2D equilibrium field lines (thus forming closed current loops), are found to provide a surrogate model of 3D equilibria with reasonable accuracy. Specifically, application of the filament model to 3D perturbed equilibria, due to the resonant magnetic perturbation (RMP) in DIII-D and MAST-U discharges, reveals that (1) a single helical filament per rational surface is sufficient; (2) 21 such helical filaments are capable of representing the n = 2 3D response field in MAST-U with less than 10% relative error as compared to that computed by a full magnetohydrodynamic code; (3) optimizing currents (both amplitude and phase) flowing in 3D filaments with fixed geometry, the highest accuracy fitting is found to depend on the characteristics of the 3D equilibria such as the coil current phasing of the RMP coils in our case studies. Here, whis filament approach is also applicable for generating surrogate models of other type of 3D tokamak equilibria, including those during the initial phase of the plasma disruption.

MARS-F↗

DOE OSTI2024

Level 2 Milestone: Develop and Incorporate Novel Code Verification of Fundamental Equations in Gemma and Set Up Appropriate Tests

For computational physics simulations, code verification plays a major role in establishing the credibility of the results by assessing the correctness of the implementation of the underlying numerical methods. In computational electromagnetics, surface integral equations, such as the method-of-moments implementations of the electric-, magnetic-, and combinedfield integral equations, are frequently used to solve Maxwell’s equations on the surfaces of electromagnetic scatterers. These electromagnetic surface integral equations yield many code-verification challenges due to the various sources of numerical error and their possible interactions. In this report, we provide approaches to separately measure the numerical errors arising from these different error sources. We demonstrate the effectiveness of these approaches in Gemma.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2024

NEXUS Qubit Analysis: Jump Rates and Efciencies

Correlated qubit errors are a hinderance to quantum computing, but when using quantum chips as a particle detector, they can be a sign of energy deposits. Using a four transmon qubit chip in the NEXUS fridge at Fermilab, we have taken data to better understand the impact ionizing radiation has on the correlated errors. To analyze this data, we need a jump detection code that is robustly tested with understood efficiencies. In this work, we describe the process of getting these efficiencies using a rolling $\chi^2$ jump detection code.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2024

Optimization of the artificial viscosity in Lagrangian staggered discretization codes. Modeling 1D stand-alone shock - case study

We have developed new measures of errors for numerical shock. The new approach is based on analysis of the structure function, and separation of the errors related to oscillations and shock width, which also include error in the position of the ”center” of the numerical shock. We have demonstrated that those measures correctly characterize the numerical solution. We introduced an objective function in, which both types of errors are weighted, and presented optimal values of the coefficients of the linear and quadratic viscosity for different weights and different Mach numbers.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Dark sink enhances the direct detection of freeze-in dark matter

We describe a simple dark sector structure which, if present, has implications for the direct detection of dark matter (DM); the dark sink. A dark sink transports energy density from the DM into light dark-sector states that do not appreciably contribute to the DM density. As an example, we consider a light, neutral fermion ψ which interacts solely with DM Χ via the exchange of a heavy scalar Φ. We illustrate the impact of a dark sink by adding one to a DM freeze-in model in which Χ couples to a light dark photon γ' which kinetically mixes with the Standard Model (SM) photon. This freeze-in model (absent the sink) is itself a benchmark for ongoing experiments. In some cases, the literature for this benchmark has contained errors; we correct the predictions and provide them as a public code. We then analyze how the dark sink modifies this benchmark, solving coupled Boltzmann equations for the dark-sector energy density and DM yield. We check the contribution of the dark sink ψ’s to dark radiation; consistency with existing data limits the maximum attainable cross section. For DM with a mass between MeV –Ο⁡(10 GeV), adding the dark sink can increase predictions for the direct detection cross section all the way up to the current limits.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2025

CCSI Toolset 3.25 Release

CCSI Toolset 3.25 Release Highlights The copyright in the CCSI Toolset was updated to include the year 2025. The code and notes within it were revised to correct minor typographical errors and clarify meanings of variables. The configuration of the FOQUS documentation via Read the Docs was updated to explicitly set the path.

AS↗

DOE OSTI2025

Architecture for fast implementation of quantum low-density parity-check codes with optimized Rydberg gates

Here, we propose an implementation of bivariate bicycle codes [S. Bravyi et al., Nature (London) 627, 778 (2024)] based on long-range Rydberg gates between stationary neutral atom qubits. An optimized layout of data and ancilla qubits reduces the maximum Euclidean communication distance needed for nonlocal parity-check operators. An optimized Rydberg gate pulse design enables 𝖢𝖹 entangling operations with fidelity $\mathscr{F}$ >0.999 at a distance greater than 12 µ⁢m. The combination of optimized layout and gate design leads to a quantum error correction cycle time of ∼1.2⁢8 ms for a [[144,12,12]] code, which is nearly a factor-of-two improvement over previous designs.

Poole, C. [Univ. of Wisconsin, Madison, WI (United↗

DOE OSTI2024

(Doublon) Benchmarking of Different Inverse Point Kinetics Implementations for an Autocorrected Reactimeter Algorithm

In November 2017, the Transient Reactor Test Facility returned to operation. Since that time, many transient test series have been completed, such as the Transient Heatsink Overpower Response capsule (THOR), the Transient Water Irradiation System for TREAT (TWIST), and Sirius. Each has provided valuable data for materials performance and reactor safety that can be applied in future designs. During each experimental series, detector count rates provided important information on the core behavior during transients. However, a limitation of these data is that variations in the neutron distribution during experiments can cause errors when attempting to infer reactivity evolution from detector signals. Neutron physics codes can be used to compute the flux shape variations. However, this is a poor solution when the experimental data is used for code verification, validation and uncertainty quantification. Indeed, if the output of the code is used both as a reference and to correct what the reference is compared to, the circular dependency limits the quality of the verification, validation and uncertainty quantification approach. To overcome this problem, the autocorrected reactimeter algorithm (ACRA) has been developed. This approach infers a time-dependent reactivity evolution by testing different spatial corrections and selecting the one that minimizes reactivity variations when the core is in a frozen configuration (i.e., when there is no variation in parameters affecting reactivity). However, the scope of this method was limited to transients where there were negligible thermal feedback. Indeed, the core is never in a frozen configuration when the fuel temperature varies during the whole transient. This is our motivation for developing an improved version of the ACRA that does not require frozen configurations. To develop this new algorithm, we need a precise and unbiased implementation of the inverse point kinetic equations (IPKEs) as any error in the reactivity evaluation will be propagated into the choice of the optimal spatial correction. Indeed, the previous reactimeter algorithm would use approximations, such as a negligible flux amplitude derivative, to focus on rapidity. For the numerical validation of ACRA, we aim at absolute error under for reactivity derived from signals similar to the one of this study. In this summary, we test eight different IPKE implementations. Each will process a mockup signal built for this study, similar to those that the future ACRA will process. Each reactivity output will be compared to the reference reactivity that has been used to generate the mockup signal. The implementation minimizing the difference with the reference reactivity will be used in the development of a new ACRA formulation.

73 - NUCLEAR PHYSICS AND RADIATION PHYSICS↗