Search NASA⌕ Search

SEARCH · Search NASA

Results for “error correction.”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
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 OSTI2016

Error-correction coding for hot-swapping semiconductor devices

A memory read operation is directed at a group of semiconductor devices from which a first semiconductor device has been removed. An error in data for the memory read operation is detected based on error-correction coding (ECC). The error is caused at least in part by the first semiconductor device having been removed. ECC is used to determine corrected data for the memory read operation.

42 ENGINEERING↗
DOE OSTI2022

Enhancing obfuscation of digital content through use of linear error correction codes

Technologies related to enhancing security of digital content are described. Linear error correction codes (LECCs) are employed for dual purposes: 1) to obfuscate digital content; and 2) to verify integrity of the digital content. A transmitter computing system obfuscates digital content based upon an obfuscation protocol, wherein the obfuscated digital content includes an LECC. A receiver computing system deobfuscates the digital content by performing the inverse of the obfuscation protocol.

Corral, Celestino A.↗
DOE OSTI2017

Time-dependent phase error correction using digital waveform synthesis

The various technologies presented herein relate to correcting a time-dependent phase error generated as part of the formation of a radar waveform. A waveform can be pre-distorted to facilitate correction of an error induced into the waveform by a downstream operation/component in a radar system. For example, amplifier power droop effect can engender a time-dependent phase error in a waveform as part of a radar signal generating operation. The error can be quantified and an according complimentary distortion can be applied to the waveform to facilitate negation of the error during the subsequent processing of the waveform. A time domain correction can be applied by a phase error correction look up table incorporated into a waveform phase generator.

42 ENGINEERING↗
DOE OSTI2025

Covariant Quantum Error-Correcting Codes with Metrological Entanglement Advantage

Here, we show that a subset of the basis for the irreducible representations of a tensor-product SU(2) rotation forms a covariant approximate quantum error-correcting code with transversal U(1) logical gates. Generalizing previous work on “thermodynamic codes” to general local spin and different irreducible representations using only properties of the angular momentum algebra, we obtain bounds on the code inaccuracy under generic noise on any known 𝑑 sites, under independent and identically distributed noise, and under heralded 𝑑-local erasures. We demonstrate that this family of codes protects a probe state with quantum Fisher information surpassing the standard quantum limit when the sensing parameter couples to the generator of the U(1) logical gate.

quantum error correction↗
DOE OSTI2020

Virtualized Logical Qubits: A 2.5D Architecture for Error-Corrected Quantum Computing

Current, near-term quantum devices have shown great progress in the last several years culminating recently with a demonstration of quantum supremacy. In the medium-term, however, quantum machines will need to transition to greater reliability through error correction, likely through promising techniques like surface codes which are well suited for near-term devices with limited qubit connectivity. We discover quantum memory, particularly resonant cavities with transmon qubits arranged in a 2.5D architecture, can efficiently implement surface codes with substantial hardware savings and performance/fidelity gains. Specifically, we virtualize logical qubits by storing them in layers of qubit memories connected to each transmon. Surprisingly, distributing each logical qubit across many memories has a minimal impact on fault tolerance and results in substantially more efficient operations. Our design permits fast transversal application of CNOT operations between logical qubits sharing the same physical address (same set of cavities) which are 6x faster than standard lattice surgery CNOTs. We develop a novel embedding which saves approximately 10x in transmons with another 2x savings from an additional optimization for compactness. Although qubit virtualization pays a 10x penalty in serialization, advantages in the transversal CNOT and in area efficiency result in fault-tolerance and performance comparable to conventional 2D transmon-only architectures. Our simulations show our system can achieve fault tolerance comparable to conventional two-dimensional grids while saving substantial hardware. Furthermore, our architecture can produce magic states at 1.22x the baseline rate given a fixed number of transmon qubits. Here, this is a critical benchmark for future fault-tolerant quantum computers as magic states are essential and machines will spend the majority of their resources continuously producing them. This architecture substantially reduces the hardware requirements for fault-tolerant quantum computing and puts within reach a proof-of-concept experimental demonstration of around 10 logical qubits, requiring only 11 transmons and 9 attached cavities in total.

quantum computing↗
DOE OSTI2024

Evaluating the mutagenicity of N-nitrosodimethylamine in 2D and 3D HepaRG cell cultures using error-corrected next generation sequencing

