Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer 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.

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

At least 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Author Correction: US oil and gas system emissions from nearly one million aerial site measurements

Correction to: Naturehttps://doi.org/10.1038/s41586-024-07117-5 Published online 13 March 2024 In the version of the article initially published, several errors were present and have been corrected in the HTML and PDF versions of the article and Supplementary Information. The main results, conclusions, and our interpretations of the data remain unchanged. See the new Supplementary Information Section S15 for a more detailed description of the errors corrected and the resulting effects on the analysis. Data processing and methods corrections Overflight count correction: We previously used pre-computed source coverage data for some Carbon Mapper campaigns that was computed differently than was required for our analysis. We have re-computed Carbon Mapper source coverage based on flightline polygons and source coordinates. Transition point computation, well sites: The updated version now correctly compares the cumulative emissions distribution of simulated well site emissions with that of aerially detected sources (rather than plumes) when computing the transition point. Transition point computation, midstream: Additionally, the transition point calculation has been corrected to exclude aerially detected midstream emissions below the transition point, which was previously leading to double counting of these emissions. This error was not present for upstream (well site) emissions. Calculation errors Unit error: We corrected a specific unit conversion error affecting well site emissions in the Kairos Fort Worth dataset. Across all datasets, we also correct the conversion factor for converting from standard volume to mass for midstream emissions. Sorting error: We correct code that was applying incorrect sorting when computing correction factors to account for partial detection at well sites. Small typographical corrections were made in Fig. 1b and SI Section S4.1. Data processing and methods corrections Overflight count correction: We previously used pre-computed source coverage data for some Carbon Mapper campaigns that was computed differently than was required for our analysis. We have re-computed Carbon Mapper source coverage based on flightline polygons and source coordinates. Transition point computation, well sites: The updated version now correctly compares the cumulative emissions distribution of simulated well site emissions with that of aerially detected sources (rather than plumes) when computing the transition point. Transition point computation, midstream: Additionally, the transition point calculation has been corrected to exclude aerially detected midstream emissions below the transition point, which was previously leading to double counting of these emissions. This error was not present for upstream (well site) emissions. Calculation errors Unit error: We corrected a specific unit conversion error affecting well site emissions in the Kairos Fort Worth dataset. Across all datasets, we also correct the conversion factor for converting from standard volume to mass for midstream emissions. Sorting error: We correct code that was applying incorrect sorting when computing correction factors to account for partial detection at well sites. Small typographical corrections were made in Fig. 1b and SI Section S4.1. The following practices may help researchers conducting similar analyses avoid making similar errors: 1, Clear, accessible documentation explaining the interpretation of all columns in data input tables and all internal variables within the model, 2, Simple cross-check calculations computed before and after unit conversions.

Sherwin, Evan D↗
DOE OSTI2025

Fully Homomorphic Encryption

This code implements a Fully Homomorphic Encryption (FHE) system, enabling secure computation on encrypted data without requiring decryption. It supports encryption, decryption, and homomorphic operations like matrix multiplication and addition. This code is adaptable for integrating FHE into linear-time invariant (LTI) systems, including digital control and filtering. With proper configuration from subject matter expertise, encrypted system parameters and signals can be manipulated to perform tasks like state updates, output calculations, and convolution in the encrypted domain. By preserving the structure of LTI systems while ensuring privacy, the framework facilitates secure applications in areas such as autonomous systems, signal processing, and industrial automation. The code initializes the encryption system using parameters provided in the env dictionary. These parameters include the ciphertext modulus, key dimension, plaintext fixed-point scaling factor, and noise bound. During initialization, a secret key is generated, which is essential for encrypting and decrypting data securely. The modular design allows users to tailor these parameters to specific use cases or security requirements. The code implements multiple cryptographic schemes. The learning with errors (LWE) encryption method encodes cleartext message to their plaintext fixed-point representation then encrypted into ciphertext space with additive noise. This noise ensures the security of the scheme, relying on the computational hardness of the LWE problem. The code also includes the Gentry-Sahai-Waters (GSW) scheme based off the LWE problem. Homomorphic matrix multiplication is performed between the LWE and GSW to encrypted data. This is achieved using a decomposition function on the LWE ciphertext during the multiplication operation. For higher-dimensional data, the code includes a method to encrypt entire matrices (GSWMat) using GSW encryption. These encrypted matrices can then be used for homomorphic matrix multiplications (MatMult). The decryption function uses the secret key to recover the original plaintext, removing the added noise and scaling that was originally applied during encryption.

