Search NASA⌕ Search

SEARCH · Search NASA

Results for “block 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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

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↗
DOE OSTI2021

Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms

Although mixed precision arithmetic has recently garnered interest for training dense neural networks, many other applications could benefit from the speedups and lower storage cost if applied appropriately. The growing interest in employing mixed precision computations motivates the need for rounding error analysis that properly handles behavior from mixed precision arithmetic. We develop mixed precision variants of existing Householder QR algorithms and show error analyses supported by numerical experiments.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2025

Eureka: Enabling Fine-Grained Access and Range Queries on Compressed Scientific Data via Data-Index Co-Compression

Handling large-scale scientific data in high-performance computing (HPC) environments poses significant challenges, including excessive I/O, high storage costs, and slow query performance. Traditional approaches often require full data decompression and scans, making them impractical for real-time or interactive analysis. To address these limitations, we introduce Eureka, a unified data-index co-compression framework that enables fine-grained access and efficient range queries on compressed scientific datasets. Eureka integrates spatial domain decomposition with block-wise error-bounded lossy compression to support selective decompression. It constructs a hierarchical AVL-tree index during compression to capture block-level value ranges, enabling fast pruning during query execution. To reduce metadata overhead, the index itself is also compressed while ensuring recall-preserving results. Experiments on six diverse HPC simulation datasets show that Eureka achieves up to 25x data compression and over 300x index compression, surpassing state-of-the-art compressors such as SZ3 and ZFP in rate-distortion performance. Additionally, Eureka delivers over 30x speedup for low-selectivity range queries, making it a scalable and efficient solution for modern scientific data analysis.

Yan, Ning↗
DOE OSTI2025

Classical Non-Markovian Noise in Symmetry-Preserving Quantum Dynamics

In quantum dynamics, symmetries are vital for identifying and assessing conserved quantities that govern the evolution of a quantum system. When promoted to the open quantum system setting, dynamical symmetries can be negatively altered by system-environment interactions, thus, complicating their analysis. Previous work on noisy symmetric quantum dynamics has focused on the Markovian setting, despite the ubiquity of non-Markovian noise in a number of widely used quantum technologies. Here, in this Letter, we develop a framework for quantifying the impact of non-Markovian noise on symmetric quantum evolution via root space decompositions and the filter function formalism. We demonstrate analytically that symmetry-preserving noise maintains the symmetric subspace, while nonsymmetric noise leads to highly specific leakage errors that are block diagonal in the symmetry representation. We support our findings with numerical studies of a transverse-field Ising model and a quantum error detecting code subject to spatiotemporally correlated multiaxis noise. Our results are broadly applicable, providing new analytic insights into the control and characterization of open quantum system dynamics.

decoherence↗
DOE OSTI2019

Error Correction Decoding for Underwater Acoustic Tag Detection

This paper presents a decoding method applied to a set of underwater acoustic tags that employ very short signal beacons periodically transmitted. The tags use the CRC8- Dallas linear block code for error detection originally. Though the CRC8-Dallas is quite weak, syndrome-based error correction is applied to correct the decoding errors. Meanwhile, multi-channel array receivers are utilized to find the common decodes of the tag IDs, and the list of the true tag IDs is used to test the detection accuracy and false alarm rate. The proposed syndrome decoding method is applied to over 2 million files recorded in field experiments. The results demonstrate that the syndrome method yields around 9.85% more true positive decodes at the cost of a 2 - 5 times increase in false positive rates. Further insights are also gained to enable future improvement of the detection algorithms

Hall, Joseph↗
DOE OSTI2026

Extending SLUSCHI for Automated Diffusion Calculations