Human liver-derived metabolically competent HepaRG cells have been successfully employed in both two-dimensional (2D) and 3D spheroid formats for performing the comet assay and micronucleus (MN) assay. In the present study, we have investigated expanding the genotoxicity endpoints evaluated in HepaRG cells by detecting mutagenesis using two error-corrected next generation sequencing (ecNGS) technologies, Duplex Sequencing (DS) and High-Fidelity (HiFi) Sequencing. Both HepaRG 2D cells and 3D spheroids were exposed for 72 h to N-nitrosodimethylamine (NDMA), followed by an additional incubation for the fixation of induced mutations. NDMA-induced DNA damage, chromosomal damage, and mutagenesis were determined using the comet assay, MN assay, and ecNGS, respectively. The 72-h treatment with NDMA resulted in concentration-dependent increases in cytotoxicity, DNA damage, MN formation, and mutation frequency in both 2D and 3D cultures, with greater responses observed in the 3D spheroids compared to 2D cells. The mutational spectrum analysis showed that NDMA induced predominantly A:T → G:C transitions, along with a lower frequency of G:C → A:T transitions, and exhibited a different trinucleotide signature relative to the negative control. These results demonstrate that the HepaRG 2D cells and 3D spheroid models can be used for mutagenesis assessment using both DS and HiFi Sequencing, with the caveat that severe cytotoxic concentrations should be avoided when conducting DS. With further validation, the HepaRG 2D/3D system may become a powerful human-based metabolically competent platform for genotoxicity testing.

3D spheroids↗
DOE OSTI2026

Concatenated dual displacement code for continuous-variable quantum error correction

The continuous-variable (CV) Gaussian no-go theorem fundamentally limits the suppression of Gaussian displacement errors using only Gaussian gates and states. Prior studies have employed Gottesman-Kitaev-Preskill (GKP) states as ancillary qumodes to suppress small Gaussian displacement errors. However, when the displacement magnitude becomes large, inevitable lattice-crossing errors arise beyond the correctable range of the GKP state. To address this issue, we concatenate the Gaussian-noise-suppression circuit with an outer analog Steane code that corrects such occasional lattice-crossing events as well as other abrupt displacement errors. Contrary to conventional concatenation, which primarily aims to reduce logical error rates, the Steane-GKP duality in encoding provides complementary protection against displacement errors at different scales: The inner GKP layer employs non-Gaussian resources to suppress continuous Gaussian noise and reduce residual variance, while the outer analog Steane code corrects discrete lattice-crossing events that exceed the GKP correctable range. It is precisely this separation of error-mitigation roles that enables CV error correction. In contrast to prior work on concatenating GKP and repetition codes to establish error correction for discrete qubit/qudit encoding, we provide correction in the continuous encoding space. Analytical studies show that, under infinite squeezing, the concatenated code suppresses the variance of Gaussian displacement errors acting on all qumodes by up to 50%, while enabling unbiased correction of lattice-crossing errors with a success probability determined by the ratio between the residual Gaussian error standard deviation and the lattice-crossing magnitude. Even with finite squeezing, the proposed architecture still provides Gaussian-error suppression and lattice-crossing correction. Moreover, the presence of the outer analog Steane code relaxes the squeezing requirement of the inner GKP states, indicating near-term experimental feasibility. This work establishes a viable route toward fault-tolerant continuous-variable quantum computation and provides insight into the design of concatenated CV error-correcting architectures.

quantum error correction↗
DOE OSTI2021

Validation of Subhourly Clipping Loss Error Corrections

Under-performance of solar PV systems is an important issue that increases risks for stakeholders, including developers, investors and operators. Recently some attention has focused on underestimation of inverter clipping losses as a possible source of over-prediction where sub-hourly solar variability is high. Several models and data sets have been analyzed over the past few years, with the aim of quantifying, predicting, and correcting underestimated clipping loss errors for systems with high DC/AC ratio and solar variability. In this research, we apply a machine learning model developed at NREL to two physical PV systems, to correct for subhourly clipping losses. For each system, we compare overall AC power output for the model taken at 1-minute intervals to AC power output taken at 1-hour intervals with the addition of the subhourly clipping correction. Our findings consistently show that the addition of the clipping loss correction lead to a reduction in mean bias error of 0.8% and 1.2% for systems A and B, respectively, with no additional filtering applied. When examining high solar variability periods where clipping is more pronounced, system A and B experienced a 1.8% and 2.7% reduction in mean bias error, respectively, when the clipping correction was applied.

