Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 649 records · Page 36

Stochastic and a posteriori optimization to mitigate coil manufacturing errors in stellarator design

Abstract It was recently shown in Wechsung et al (2022 Proc. Natl Acad. Sci. USA 119 e2202084119) that there exist electromagnetic coils that generate magnetic fields, which are excellent approximations to quasi-symmetric fields and have very good particle confinement properties. Using a Gaussian process-based model for coil perturbations, we investigate the impact of manufacturing errors on the performance of these coils. We show that even fairly small errors result in noticeable performance degradation. While stochastic optimization yields minor improvements, it is not possible to mitigate these errors significantly. As an alternative to stochastic optimization, we then formulate a new optimization problem for computing optimal adjustments of the coil positions and currents without changing the shapes of the coil. These a-posteriori adjustments are able to reduce the impact of coil errors by an order of magnitude, providing a new perspective for dealing with manufacturing tolerances in stellarator design.

Physics↗

Distributed quantum sensing enhanced by continuous-variable error correction

Abstract A distributed sensing protocol uses a network of local sensing nodes to estimate a global feature of the network, such as a weighted average of locally detectable parameters. In the noiseless case, continuous-variable (CV) multipartite entanglement shared by the nodes can improve the precision of parameter estimation relative to the precision attainable by a network without shared entanglement; for an entangled protocol, the root mean square estimation error scales like 1/ M with the number M of sensing nodes, the so-called Heisenberg scaling, while for protocols without entanglement, the error scales like 1 / M . However, in the presence of loss and other noise sources, although multipartite entanglement still has some advantages for sensing displacements and phases, the scaling of the precision with M is less favorable. In this paper, we show that using CV error correction codes can enhance the robustness of sensing protocols against imperfections and reinstate Heisenberg scaling up to moderate values of M . Furthermore, while previous distributed sensing protocols could measure only a single quadrature, we construct a protocol in which both quadratures can be sensed simultaneously. Our work demonstrates the value of CV error correction codes in realistic sensing scenarios.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient flexible characterization of quantum processors with nested error models

We present a simple and powerful technique for finding a good error model for a quantum processor. The technique iteratively tests a nested sequence of models against data obtained from the processor, and keeps track of the best-fit model and its wildcard error (a metric of the amount of unmodeled error) at each step. Each best-fit model, along with a quantification of its unmodeled error, constitutes a characterization of the processor. We explain how quantum processor models can be compared with experimental data and to each other. We demonstrate the technique by using it to characterize a simulated noisy two-qubit processor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mitigating baryonic effects with a theoretical error covariance

ABSTRACT One of the primary sources of uncertainties in modelling the cosmic-shear power spectrum on small scales is the effect of baryonic physics. Accurate cosmology for stage-IV surveys requires knowledge of the matter power spectrum deep in the non-linear regime at the per cent level. Therefore, it is important to develop reliable mitigation techniques to take into account baryonic uncertainties if information from small scales is to be considered in the cosmological analysis. In this work, we develop a new mitigation method for dealing with baryonic physics for the case of the shear angular power spectrum. The method is based on an augmented covariance matrix that incorporates baryonic uncertainties informed by hydrodynamical simulations. We use the results from 13 hydrodynamical simulations and the residual errors arising from a fit to a ΛCDM model using the extended halo model code HMCode to account for baryonic physics. These residual errors are used to model a so-called theoretical error covariance matrix that is added to the original covariance matrix. In order to assess the performance of the method, we use the 2D tomographic shear from four hydrodynamical simulations that have different extremes of baryonic parameters as mock data and run a likelihood analysis comparing the residual bias on Ωm and σ8 of our method and the HMCode for an LSST-like survey. We use different modelling of the theoretical error covariance matrix to test the robustness of the method. We show that it is possible to reduce the bias in the determination of the tested cosmological parameters at the price of a modest decrease in the precision.

79 ASTRONOMY AND ASTROPHYSICS↗

The impact of tomographic redshift bin width errors on cosmological probes

ABSTRACT Systematic errors in the galaxy redshift distribution n(z) can propagate to systematic errors in the derived cosmology. We characterize how the degenerate effects in tomographic bin widths and galaxy bias impart systematic errors on cosmology inference using observational data from the Deep Lens Survey. For this we use a combination of galaxy clustering and galaxy–galaxy lensing. We present two end-to-end analyses from the catalogue level to parameter estimation. We produce an initial cosmological inference using fiducial tomographic redshift bins derived from photometric redshifts, then compare this with a result where the redshift bins are empirically corrected using a set of spectroscopic redshifts. We find that the derived parameter S8 ≡ σ8(Ωm/.3)1/2 decreases from $0.841^{+0.062}_{-0.061}$ to $0.781^{0.061}_{0.054}$ upon correcting the n(z) errors in the second method.