We present an extension of the SLUSCHI package (Solid and Liquid in Ultra Small Coexistence with Hovering Interfaces) to enable automated diffusion calculations from first-principles molecular dynamics. While the original SLUSCHI workflow was designed for melting temperature estimation via solid-liquid coexistence, we adapt its input and output handling to isolate the volume search stage and generate one production trajectory suitable for diffusion analysis. Post-processing tools parse VASP outputs, compute mean-square displacements (MSD), and extract tracer diffusivities using the Einstein relation with robust error estimates through block averaging. Diagnostic plots, including MSD curves, running slopes, and velocity autocorrelations, are produced automatically to help identify diffusive regimes. The method has been validated through representative case studies: self-diffusion in Al-Cu liquid alloys, sublattice melting in Li7La3Zr2O12 and Er2O3, interstitial oxygen transport in bcc and fcc Fe, and oxygen diffusivity in Fe-O liquids with variable Si and Al contents. Viscosity and diffusivity are linked through the Stokes-Einstein relation, with composition dependence assessed via simple linear mixing. This capability broadens SLUSCHI from melting-point predictions to transport property evaluation, enabling high-throughput, fully first-principles datasets of diffusion coefficients and viscosities across metals and oxides.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Joint Channel Equalization and Symbol Detection for IoT Devices in Severe Multipath Channels

Internet of Things (IoT) devices often transmit very short message blocks without strong error correction coding or pilots for channel equalization. When the transmitted signals encounter a severe multipath channel, the receiver is often unable to equalize the resulting inter-symbol interference (ISI) via traditional methods, leading to a high retransmission rate. This paper proposes a joint channel equalization and symbol detection scheme for this scenario by utilizing the preamble sequence as a training pilot for equalization and the relatively weak cyclic redundancy check (CRC) 8-Dallas code for error correction. By assuming a sparse channel impulse response, the proposed joint channel equalization and symbol detection scheme formulates an l1 norm constrained optimization problem and solves it by a saddle-point algorithm. The proposed algorithm is applied to a set of real-world underwater animal tracking IoT data, and the results show improvement of correct message detection rate from 21:5% to 41:6%.

Jing, Shusen↗
DOE OSTI2020

Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM

We analyze an expansion of the generalized block Krylov subspace framework of [Electron. Trans. Numer. Anal., 47 (2017), pp. 100--126]. This expansion allows the use of low-rank modifications of the matrix projected onto the block Krylov subspace and contains, as special cases, the block GMRES method and the new block Radau--Arnoldi method. Within this general setting, we present results that extend the interpolation property from the nonblock case to a matrix polynomial interpolation property for the block case, and we relate the eigenvalues of the projected matrix to the latent roots of these matrix polynomials. Some error bounds for these modified block FOM methods for solving linear systems are presented. We then show how cospatial residuals can be preserved in the case of families of shifted linear block systems. This result is used to derive computationally practical restarted algorithms for block Krylov approximations that compute the action of a matrix function on a set of several vectors simultaneously. Finally, we prove some error bounds and present numerical results showing that two modifications of FOM, the block harmonic and the block Radau--Arnoldi methods for matrix functions, can significantly improve the convergence behavior.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Layer-Dependent Bit Error Variation in 3-D NAND Flash Under Ionizing Radiation

In this paper, we studied the total ionization dose (TID) effects on the multilevel-cell (MLC) 3-D NAND flash memory using Co-60 gamma radiation. We found a significant page-to-page bit error variation within a physical memory block of the irradiated memory chip. Our analysis showed that the origin of the bit error variation is the unique vertical layer-dependent TID response of the 3-D NAND. We found that the memory pages located at the upper and lower layers of the 3-D stack show higher fails compared to the middle-layer pages of a given memory block. We confirmed our findings by comparing radiation response of four different chips of the same specification. In addition, we compared the TID response of the MLC 3-D NAND with that of the 2-D NAND chip, which showed less page-to-page variation in bit error within a given memory block. We discuss the possible application of our findings for the radiation-tolerant smart memory controller design.

3-D NAND flash↗
DOE OSTI2023

Method and apparatus for data protection in memory devices

