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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
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↗
NASA NTRS1972

Error-correcting codes in computer arithmetic.

Summary of the most important results so far obtained in the theory of coding for the correction and detection of errors in computer arithmetic. Attempts to satisfy the stringent reliability demands upon the arithmetic unit are considered, and special attention is given to attempts to incorporate redundancy into the numbers themselves which are being processed so that erroneous results can be detected and corrected.

Massey, J. L.↗
DOE OSTI2023

Spin-squeezed Gottesman-Kitaev-Preskill codes for quantum error correction in atomic ensembles

Gottesman-Kitaev-Preskill (GKP) codes encode a qubit in displaced phase-space combs of a continuous-variable (CV) quantum system and are useful for correcting a variety of high-weight photonic errors. Here we propose atomic ensemble analogs of the single-mode CV GKP code by using the quantum central limit theorem to pull back the phase-space structure of a CV system to the compact phase space of a quantum spin system. We study the optimal recovery performance of these codes under error channels described by stochastic relaxation and isotropic ballistic dephasing processes using the diversity combining approach for calculating channel fidelity. Additionally, we find that the spin GKP codes outperform other spin system codes such as cat codes or binomial codes. Our spin GKP codes based on the two-axis countertwisting interaction and superpositions of SU(2) coherent states are direct spin analogs of the finite-energy CV GKP codes, whereas our codes based on one-axis twisting do not yet have well-studied CV analogs. A state preparation scheme for the spin GKP codes is proposed which uses the linear-combination-of-unitaries method, applicable to both the CV and spin GKP settings. Finally, we discuss a fault-tolerant approximate gate set for quantum computing with spin-GKP-encoded qubits, obtained by translating gates from the CV GKP setting using the quantum central limit theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1994

Triple-Error-Correcting Codec ASIC

Coder/decoder constructed on single integrated-circuit chip. Handles data in variety of formats at rates up to 300 Mbps, correcting up to 3 errors per data block of 256 to 512 bits. Helps reduce cost of transmitting data. Useful in many high-data-rate, bandwidth-limited communication systems such as; personal communication networks, cellular telephone networks, satellite communication systems, high-speed computing networks, broadcasting, and high-reliability data-communication links.

Jones, Robert E.↗
NASA NTRS1992

Matrix error correction for digital data

A technique for digital data error detection and correction is disclosed which adds alignment and checksum bytes to three sides of a matrix (24) of digital data to be protected. This technique is particularly used for the recording and storage (16,18) of digital data on video tape medium (14). The digital data is treated as a matrix block (24). Checksum and alignment bytes are added (20) to the digital data before tape storage and stripped (22) therefrom after successful alignment checks and data validation. In particular, the first column may be used to provide alignment bytes of a predetermined value for each row. The last column provides row checksum bytes for the data in each row. The last row provides column check sum bytes for each column, excluding the column of alignment bytes. The data location at the intersection of the row of column checksum bytes and the column of row checksum bytes may be used as a checksum byte for either the row or column checksum bytes.

Dotson, Ronald S.↗
DOE OSTI2023

Residual-based error correction for neural operator accelerated infinite-dimensional Bayesian inverse problems

We explore using neural operators, or neural network representations of nonlinear maps between function spaces, to accelerate infinite-dimensional Bayesian inverse problems (BIPs) with models governed by nonlinear parametric partial differential equations (PDEs). Neural operators have gained significant attention in recent years for their ability to approximate the parameter-to-solution maps defined by PDEs using as training data solutions of PDEs at a limited number of parameter samples. The computational cost of BIPs can be drastically reduced if the large number of PDE solves required for posterior characterization are replaced with evaluations of trained neural operators. However, reducing error in the resulting BIP solutions via reducing the approximation error of the neural operators in training can be challenging and unreliable. We provide an a priori error bound result that implies certain BIPs can be ill-conditioned to the approximation error of neural operators, thus leading to inaccessible accuracy requirements in training. To reliably deploy neural operators in BIPs, we consider a strategy for enhancing the performance of neural operators: correcting the prediction of a trained neural operator by solving a linear variational problem based on the PDE residual. We show that a trained neural operator with error correction can achieve a quadratic reduction of its approximation error, all while retaining substantial computational speedups of posterior sampling when models are governed by highly nonlinear PDEs. The strategy is applied to two numerical examples of BIPs based on a nonlinear reaction–diffusion problem and deformation of hyperelastic materials. We demonstrate that posterior representations of the two BIPs produced using trained neural operators are greatly and consistently enhanced by error correction.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1992