79 ASTRONOMY AND ASTROPHYSICS↗

The effect of quasar redshift errors on Lyman-α forest correlation functions

ABSTRACT Using synthetic Lyman-α forests from the Dark Energy Spectroscopic Instrument (DESI) survey, we present a study of the impact of errors in the estimation of quasar redshift on the Lyman-α correlation functions. Estimates of quasar redshift have large uncertainties of a few hundred km s−1 due to the broadness of the emission lines and the intrinsic shifts from other emission lines. We inject Gaussian random redshift errors into the mock quasar catalogues, and measure the auto-correlation and the Lyman-α-quasar cross-correlation functions. We find a smearing of the BAO feature in the radial direction, but changes in the peak position are negligible. However, we see a significant unphysical correlation for small separations transverse to the line of sight which increases with the amplitude of the redshift errors. We interpret this contamination as a result of the broadening of emission lines in the measured mean continuum, caused by quasar redshift errors, combined with the unrealistically strong clustering of the simulated quasars on small scales.

79 ASTRONOMY AND ASTROPHYSICS↗

One- and two-qubit gate infidelities due to motional errors in trapped ions and electrons

In this work, we derive analytic formulas that determine the effect of error mechanisms on one- and two-qubit gates in trapped ions and electrons. First, we analyze and derive expressions for the effect of driving field inhomogeneities on one-qubit gate fidelities. Second, we derive expressions for two-qubit gate errors, including static motional frequency shifts, trap anharmonicities, field inhomogeneities, heating, and motional dephasing. We show that, for small errors, each of our expressions for infidelity converges to its respective numerical simulation; this shows that our formulas are sufficient for determining error budgets for high-fidelity gates, obviating numerical simulations in future projects. All of the derivations are general to any internal qubit state, and any mixed state of the ion crystal's motion that is diagonal in the Fock state basis. Our treatment of static motional frequency shifts, trap anharmonicities, heating, and motional dephasing apply to both laser-based and laser-free gates, while our treatment of field inhomogeneities applies to laser-free systems.

74 ATOMIC AND MOLECULAR PHYSICS↗

Loschmidt-echo approach to error estimation in Krylov-subspace approximation

The Krylov subspace method is a traditional approach to approximate quantum evolution, allowing us to treat systems with large Hilbert spaces. Despite its popularity, current bounds typically overestimate the error, which translates into more expensive simulation routines. Here, in this paper, we tackle this problem by realizing that the error can be understood as a Loschmidt echo in a one-dimensional (1D) noninteracting tight-binding Hamiltonian. We show that the different time regimes of the approximation can be understood using simple physical ideas. More importantly, we obtain computationally cheap error bounds that describe with high precision the actual error in the approximation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multispin Clifford codes for angular momentum errors in spin systems

The physical symmetries of a system play a central role in quantum error correction. Here, in this work we encode a qubit in a collection of systems with angular momentum symmetry (spins), extending the tools developed by Gross for single large spins. By considering large spins present in atomic systems and focusing on their collective symmetric subspace, we develop codes with octahedral symmetry capable of correcting errors up to second order in angular momentum operators. These errors include the most physically relevant noise sources such as microwave control errors and optical pumping. We additionally explore qubit codes that exhibit distance scaling commensurate with the surface code while permitting transversal single-qubit Clifford operations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simple model to investigate jet quenching and correlated errors for centrality-dependent nuclear modification factors in relativistic heavy-ion collisions

Here, we apply Bayesian techniques to compare a simple, empirical model for jet quenching in heavy-ion collisions to centrality-dependent jet R AA measured by ATLAS for Pb + Pb collisions at $\sqrt{s_{NN}}$ = 5.02 TeV. We find that the R AA values for central collisions are adequately described with a model for the mean p T -dependent jet energy loss using only two parameters. This model is extended by incorporating two-dimensional initial geometry information from TRENTo and compared to centrality-dependent R AA values. We find that the results are sensitive to the value of the jet-quenching formation time, τ ƒ , and that the optimal value of τ ƒ varies with the assumed path-length dependence of the energy loss. We construct a covariance error matrix for the data from the p T -dependent contributions to the ATLAS systematic errors and perform Bayesian calibrations for several different assumptions for the systematic error correlations. We show that the most-probable functions and $χ^2_d$ values are sensitive to assumptions made when fitting to correlated errors. This work demonstrates the utility of a simple model that can quickly demonstrate the constraining power of jet-quenching observables with corresponding uncertainties and guide future studies using more sophisticated models.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Quantifying the impact of precision errors on quantum approximate optimization algorithms