An apparatus and method for efficiently transmitting data are described. A transmitter sends data to a receiver. An encoder of the transmitter divides a received first block of data into multiple sub-blocks. The encoder selects a portion of each sub-block to compare to one another. A portion in a particular sub-block has a same offset and a same size as other portions of other sub-blocks. If the encoder determines the multiple portions match one another, the encoder sends, to the receiver, a second block of data corresponding to the first block of data. The second block of data has a same size as a size of the received first block of data, and the second block of data includes security data from one of multiple error correction schemes. Therefore, the second block of data provides security without increasing an amount of data to transmit.

SeyedzadehDelcheh, SeyedMohammad↗
DOE OSTI2021

Nonoverlapping block smoothers for the Stokes equations

Overlapping block smoothers efficiently damp the error contributions from highly oscillatory components within multigrid methods for the Stokes equations but they are computationally expensive. This paper is concentrated on the development and analysis of new block smoothers for the Stokes equations that are discretized on staggered grids. These smoothers are nonoverlapping and therefore desirable due to reduced computational costs. Traditional geometric multigrid methods are based on simple pointwise smoothers. However, using multigrid methods to efficiently solve more difficult problems such as the Stokes equations leads to computationally more expensive smoothers, for example, overlapping block smoothers. Nonoverlapping smoothers are less expensive, but have been considered less efficient in the literature. In this paper, we develop new nonoverlapping smoothers, the so-called triad-wise smoothers, and show their efficiency within multigrid methods to solve the Stokes equations. In addition, we compare overlapping and nonoverlapping smoothers by measuring their computational costs and analyzing their behavior by the use of local Fourier analysis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Machine Straightness Error Measurement Based on Optical Fiber Fabry–Pérot Interferometer Monitoring Technique

Abstract In this research, we propose an Error Separation Technique (EST) based on optical fiber sensors for on-machine straightness error measurement. Two fiber optic Fabry–Pérot interferometers have been developed serving as two displacement sensors. The displacement distance is computed according to the reflected spectrum from interferometers, which can achieve a sub-micrometer resolution. The two-point method has been employed to separate the straightness error of the slides and the profile error of a fine-polished standard block. The spacing distance between two interferometers is determined by the diameter of optical fibers so that the EST's resolution has the potential to reach the sub-millimeter scale. In the experiment, the straightness error has been measured on a commercially available computer numerical control machine tool, and the measurement has been conducted on its x-axis. The spacing distance between two optical fiber sensors is 1.5 mm which equals the EST's resolution along the machine tool's x-axis. The separated profile error of the measured standard block is around 30 µm which has been verified by a high precision Coordinate Measurement Machine (CMM). The magnitude of the separated straightness error is around 40 µm. This technique is flexible and simple to be conducted, which can contribute to the micro-machine tool calibration and other straightness error applications.

Engineering↗
DOE OSTI2026

Resilience of the surface code to error bursts

Quantum error correction works effectively only if the error rate of gate operations is sufficiently low. However, some rare physical mechanisms can cause a temporary increase in the error rate that affects many qubits; examples include ionizing radiation in superconducting hardware and large deviations in the global control of atomic systems. We refer to such rare transient spikes in the gate error rate as error bursts. In this work, we investigate the resilience of the rotated surface code to generic error bursts. We assume that, after appropriate mitigation strategies, the spike in the error rate lasts for only a single syndrome-extraction cycle; we also assume that the enhanced error rate is uniform across the code block. Under these assumptions, and for a circuit-level depolarizing noise model, we perform Monte Carlo simulations to determine the regime in burst error rate and background error rate for which the memory time becomes arbitrarily long as the code block size grows. Our results indicate that suitable hardware mitigation methods combined with standard decoding methods may suffice to protect against transient error bursts in the rotated surface code.

Quantum error correction↗
DOE OSTI2025

Physics-Driven Construction of Compact Primitive Gaussian Density Fitting Basis Sets