Lois, Roberts [Idaho National Laboratory (INL), Id↗
DOE OSTI2025

CaliQEC: In-situ Qubit Calibration for Surface Code Quantum Error Correction

Quantum Error Correction (QEC) is essential for fault-tolerant, large-scale quantum computation. However, error drift in qubits undermines QEC performance during long computations, necessitating frequent calibration. Conventional calibration methods disrupt quantum states, requiring system downtime and rendering in situ calibration impractical. To address this challenge, we propose QECali, a novel framework that enables in situ calibration for surface codes. Our evaluation demonstrates that QECali introduces modest qubit overhead and negligible increases in execution time, offering the first practical solution for in situ calibration in surface code based quantum computation.

Fang, Xiang [University of California, Santa Barba↗
DOE OSTI2025

Logical error rates for the surface code under a mixed coherent and stochastic circuit-level noise model inspired by trapped ions

With fault-tolerant quantum computing (FTQC) on the horizon, it is critical to understand sources of logical errors in plausible hardware implementations of quantum error-correcting codes. Detailed error modeling of computational instructions on particular FTQC architectures will enable the better prediction of error propagation in FT-encoded quantum circuits while revealing where greater attention is needed in hardware design. In this work, we consider logical error rates for the surface code implemented on a hypothetical grid-based trapped-ion quantum charge-coupled device architecture. Specifically, we construct logical channels for the idling surface code and examine its diamond error under a mixed coherent and stochastic circuit-level noise model inspired by trapped ions. We include the coherent dephasing noise that is known to accumulate during physical qubit idling and transport in these systems, determining idling and transport durations using the time-resolved output of an open-source trapped-ion surface code compiler. To estimate expectation values of logical Pauli observables following hardware circuits containing non-Clifford sources of noise, we utilize a Monte Carlo technique to sample from an underlying quasiprobability distribution of Clifford circuits that we independently simulate in a phase-sensitive fashion. We verify error suppression up to code distance 𝑑 = 11 at coherent dephasing rates near and below those of current-generation trapped-ion quantum computers and find that logical error rates align with those of analogous fully stochastic simulations in this regime. Exploring higher dephasing rates at 𝑑 = 3−5, we find evidence for growing coherent rotations about all three logical Pauli axes, increased diagonal logical error process matrix elements relative to those of stochastic simulations, and a reduced dephasing rate threshold. Overall, our work paves a way toward realistic hardware emulation of small fault-tolerant quantum processes, e.g., members of an FTQC instruction set.

Quantum benchmarking↗
DOE OSTI2025

A Flang Plugin for Fortran Feature Characterization

As new compute systems are developed, there is still a need to compile and execute codes authored in Fortran on these leading edge systems. In order to achieve this, development of compilers that support the latest hardware is continuously under development. Though the specification of Fortran is extensive, it is helpful to compiler authors to be able to prioritize the development of key features in order to get certain codes deemed important, e.g., applications of interest to leadership computing facilities, executable on leading edge compute systems. Identifying key features though is largely done through querying software experts or users of the Fortran applications of interest, who then manually report what features are and are not present. This exercise can both time consuming and error prone. To automate this process, we present a compiler plugin to Flang, the Fortran frontend for LLVM. This plugin is a tool that operates on the parse tree representation generated by Flang and detects key features based on walking parse tree nodes that correspond to features of interest. We show the result of our tool on four applications, three of which were manually profiled by software experts. We show the discrepancies between our tool and the manual characterization of the three applications, as well as generate a characterization for an application not yet profiled. We intend to open-source our tool in order to invite the community to benefit from the tool and make contributions for other features.

Cabrera, Anthony [ORNL]↗
DOE OSTI2025

Self-consistent equilibrium and transport simulations for NSTX-U plasmas enhanced via machine learning surrogate models

The Control-Oriented Transport SIMulator (COTSIM) is an advanced equilibrium and transport code designed for simulating tokamak discharges at computational speeds suitable for control applications. COTSIM’s modular framework enables users to select models that balance accuracy with speed according to specific needs, allowing the code to operate from fast to faster-than-real-time performance levels. This work presents recent enhancements to COTSIM’s predictive accuracy for NSTX-U scenarios, achieved by integrating neural-network-based surrogate models and self-consistent equilibrium calculations. To improve source deposition predictions, a surrogate model for NUBEAM has been incorporated. Additionally, a surrogate model for the Multi-Mode Module (MMM) now supports predictions of anomalous thermal, momentum, and particle diffusivities—key factors for modeling the evolution of temperature and rotation. Each surrogate model was specifically trained for the NSTX-U operational regime to enhance COTSIM’s accuracy while maintaining computational efficiency. Moreover, COTSIM now couples fixed-boundary equilibrium solvers with its transport solvers, enabling self-consistent predictions of plasma profiles and equilibrium evolution over the discharge. Simulation results demonstrate strong agreement between COTSIM and TRANSP predictions for NSTX-U discharges. These substantial advancements expand COTSIM’s utility in model-based control applications for NSTX-U. Potential applications include simultaneous optimization of equilibrium and transport scenarios, integration into digital twins, real-time profile estimation (e.g., temperature and rotation) from limited or noisy measurements, and advanced feedback-based scenario control.

Equilibrium and transport modeling↗
DOE OSTI2025

Low-overhead transversal fault tolerance for universal quantum computation

Fast, reliable logical operations are essential for realizing useful quantum computers. By redundantly encoding logical qubits into many physical qubits and using syndrome measurements to detect and correct errors, we can achieve low logical error rates. However, for many practical quantum error correction codes such as the surface code, owing to syndrome measurement errors, standard constructions require multiple extraction rounds—of the order of the code distance d—for fault-tolerant computation, particularly considering fault-tolerant state preparation. Here we show that logical operations can be performed fault-tolerantly with only a constant number of extraction rounds for a broad class of quantum error correction codes, including the surface code with magic state inputs and feedforward, to achieve ‘transversal algorithmic fault tolerance’. Through the combination of transversal operations7 and new strategies for correlated decoding, despite only having access to partial syndrome information, we prove that the deviation from the ideal logical measurement distribution can be made exponentially small in the distance, even if the instantaneous quantum state cannot be made close to a logical codeword because of measurement errors. We supplement this proof with circuit-level simulations in a range of relevant settings, demonstrating the fault tolerance and competitive performance of our approach. Furthermore, our work sheds new light on the theory of quantum fault tolerance and has the potential to reduce the space–time cost of practical fault-tolerant quantum computation by over an order of magnitude.

Zhou, Hengyun [QuEra Computing, Boston, MA (United↗
DOE OSTI2025

Adopting Code Verification Methodology Based on Model Form

Code verification is an essential part of credibility analysis for computational models. It assesses whether the mathematical model is implemented correctly into the code and whether the numerical methods behave consistently, and is done before solution verification and validation. Robust guidance for code verification exists in the literature. However, there is no known, concise guide for selecting the approach based on the model form that also presents an overview of the common elements. This document was written to address this gap as an accessible reference for beginning a code-verification effort.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Adapting Code Verification Methodology to Model Form

Code verification is an essential part of credibility analysis for computational models. It assesses whether the mathematical model is implemented correctly into the code and whether the numerical methods behave consistently, and is done before solution verification and validation. Robust guidance for code verification exists in the literature. However, there is no known, concise guide for selecting the approach based on the model form that also presents an overview of the common elements. This document was written to address this gap as an accessible reference for beginning a code-verification effort.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Charged particle transport coefficient challenges in high energy density plasmas

High energy density physics (HEDP) and inertial confinement fusion (ICF) research typically relies on computational modeling using radiation-hydrodynamics codes in order to design experiments and understand their results. These tools, in turn, rely on numerous charged particle transport and relaxation coefficients to account for laser energy absorption, viscous dissipation, mass transport, thermal conduction, electrical conduction, non-local ion (including charged fusion product) transport, non-local electron transport, magnetohydrodynamics, multi-ion-species thermalization, and electron-ion equilibration. In many situations, these coefficients couple to other physics, such as imposed or self-generated magnetic fields. Furthermore, how these coefficients combine are sensitive to plasma conditions as well as how materials are distributed within a computational cell. Uncertainties in these coefficients and how they couple to other physics could explain many of the discrepancies between simulation predictions and experimental results that persist in even the most detailed calculations. This paper reviews the challenges faced by radiation-hydrodynamics in predicting the results of HEDP and ICF experiments with regard to these and other physics models typically included in simulation codes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Advancing quantum simulations of the nuclear shell model with Gray-code–based resource-efficient protocols

Background: Some of the computational limitations in solving the nuclear many-body problem could be overcome by utilizing quantum computers. The nuclear shell-model calculations providing deeper insights into the properties of atomic nuclei are one such case with high demand for resources, as the size of the Hilbert space grows exponentially with the number of particles involved. Quantum algorithms are being developed to overcome these challenges and advance such calculations. Purpose: To develop quantum circuits for the nuclear shell-model, leveraging the capabilities of noisy intermediate-scale quantum (NISQ) devices. Here, we aim to minimize resource requirements (specifically in terms of qubits and gates) and strive to reduce the impact of noise by employing relevant mitigation techniques. Methods: We achieve noise resilience by designing an optimized Ansatz for the variational quantum eigensolver (VQE) based on Givens rotations and incorporating qubit-ADAPT-VQE in combination with variational quantum deflation (VQD) to compute ground and excited states, incorporating the zero-noise extrapolation mitigation technique. Furthermore, the qubit requirements are significantly reduced by mapping the basis states to qubits using Gray-code encoding and generalizing transformations of fermionic operators to efficiently represent many-body states. Results: By employing the resource-efficient protocols, we achieve the ground and excited state energy levels of 38 Ar and 6 Li with better accuracy. These energy levels are presented for noiseless simulations, noisy conditions, and after applying noise mitigation techniques. Results are compared for Jordan-Wigner and Gray-code encoding using VQE, qubit-ADAPT-VQE, and VQD. Conclusions: Our work highlights the potential of resource-efficient protocols to leverage the full potential of NISQ devices in scaling the nuclear shell model calculations, offering a pathway toward more complex quantum simulations in nuclear physics. This approach establishes a framework for studying other nuclear systems with improved quantum resource efficiency, marking a significant advancement in applying quantum computing to realistic nuclear physics applications.

Physics - Nuclear physics and radiation physics↗
DOE OSTI2024

How numerical simulations helped to achieve breakeven on the NIF

The inertial confinement fusion program relies upon detailed simulations with inertial confinement fusion (ICF) codes to design targets and to interpret the experimental results. These simulations treat as much physics from essential principles as is practical, including laser deposition, cross beam energy transfer, x-ray production and transport, nonlocal thermal equilibrium kinetics, thermal transport, hydrodynamic instabilities, thermonuclear burn, and transport of reaction products. Improvements in radiation hydrodynamic code capabilities and vast increases in computing power have enabled more realistic, accurate 3D simulations that treat all known asymmetry sources. We describe how numerical simulations helped to guide the program, assess the impediments to breakeven, and optimize every aspect of target design. A preshot simulation of the first National Ignition Facility experiment that surpassed breakeven predicted an increased yield that matches the experimental result, within the preshot predicted uncertainty, with a target gain of 1.5. We will cover the key developments in Lawrence Livermore National Laboratory ICF codes that enabled these simulations and give specific examples of how they helped to guide the program.

Marinak, M. M. (ORCID:0009000331127696)↗
DOE OSTI2024

Fault-Tolerant Operation of Bosonic Qubits with Discrete-Variable Ancillae

Fault-tolerant quantum computation with bosonic qubits often necessitates the use of noisy discrete-variable ancillae. In this work, we establish a comprehensive and practical fault-tolerance framework for such a hybrid system and synthesize it with fault-tolerant protocols by combining bosonic quantum error correction (QEC) and advanced quantum control techniques. We introduce essential building blocks of error-corrected gadgets by leveraging ancilla-assisted bosonic operations using a generalized variant of path-independent quantum control. Using these building blocks, we construct a universal set of error-corrected gadgets that tolerate a single-photon loss and an arbitrary ancilla fault for four-legged cat qubits. Notably, our construction requires only dispersive coupling between bosonic modes and ancillae, as well as beam-splitter coupling between bosonic modes, both of which have been experimentally demonstrated with strong strengths and high accuracy. Moreover, each error-corrected bosonic qubit is comprised of only a single bosonic mode and a three-level ancilla, featuring the hardware efficiency of bosonic QEC in the full fault-tolerant setting. We numerically demonstrate the feasibility of our schemes using current experimental parameters in the circuit-QED platform. Finally, we present a hardware-efficient architecture for fault-tolerant quantum computing by concatenating the four-legged cat qubits with an outer qubit code utilizing only beam-splitter couplings. Our estimates suggest that the overall noise threshold can be reached using existing hardware. These developed fault-tolerant schemes extend beyond their applicability to four-legged cat qubits and can be adapted for other rotation-symmetrical codes, offering a promising avenue toward scalable and robust quantum computation with bosonic qubits. Published by the American Physical Society 2024

Physics↗
DOE OSTI2024

Accelerated Constrained Sparse Tensor Factorization on Massively Parallel Architectures

This study presents the first constrained sparse tensor factorization (cSTF) framework that optimizes and fully offloads computation to massively parallel GPU architectures, and the first performance characterization of cSTF on GPU architectures. In contrast to prior work on tensor factorization, where the matricized tensor times Khatri-Rao product (MTTKRP) is the primary performance bottleneck, our systematic analysis of the cSTF algorithm on GPUs reveals that adding constraints creates an additional bottleneck in the update operation for many real-world sparse tensors. While executing the update operation on the GPU brings significant speedup over its CPU counterpart, it remains a significant bottleneck. To further accelerate the update operation, we propose cuADMM, a new update algorithm that leverages algorithmic and code optimization strategies to minimize both computation and data movement on GPUs. As a result, our framework delivers significantly improved performance compared to prior state-of-the-art. On 10 real-world sparse tensors, our framework achieves geometric mean speedup of 5.1 × (max 41.59 ×) and 7.01 × (max 58.05 ×) on the NIVIDA A100 and H100 GPUs, respectively, over the state-of-the-art SPLATT library running on a 26-core Intel Ice Lake Xeon CPU.

Soh, Yongseok↗
DOE OSTI2024

Lorentzian contours for tree-level string amplitudes

We engineer compact contours on the moduli spaces of genus-zero Riemann surfaces that achieve analytic continuation from Euclidean to Lorentzian worldsheets. These generalized Pochhammer contours are based on the combinatorics of associahedra and make the analytic properties of tree-level amplitudes entirely manifest for any number and type of external strings. We use them in practice to perform first numerical computations of open and closed string amplitudes directly in the physical kinematics for n=4,5,6,7,8,9 n = 4 , 5 , 6 , 7 , 8 , 9 . We provide a code that allows anyone to do such computations.

Physics↗
DOE OSTI2025

Introducing the SLICE Method for estimating pebble-bed reactor inventories at equilibrium operation with SCALE

This paper introduces the SCALE Leap-In method for Cores at Equilibrium (SLICE) for estimating pebble-bed reactor equilibrium core isotopic inventories using capabilities in the SCALE code system, requiring only a small computational cluster and a few days of computation. This method uses an iterative approach that relies on (1) a surrogate spectrum model that captures spatial and time-dependent spectral conditions, (2) a multi-pass model that captures the pebble’s evolving nuclide inventory as a function of location and time in the core, and (3) a full-core model that captures the core’s spatial neutron flux distribution. The SLICE approach is applied to a generic fluoride salt–cooled high-temperature reactor, demonstrating fuel inventory convergence through nuclide concentration inspection across iterations and comparisons for core realizations with varying discretizations. Results agree within ~5% with another state-of-the-art code, with differences attributed to input parameter or modeling assumption variations in the equilibrium generation methods.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2026

Radiative strength functions from the energy-localized Brink-Axel hypothesis

Radiative strength functions (RSFs) model the bulk electromagnetic response of highly excited nuclei and are critical inputs for statistical reaction codes. In this paper, we present a definition of the RSF that is consistent with Hauser-Feshbach reaction codes and that can be efficiently computed with the shell model using the Lanczos strength-function (LSF) method. Here, we introduce a variant of the shell-model LSF method that exploits the energy-localized Brink-Axel hypothesis, which makes it possible to compute both electric and magnetic RSFs across all energies relevant to capture reactions. We verify agreement with the conventional definition of RSFs with benchmark calculations of 24 Mg and then present novel results for 56 Fe. For 56 Fe we find that (i) the 𝑀⁢1 RSF shape evolves smoothly with excitation energy, consistent with the energy-localized Brink-Axel hypothesis; (ii) both 𝑀⁢1 and 𝐸⁢1 transitions contribute significantly to the radiative strength below the photoabsorption threshold; and (iii) within the sdpf model space, the strength below 3 MeV observed in Oslo-type experiments cannot be fully reproduced. These results pave the way for a coherent microscopic description of RSFs and further motivate the use of energy-dependent RSFs in modern reaction codes.

Physics - Nuclear physics and radiation physics↗