The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical algorithm that seeks to achieve approximate solutions to optimization problems by iteratively alternating between intervals of controlled quantum evolution. Here, we examine the effect of analog precision errors on QAOA performance from the perspective of both algorithmic training and performance guarantees. Leveraging cumulant expansions, we recast the faulty QAOA as a control problem in which precision errors are expressed as multiplicative control noise and derive bounds on the performance of QAOA. We show using both analytical techniques and numerical simulations that fixed precision implementations of QAOA circuits are subject to an exponential degradation in performance dependent upon the number of optimal QAOA layers and magnitude of the precision error. Despite this significant reduction, we show that it is possible to mitigate precision errors in QAOA via digitization of the variational parameters at the cost of increasing circuit depth.

quantum algorithms↗

Inverse Volume Scaling of Finite-Size Error in Periodic Coupled Cluster Theory

Coupled cluster theory is one of the most popular post-Hartree-Fock methods for molecular quantum chemistry. The finite-size error of the correlation energy in periodic coupled cluster calculations for three-dimensional insulating systems has been observed to satisfy the inverse volume scaling, even in the absence of any correction schemes. This is surprising, as simpler theories that utilize only a subset of the coupled cluster diagrams exhibit much slower decay of the finite-size error, which scales inversely with the length of the system. In this study, we review the current understanding of finite-size error in quantum chemistry methods for periodic systems. We introduce new tools that elucidate the mechanisms behind this phenomenon in the context of coupled cluster doubles calculations. This reconciles some seemingly paradoxical statements related to finite-size scaling. Our findings also show that singularity subtraction can be a powerful method to effectively reduce finite-size errors in practical quantum chemistry calculations for periodic systems. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗

Trotter Errors from Dynamical Structural Instabilities of Floquet Maps in Quantum Simulation

We study the behavior of errors in the quantum simulation of spin systems with long-range multibody interactions resulting from the Trotter-Suzuki decomposition of the time-evolution operator. We identify a regime where the Floquet operator underlying the Trotter decomposition undergoes sharp changes even for small variations in the simulation step size. This results in a time evolution operator that is very different from the dynamics generated by the targeted Hamiltonian, which leads to a proliferation of errors in the quantum simulation. These regions of sharp change in the Floquet operator, referred to as structural instability regions, appear typically at intermediate Trotter step sizes and in the weakly interacting regime, and are thus complementary to recently revealed quantum chaotic regimes of the Trotterized evolution [L. M. Sieberer et al. npj Quantum Inf. 5, 78 (2019); M. Heyl, P. Hauke, and P. Zoller, Sci. Adv. 5, eaau8342 (2019)]. We characterize these structural instability regimes in p-spin models, transverse-field Ising models with all-to-all p-body interactions, and analytically predict their occurrence based on unitary perturbation theory. We further show that the effective Hamiltonian associated with the Trotter decomposition of the unitary time-evolution operator, when the Trotter step size is chosen to be in the structural instability region, is very different from the target Hamiltonian, which explains the large errors that can occur in the simulation in the regions of instability. These results have implications for the reliability of near-term gate-based quantum simulators, and reveal an important interplay between errors and the physical properties of the system being simulated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Shadow Distillation: Quantum Error Mitigation with Classical Shadows for Near-Term Quantum Processors

Mitigating errors in quantum information processing devices is especially important in the absence of fault tolerance. An effective method in suppressing state-preparation errors is using multiple copies to distill the ideal component from a noisy quantum state. Here, we use classical shadows and randomized measurements to circumvent the need for coherent access to multiple copies at an exponential cost. We study the scaling of resources using numerical simulations and find that the overhead is still favorable compared to full state tomography. We optimize measurement resources under realistic experimental constraints and apply our method to an experiment preparing a Greenberger-Horne-Zeilinger state with trapped ions. In addition to improving stabilizer measurements, the analysis of the improved results reveals the nature of errors affecting the experiment. Hence, our results provide a directly applicable method for mitigating errors in near-term quantum computers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Algorithmic and Software Pipeline for Very Large Scale Scientific Data Compression with Error Guarantees

