Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 73 records · Page 4

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↗

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↗

Coordinated joint motion control system with position error correction

Disclosed are an articulated hydraulic machine supporting, control system and control method for same. The articulated hydraulic machine has an end effector for performing useful work. The control system is capable of controlling the end effector for automated movement along a preselected trajectory. The control system has a position error correction system to correct discrepancies between an actual end effector trajectory and a desired end effector trajectory. The correction system can employ one or more absolute position signals provided by one or more acceleration sensors supported by one or more movable machine elements. Good trajectory positioning and repeatability can be obtained. A two joystick controller system is enabled, which can in some cases facilitate the operator's task and enhance their work quality and productivity.

42 ENGINEERING↗

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↗

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)↗

TYPE Ia SUPERNOVA DISTANCE MODULUS BIAS AND DISPERSION FROM K-CORRECTION ERRORS: A DIRECT MEASUREMENT USING LIGHT CURVE FITS TO OBSERVED SPECTRAL TIME SERIES

We estimate systematic errors due to K-corrections in standard photometric analyses of high-redshift Type Ia supernovae. Errors due to K-correction occur when the spectral template model underlying the light curve fitter poorly represents the actual supernova spectral energy distribution, meaning that the distance modulus cannot be recovered accurately. In order to quantify this effect, synthetic photometry is performed on artificially redshifted spectrophotometric data from 119 low-redshift supernovae from the Nearby Supernova Factory, and the resulting light curves are fit with a conventional light curve fitter. We measure the variation in the standardized magnitude that would be fit for a given supernova if located at a range of redshifts and observed with various filter sets corresponding to current and future supernova surveys. We find significant variation in the measurements of the same supernovae placed at different redshifts regardless of filters used, which causes dispersion greater than ∼0.05 mag for measurements of photometry using the Sloan-like filters and a bias that corresponds to a 0.03 shift in w when applied to an outside data set. To test the result of a shift in supernova population or environment at higher redshifts, we repeat our calculations with the addition of a reweighting of the supernovae as a function of redshift and find that this strongly affects the results and would have repercussions for cosmology. We discuss possible methods to reduce the contribution of the K-correction bias and uncertainty.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

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↗

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↗

Error Correction: a Proposal for a Standard

Some of the errors in transducers such as instrument transformers can be corrected as part of the digital processing for the measurement. The transducer can be characterized on such a way that allows the TEDS of IEEE Std 1451 to transfer the information to the measurement system. A modification would allow the measurement system to perform a high-quality self-calibration whenever a transducer was replaced.

error correction.↗

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↗

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↗

Error Correction for the JLEIC Ion Collider Ring

The sensitivity to misalignment, magnet strength error, and BPM noise is investigated in order to specify design tolerances for the ion collider ring of the Jefferson Lab Electron Ion Collider (JLEIC) project. Those errors, including horizontal, vertical, longitudinal displacement, roll error in transverse plane, strength error of main magnets (dipole, quadrupole, and sextupole), BPM noise, and strength jitter of correctors, cause closed orbit distortion, tune change, beta-beat, coupling, chromaticity problem, etc. These problems generally reduce the dynamic aperture at the Interaction Point (IP). According to real commissioning experiences in other machines, closed orbit correction, tune matching, beta-beat correction, decoupling, and chromaticity correction have been done in the study. Finally, we find that the dynamic aperture at the IP is restored. This paper describes that work.

Wei, Guohui↗

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.↗

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↗