machine learning↗
DOE OSTI2021

Validation of Subhourly Clipping Loss Error Corrections: Preprint

Under-performance of solar PV systems is an important issue that increases risks for stakeholders, including developers, investors and operators. Recently some attention has focused on underestimation of inverter clipping losses as a possible source of over-prediction where sub-hourly solar variability is high. Several models and data sets have been analyzed over the past few years, with the aim of quantifying, predicting, and correcting underestimated clipping loss errors for systems with high DC/AC ratio and solar variability. In this research, we apply a machine learning model developed at NREL to two physical PV systems, to correct for subhourly clipping losses. For each system, we compare overall AC power output for the model taken at 1-minute intervals to AC power output taken at 1-hour intervals with the addition of the subhourly clipping correction. Our findings consistently show that the addition of the clipping loss correction lead to a reduction in mean bias error of 0.6\% and 1.1\% for systems A and B, respectively, with no additional filtering applied. When examining high solar variability periods where clipping is more pronounced, system A and B experienced a 1.4\% and 2.5\% reduction in mean bias error, respectively, when the clipping correction was applied.

machine learning↗
DOE OSTI2023

Transmon qubit readout fidelity at the threshold for quantum error correction without a quantum-limited amplifier

Abstract High-fidelity and rapid readout of a qubit state is key to quantum computing and communication, and it is a prerequisite for quantum error correction. We present a readout scheme for superconducting qubits that combines two microwave techniques: applying a shelving technique to the qubit that reduces the contribution of decay error during readout, and a two-tone excitation of the readout resonator to distinguish among qubit populations in higher energy levels. Using a machine-learning algorithm to post-process the two-tone measurement results further improves the qubit-state assignment fidelity. We perform single-shot frequency-multiplexed qubit readout, with a 140 ns readout time, and demonstrate 99.5% assignment fidelity for two-state readout and 96.9% for three-state readout–without using a quantum-limited amplifier.

Chen, Liangyu (ORCID:0000000250722445)↗
DOE OSTI2025

Celestial Quantum Error Correction. Part II. From qudits to celestial CFT

A holographic CFT description of asymptotically flat spacetimes inherits vacuum degeneracies and IR divergences from its gravitational dual. We devise a Quantum Error Correcting (QEC) framework to encode both effects as correctable fluctuations on the CFT dual. The framework is physically motivated by embedding a chain of qudits in the so-called Klein spacetime and then taking a continuum 𝑁 → ∞ limit. At finite 𝑁 the qudit chain 1) enjoys a discrete version of celestial symmetries and 2) supports a Gottesman-Kitaev-Preskill (GKP) code. The limit results in hard states with quantized BMS hair in the celestial torus forming the logical subspace, robust under errors induced by soft radiation. Technically, the construction leverages the recently studied 𝑤 1+∞ hierarchy of soft currents and its realization from a sigma model in twistor space.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Detecting macroevolutionary genotype–phenotype associations using error-corrected rates of protein convergence

On macroevolutionary timescales, extensive mutations and phylogenetic uncertainty mask the signals of genotype–phenotype associations underlying convergent evolution. To overcome this problem, we extended the widely used framework of non-synonymous to synonymous substitution rate ratios and developed the novel metric ω C , which measures the error-corrected convergence rate of protein evolution. While ω C distinguishes natural selection from genetic noise and phylogenetic errors in simulation and real examples, its accuracy allows an exploratory genome-wide search of adaptive molecular convergence without phenotypic hypothesis or candidate genes. Using gene expression data, we explored over 20 million branch combinations in vertebrate genes and identified the joint convergence of expression patterns and protein sequences with amino acid substitutions in functionally important sites, providing hypotheses on undiscovered phenotypes. We further extended our method with a heuristic algorithm to detect highly repetitive convergence among computationally non-trivial higher-order phylogenetic combinations. Our approach allows bidirectional searches for genotype–phenotype associations, even in lineages that diverged for hundreds of millions of years.

59 BASIC BIOLOGICAL SCIENCES↗
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 OSTI2022

Accelerating error correction in tomographic reconstruction