Efficient data compression is becoming increasingly critical for storing scientific data because many scientific applications produce vast amounts of data. This paper presents an end-to-end algorithmic and software pipeline for data compression that guarantees both error bounds on primary data (PD) and derived data, known as Quantities of Interest (QoI).We demonstrate the effectiveness of the pipeline by compressing fusion data generated by a large-scale fusion code, XGC, which produces tens of petabytes of data in a single day. We demonstrate that the compression is conducted by setting aside computational resources known as staging nodes, and does not impact the simulation performance. For efficient parallel I/O, the pipeline uses ADIOS2, which many codes such as XGC already use for their parallel I/O. We show that our approach can compress the data by two orders of magnitude while guaranteeing high accuracy on both the PD and the QoIs. Further, the amount of resources required by compression is a few percent of the resources required by simulation while ensuring that the compression time for each stage is less than the corresponding simulation time.This pipeline consists of three main steps. The first step decomposes the data using domain decomposition into small subdomains. Each subdomain is then compressed independently to achieve a high level of parallelism. The second step uses existing techniques that guarantee error bounds on the primary data for each subdomain. The third step uses a post-processing optimization technique based on Lagrange multipliers to reduce the QoI errors for data corresponding to each subdomain. The Lagrange multipliers generated can be further quantized or truncated to increase the compression level. All of the above characteristics of our approach make it highly practical to apply on-the-fly compression while guaranteeing errors on QoIs that are critical to the scientists.

Banerjee, Tania↗

Soft Syndrome Decoding of Quantum LDPC Codes for Joint Correction of Data and Syndrome Errors

Quantum errors are primarily detected and corrected using the measurement of syndrome information which itself is an unreliable step in practical error correction implementations. Typically, such faulty or noisy syndrome measurements are modeled as a binary measurement outcome flipped with some probability. However, the measured syndrome is in fact a discretized value of the continuous voltage or current values obtained in the physical implementation of the syndrome extraction. In this paper, we use this "soft" or analog information without the conventional discretization step to benefit the iterative decoders for decoding quantum low-density parity-check (QLDPC) codes. Syndrome-based iterative belief propagation (BP) decoders are modified to utilize the syndrome-soft information to successfully correct both data and syndrome errors simultaneously, without repeated measurements. We demonstrate the advantages of extracting the soft information from the syndrome in our improved decoders, not only in terms of comparison of thresholds and logical error rates for quasi-cyclic lifted-product QLDPC code families, but also for faster convergence of iterative decoders. In particular, the new BP decoder with noisy syndrome performs as good as the standard BP decoder under ideal syndrome.

97 MATHEMATICS AND COMPUTING↗

Error-controlled Progressive Retrieval of Scientific Data under Derivable Quantities of Interest

The unprecedented amount of scientific data has introduced heavy pressure on the current data storage and transmission systems. Progressive compression has been proposed to mitigate this problem, which offers data access with on-demand precision. However, existing approaches only consider precision control on primary data, leaving uncertainties on the quantities of interest (QoIs) derived from it. In this work, we present a progressive data retrieval framework with guaranteed error control on derivable QoIs. Our contributions are three-fold. (1) We carefully derive the theories to strictly control QoI errors during progressive retrieval. Our theory is generic and can be applied to any QoIs that can be composited by the basis of derivable QoIs proved in the paper. (2) We design and develop a generic progressive retrieval framework based on the proposed theories, and optimize it by exploring feasible progressive representations. (3) We evaluate our framework using five real-world datasets with a diverse set of QoIs. Experiments demonstrate that our framework can faithfully respect any user-specified QoI error bounds in the evaluated applications. This leads to over 2.02× performance gain in data transfer tasks compared to transferring the primary data while guaranteeing a QoI error that is less than 1E-5.

Wu, Xuan↗

An Accurate, Error-Tolerant, and Energy-Efficient Neural Network Inference Engine Based on SONOS Analog Memory

In this work, we demonstrate SONOS (silicon-oxide-nitrideoxide- silicon) analog memory arrays that are optimized for neural network inference. The devices are fabricated in a 40nm process and operated in the subthreshold regime for in-memory matrix multiplication. Subthreshold operation enables low conductances to be implemented with low error, which matches the typical weight distribution of neural networks, which is heavily skewed toward near-zero values. This leads to high accuracy in the presence of programming errors and process variations. We simulate the end-to-end neural network inference accuracy, accounting for the measured programming error, read noise, and retention loss in a fabricated SONOS array. Evaluated on the ImageNet dataset using ResNet50, the accuracy using a SONOS system is within 2.16% of floating-point accuracy without any retraining. The unique error properties and high On/Off ratio of the SONOS device allow scaling to large arrays without bit slicing, and enable an inference architecture that achieves 20 TOPS/W on ResNet50, a >10× gain in energy efficiency over state-of-the-art digital and analog inference accelerators.

97 MATHEMATICS AND COMPUTING↗