We present a model-assisted density fitting (MADF) basis set generator, an algorithm for generating primitive atomic Gaussian density fitting (DF) basis sets (DFBSs) from a contracted Gaussian orbital basis set (OBS). The MADF algorithm produces DFBSs suitable for accurate robust DF approximation of 2-particle interactions in mean-field and correlated electronic structures. The algorithm is designed to (a) saturate the OBS product space by a large regularized set of primitive solid-harmonic Gaussian shells with nonuniform distribution of exponents, followed by (b) pruning of the shells according to their contributions to the 2- body energy of a correlated atomic ensemble. Building the DFBS generator model almost exclusively on mathematical and physical principles allows one to limit the number of parameters that control the density fitting error to three, with a single set of parameters sufficient for computations with all basis cardinal numbers, with and without correlation of core electrons, with and without scalar and spin-dependent relativistic effects, spanning almost all of the Periodic Table. Performance assessment included basis sets up to quadruple-ζ quality from several major basis set families, using molecules composed of main-group, d-block, and f-block elements. The resulting DF errors in Hartree−Fock and second-order MP2 energies (with relativistic all-electron treatments, when appropriate) were on the order of 20 and 10 μE h per electron, respectively.

Approximation↗
DOE OSTI2020

Reliable voltage scaled links for compressed data

Systems, apparatuses, and methods for reliably transmitting data over voltage scaled links are disclosed. A computing system includes at least first and second devices connected via a link. In one implementation, if a data block can be compressed to less than or equal to half the original size of the data block, then the data block is compressed and sent on the link in a single clock cycle rather than two clock cycles. If the data block cannot be compressed to half the original size, but if the data block can be compressed enough to include error correction code (ECC) bits without exceeding the original size, then ECC bits are added to the compressed block which is sent on the link at a reduced voltage. The ECC bits help to correct for any errors that are generated as a result of operating the link at the reduced voltage.

42 ENGINEERING↗
DOE OSTI2021

Constrained Block Nonlinear Neural Dynamical Models

Neural network modules conditioned by known priors can be effectively trained and combined to represent systems with nonlinear dynamics. This work explores a novel formulation for data-efficient learning of deep control-oriented nonlinear dynamical models by embedding local model structure and constraints. The proposed method consists of neural network blocks that represent input, state, and output dynamics with constraints placed on the network weights and system variables. For handling partially observable dynamical systems, we utilize a state observer neural network to estimate the states of the system's latent dynamics. We evaluate the performance of the proposed architecture and training methods on system identification tasks for three nonlinear systems: a continuous stirred tank reactor, a two tank interacting system, and an aerodynamics body. Models optimized with a few thousand system state observations accurately represent system dynamics in open loop simulation over thousands of time steps from a single set of initial conditions. Experimental results demonstrate an order of magnitude reduction in open-loop simulation mean squared error for our constrained, block-structured neural models when compared to traditional unstructured and unconstrained neural network models.

Skomski, Elliott↗
DOE OSTI2020

Sensor Drift Estimation for Reactor Systems by Fusing Multiple Sensor Measurements

A nuclear power plant is instrumented with a variety of sensors that monitor its variables to estimate the state and initiate safety actions, if needed. We address the problem of estimating drifts or errors in sensor measurements due to factors such as calibration changes. We propose an information fusion method that uses measurements from other sensors to generate an estimate of a sensor measurement, and its difference from an actual measurement provides an error estimate. We present two fusers based on the ensemble of trees and support vector machine that are trained using sensor measurements collected at an emulated test loop of a pressurized water reactor under no-drift conditions. We present error estimates for a differential pressure sensor of the heat exchanger of the primary coolant system, under twenty controlled scenarios using the test loop. Both positive and negative errors are captured by both methods in scenarios involving calibration drifts, blocking, air gap and electromagnetic interference. The root mean square errors of estimated drifts are typically within 2% percent of the maximum.

Rao, Nageswara↗