Neural network error correction for solving coupled ordinary differential equations

A neural network is presented to learn errors generated by a numerical algorithm for solving coupled nonlinear differential equations. The method is based on using a neural network to correctly learn the error generated by, for example, Runge-Kutta on a model molecular dynamics (MD) problem. The neural network programs used in this study were developed by NASA. Comparisons are made for training the neural network using backpropagation and a new method which was found to converge with fewer iterations. The neural net programs, the MD model and the calculations are discussed.

Shelton, R. O.↗
NASA NTRS1989

Internal Correction Of Errors In A DRAM

Error-correcting Hamming code built into circuit. A 256 K dynamic random-access memory (DRAM) circuit incorporates Hamming error-correcting code in its layout. Feature provides faster detection and correction of errors at less cost in amount of equipment, operating time, and software. On-chip error-correcting feature also makes new DRAM less susceptible to single-event upsets.

Zoutendyk, John A.↗
DOE OSTI2023

Status of Error Correction Studies in Support of FFA@CEBAF

In pursuit of higher energy at the Continuous Electron Beam Accelerator Facility (CEBAF), the FFA@CEBAF energy upgrade study is considering the implementation of a novel technology to recirculate electron beam through the accelerating gradient of the machine more times. The technology in question is Fixed-Field Alternating-gradient (FFA) bending accelerator arcs: these arcs may replace the present highest energy electromagnetic (EM) arcs, and due to a much wider energy acceptance allow several more passes. The survey and beam error tolerance of the FFA arcs need to be well understood prior to commissioning, in addition to the limits of planned correction magnets and diagnostics. This work explores the current state of error tolerance and correction studies in FFA arcs at CEBAF.

Benesch, J.↗
DOE OSTI2024

Error-correcting codes for fermionic quantum simulation

Utilizing the framework of \mathbb{Z}_2 ℤ 2 lattice gauge theories in the context of Pauli stabilizer codes, we present methodologies for simulating fermions via qubit systems on a two-dimensional square lattice. We investigate the symplectic automorphisms of the Pauli module over the Laurent polynomial ring. This enables us to systematically increase the code distances of stabilizer codes while fixing the rate between encoded logical fermions and physical qubits. We identify a family of stabilizer codes suitable for fermion simulation, achieving code distances of d=2,3,4,5,6,7, allowing correction of any \lfloor \frac{d-1}{2} \rfloor ⌊ d − 1 2 ⌋ -qubit error. In contrast to the traditional code concatenation approach, our method can increase the code distances without decreasing the (fermionic) code rate. In particular, we explicitly show all stabilizers and logical operators for codes with code distances of d=3,4,5. We provide syndromes for all Pauli errors and invent a syndrome-matching algorithm to compute code distances numerically.

Physics↗
NASA NTRS2021

Application of Non-Uniform Beam Filling (NUBF) Doppler Velocity Error Correction on Airborne Radar Measurements

Non-uniform beam filling (NUBF) within an atmospheric radar sampling volume can cause significant Doppler velocity errors when the radar is located on a fast-moving platform. A case of strong NUBF errors was identified in ER-2 X-band Radar (EXRAD) data from the Investigation of Microphysics and Precipitation for Atlantic Coast-Threatening Snowstorms (IMPACTS) 2020 field campaign. A basic NUBF correction was employed using an estimate of the along-track radar reflectivity gradient. The relationship is verified empirically using co-located Doppler velocity measurements from the higher resolution Cloud Radar System (CRS).

Matthew L. Walker McLinden↗