Abstract Spurred by recent advances in detector technology and X-ray optics, upgrades to scanning-probe-based tomographic imaging have led to an exponential growth in the amount and complexity of experimental data and have created a clear opportunity for tomographic imaging to approach single-atom sensitivity. The improved spatial resolution, however, is highly susceptible to systematic and random experimental errors, such as center of rotation drifts, which may lead to imaging artifacts and prevent reliable data extraction. Here, we present a model-based approach that simultaneously optimizes the reconstructed specimen and sinogram alignment as a single optimization problem for tomographic reconstruction with center of rotation error correction. Our algorithm utilizes an adaptive regularizer that is dynamically adjusted at each alternating iteration step. Furthermore, we describe its implementation in a software package targeting high-throughput workflows for execution on distributed-memory clusters. We demonstrate the performance of our solver on large-scale synthetic problems and show that it is robust to a wide range of noise and experimental drifts with near-ideal throughput.

Ali, Sajid (ORCID:0000000321864636)↗
DOE OSTI2022

Quantum minimal surfaces from quantum error correction

We show that complementary state-specific reconstruction of logical (bulk) operators is equivalent to the existence of a quantum minimal surface prescription for physical (boundary) entropies. This significantly generalizes both sides of an equivalence previously shown by Harlow[1]; in particular, we do not require the entanglement wedge to be the same for all states in the code space. In developing this theorem, we construct an emergent bulk geometry for general quantum codes, defining ``areas'' associated to arbitrary logical subsystems, and argue that this definition is ``functionally unique.'' We also formalize a definition of bulk reconstruction that we call ``state-specific product unitary’’ reconstruction. This definition captures the quantum error correction (QEC) properties present in holographic codes and has potential independent interest as a very broad generalization of QEC; it includes most traditional versions of QEC as special cases. Our results extend to approximate codes, and even to the ``non-isometric codes'' that seem to describe the interior of a black hole at late times.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Moonshine, superconformal symmetry, and quantum error correction

Special conformal field theories can have symmetry groups which are interesting sporadic finite simple groups. Famous examples include the Monster symmetry group of a c = 24 twodimensional conformal field theory (CFT) constructed by Frenkel, Lepowsky and Meurman, and the Conway symmetry group of a c = 12 CFT explored in detail by Duncan and Mack-Crane. The Mathieu moonshine connection between the K3 elliptic genus and the Mathieu group M24 has led to the study of K3 sigma models with large symmetry groups. A particular K3 CFT with a maximal symmetry group preserving (4, 4) superconformal symmetry was studied in beautiful work by Gaberdiel, Taormina, Volpato, and Wendland [41]. The present paper shows that in both the GTVW and c = 12 theories the construction of superconformal generators can be understood via the theory of quantum error correcting codes. The automorphism groups of these codes lift to symmetry groups in the CFT preserving the superconformal generators. In the case of the N = 1 supercurrent of the GTVW model our result, combined with a result of T. Johnson-Freyd implies the symmetry group is the maximal subgroup of M24 known as the sextet group. (The sextet group is also known as the holomorph of the hexacode.) Building on [41] the Ramond-Ramond sector of the GTVW model is related to the Miracle Octad Generator which in turn leads to a role for the Golay code as a group of symmetries of RR states. Moreover, (4, 1) superconformal symmetry suffices to define and decompose the elliptic genus of a K3 sigma model into characters of the N = 4 superconformal algebra. The symmetry group preserving (4, 1) is larger than that preserving (4, 4).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Symmetry Breaking and Error Correction in Open Quantum Systems

Symmetry-breaking transitions are a well-understood phenomenon of closed quantum systems in quantum optics, condensed matter, and high energy physics. However, symmetry breaking in open systems is less thoroughly understood, in part due to the richer steady-state and symmetry structure that such systems possess. For the prototypical open system—a Lindbladian—a unitary symmetry can be imposed in a “weak” or a “strong” way. We characterize the possible $\mathbb{Z}_n$ symmetry-breaking transitions for both cases. In the case of $\mathbb{Z}_2$, a weak-symmetry-broken phase guarantees at most a classical bit steady-state structure, while a strong-symmetry-broken phase admits a partially protected steady-state qubit. Viewing photonic cat qubits through the lens of strong-symmetry breaking, we show how to dynamically recover the logical information after any gap-preserving strong-symmetric error; such recovery becomes perfect exponentially quickly in the number of photons. Further, our study forges a connection between driven-dissipative phase transitions and error correction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