Search NASA⌕ Search

SEARCH · Search NASA

Results for “error bound”

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 1,135 records · Page 63

Observability of fidelity decay at the Lyapunov rate in few-qubit quantum simulations

In certain regimes, the fidelity of quantum states will decay at a rate set by the classical Lyapunov exponent. This serves both as one of the most important examples of the quantum-classical correspondence principle and as an accurate test for the presence of chaos. While detecting this phenomenon is one of the first useful calculations that noisy quantum computers without error correction can perform, a thorough study of the quantum sawtooth map reveals that observing the Lyapunov regime is just beyond the reach of present-day devices. We prove that there are three bounds on the ability of any device to observe the Lyapunov regime and give the first quantitatively accurate description of these bounds: (1) the Fermi golden rule decay rate must be larger than the Lyapunov rate, (2) the quantum dynamics must be diffusive rather than localized, and (3) the initial decay rate must be slow enough for Lyapunov decay to be observable. This last bound, which has not been recognized previously, places a limit on the maximum amount of noise that can be tolerated. The theory implies that an absolute minimum of 6 qubits is required. Recent experiments on IBM-Q and IonQ imply that some combination of a noise reduction by up to 100x per gate and large increases in connectivity and gate parallelization are also necessary. Finally, scaling arguments are given that quantify the ability of future devices to observe the Lyapunov regime based on trade-offs between hardware architecture and performance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Higher-order particle representation for particle-in-cell simulations

In this paper we present an alternative approach to the representation of simulation particles for unstructured electrostatic and electromagnetic PIC simulations. In our modified PIC algorithm we represent particles as having a smooth shape function limited by some specified finite radius, r 0 . A unique feature of our approach is the representation of this shape by surrounding simulation particles with a set of virtual particles with delta shape, with fixed offsets and weights derived from Gaussian quadrature rules and the value of r 0 . As the virtual particles are purely computational, they provide the additional benefit of increasing the arithmetic intensity of traditionally memory bound particle kernels. The modified algorithm is implemented within Sandia National Laboratories' unstructured EMPIRE-PIC code, for electrostatic and electromagnetic simulations, using periodic boundary conditions. We show results for a representative set of benchmark problems, including electron orbit, a transverse electromagnetic wave propagating through a plasma, numerical heating, and a plasma slab expansion. In this work, good error reduction across all of the chosen problems is achieved as the particles are made progressively smoother, with the optimal particle radius appearing to be problem-dependent.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Hadronic light by light contribution to the (g-2){sub {mu}} with holographic models of QCD

We study the anomalous electromagnetic pion form factor F{sub {pi}}{sup 0}{sub {gamma}}{sup *}{sub {gamma}}{sup *} with a set of holographic models. By comparing with the measured value of the linear slope, some of these models can be ruled out. From the remaining models, we obtain predictions for the low-energy quadratic slope parameters of F{sub {pi}}{sup 0}{sub {gamma}}{sup *}{sub {gamma}}{sup *}, currently out of experimental reach but testable in the near future. We find it particularly useful to encode this low-energy information in a form factor able to satisfy also QCD short-distance constraints. We choose the form factor introduced by D'Ambrosio, Isidori, and Portoles in kaon decays, which has the right short distance for a particular value of the quadratic slope, which is later shown to be compatible with our holographic predictions. We then turn to a determination of the (dominant) pion exchange diagram in the hadronic light by light scattering contribution to the muon anomalous magnetic moment. We quantify the theoretical uncertainty in (g-2){sub {mu}} coming from the different input we use: QCD short distances, experimental input, and low-energy holographic predictions. We also test the pion-pole approximation. Our final result is a{sub {mu}}{sup {pi}0}=6.54(25)x10{sup -10}, where the error is driven by the linear slope of F{sub {pi}}{sup 0}{sub {gamma}}{sup *}{sub {gamma}}{sup *}, soon to be measured with precision at KLOE-2. Our numerical analysis also indicates that large values of the magnetic susceptibility {chi}{sub 0} are disfavored, therefore pointing at a mild effect from the pion off-shellness. However, in the absence of stronger bounds on {chi}{sub 0}, an additional (10-15)% systematic uncertainty on the previous value for a{sub {mu}}{sup {pi}0} cannot be excluded.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Exploration of the polarization angle variability of the Crab Nebula with POLARBEAR and its application to the search for axionlike particles

The Crab Nebula, also known as Tau A, is a polarized astronomical source at millimeter wavelengths. It has been used as a stable light source for polarization angle calibration in millimeter-wave astronomy. However, it is known that its intensity and polarization vary as a function of time at a variety of wavelengths. Thus, it is of interest to verify the stability of the millimeter-wave polarization. If detected, polarization variability may be used to better understand the dynamics of Tau A, and for understanding the validity of Tau A as a calibrator. One intriguing application of such observation is to use it for the search of axionlike particles (ALPs). Ultralight ALPs couple to photons through a Chern-Simons term, and induce a temporal oscillation in the polarization angle of linearly polarized sources. After assessing a number of systematic errors and testing for internal consistency, we evaluate the variability of the polarization angle of the Crab Nebula using 2015 and 2016 observations with the 150 GHz P instrument. We place a median 95% upper bound of polarization oscillation amplitude A < 0.06 5 ° over the oscillation frequencies from 0.75 year − 1 to 0.66 hour − 1 . Assuming that no sources other than ALP are causing Tau A’s polarization angle variation, that the ALP constitutes all the dark matter, and that the ALP field is a stochastic Gaussian field, this bound translates into a median 95% upper bound of ALP-photon coupling g a γ γ < 2.16 × 10 − 12 GeV − 1 × ( m a / 10 − 21 eV ) in the mass range from 9.9 × 10 − 23 eV to 7.7 × 10 − 19 eV . This demonstrates that this type of analysis using bright polarized sources is as competitive as those using the polarization of cosmic microwave background in constraining ALPs. Published by the American Physical Society 2024

Adachi, Shunsuke (ORCID:0000000204007555)↗

Pressurizing Hagan and SAVY containers to 30-psig (air) to measure the release of analytical cerium oxide test powder

The need to pressure-test known nuclear material storage containers has been made apparent by the CSE (cognizant systems engineer) assigned to containers at TA-55. The main goal of the current study is to understand the behavior of the SAVY-4000 and Hagan containers during an internal pressurization (30 psig) event. The experiments incorporated a nominal mass of 100 g of CeO 2 (cerium oxide) powder to simulate MAR (material at risk) conditions. For the experimental results with mass losses of 0.0±0.1 g mass loss), using ASME error analysis, there is a total expanded uncertainty in a 95% confidence interval (±0.25 g) for the tested SAVY-4000 and Hagan containers. For purposes of conservatism, this has been rounded upward to yield a bounding value for the damage ratio DR = 0.003 = 0.3%.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Delta Modulation

An optimum adaptive delta modulator-demodulator configuration is derived. This device utilizes two past samples to obtain a step size which minimizes the mean square error for a Markov Gaussian source. The optimum system is compared using computer simulations with the linear delta modulator and an enhanced Abate delta modulator. In addition the performance is compared to the rate distortion bound for a Markov source. It is shown that the optimum delta modulator is neither quantization nor slope-overload limited. The results show that the output signal-to-noise ratio is independent of the input signal power and is subject only to the limitations of the hardware employed. In addition, voice was recorded using these systems. The demodulated voice indicates negligible degradation is caused by the optimum system and by the enhanced Abate system while the linear delta modulator suffers significant degradation at a sampling frequency of 56 kilobits/sec.

Schilling, D. L.↗

New Short Constraint Length, Rate 1/N Convolutional Codes which Minimize Required E Sub B/n Sub o for Given Bit Error Rate

Instead of using the criterion of maximum free distance, (df) or the maximum (df) with minimizing a few first distance profiles, short constraint length rate 1/N convolution codes were searched using a criterion of minimizing required bit energy-to-noise density ratio, E(b)/N(o), for a given value of desired bit error rate (BER), for the goodness of a code. The considered channel was binary antipodal signaling over additive white Gaussian noise and no quantization at the channel output. For the BER calculations, the transfer function bounding technique was used. Partial searches were performed using some known facts and a very useful idea that "good codes generate good codes.'' That is, for a given constraint length K, good rate 1/(N + 1) codes can be found by extending the code generator matrices of good rate 1/N codes. The code search results are tabulated for 3 or = K or = 7 and 2 or = N or = 8. For many pairs of K and N, the new codes are shown to save 0.1 to 0.4 dB in the required E(b)/N(o) compared to previously reported codes. Additionally, the benefits of coding bandwidth expansion are confirmed with the new codes.

Lee, P. J.↗

Statistical plant set estimation using Schroeder-phased multisinusoidal input design

A frequency domain method is developed for plant set estimation. The estimation of a plant 'set' rather than a point estimate is required to support many methods of modern robust control design. The approach here is based on using a Schroeder-phased multisinusoid input design which has the special property of placing input energy only at the discrete frequency points used in the computation. A detailed analysis of the statistical properties of the frequency domain estimator is given, leading to exact expressions for the probability distribution of the estimation error, and many important properties. It is shown that, for any nominal parametric plant estimate, one can use these results to construct an overbound on the additive uncertainty to any prescribed statistical confidence. The 'soft' bound thus obtained can be used to replace 'hard' bounds presently used in many robust control analysis and synthesis methods.

Bayard, D. S.↗

Information storage capacity of discrete spin systems

Understanding the limits imposed on information storage capacity of physical systems is a problem of fundamental and practical importance which bridges physics and information science. There is a well-known upper bound on the amount of information that can be stored reliably in a given volume of discrete spin systems which are supported by gapped local Hamiltonians. However, all the previously known systems were far below this theoretical bound, and it remained open whether there exists a gapped spin system that saturates this bound. Here, we present a construction of spin systems which saturate this theoretical limit asymptotically by borrowing an idea from fractal properties arising in the Sierpinski triangle. Our construction provides not only the best classical error-correcting code which is physically realizable as the energy ground space of gapped frustration-free Hamiltonians, but also a new research avenue for correlated spin phases with fractal spin configurations. -- Highlights: •We propose a spin model with fractal ground states and study its coding properties. •We show that the model asymptotically saturates a theoretical limit on information storage capacity. •We discuss its relations to various theoretical physics problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Robust Sensor Faults Reconstruction for a Class of Uncertain Linear Systems Using a Sliding Mode Observer: An LMI Approach

This paper presents a design method of a Sliding Mode Observer (SMO) for robust sensor faults reconstruction of systems with matched uncertainty. This class of uncertainty requires a known upper bound. The basic idea is to use the H{sub {infinity}} concept to design the observer, which minimizes the effect of the uncertainty on the reconstruction of the sensor faults. Specifically, we applied the equivalent output error injection concept from previous work in Fault Detection and Isolation (FDI) scheme. Then, these two problems of design and reconstruction can be expressed and numerically formulate via Linear Matrix Inequalities (LMIs) optimization. Finally, a numerical example is given to illustrate the validity and the applicability of the proposed approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Learning Many-Body Hamiltonians with Heisenberg-Limited Scaling

Learning a many-body Hamiltonian from its dynamics is a fundamental problem in physics. Here, in this Letter, we propose the first algorithm to achieve the Heisenberg limit for learning an interacting N-qubit local Hamiltonian. After a total evolution time of $\mathscr{O}$⁡(ε –1 ), the proposed algorithm can efficiently estimate any parameter in the N-qubit Hamiltonian to ε error with high probability. Our algorithm uses ideas from quantum simulation to decouple the unknown N-qubit Hamiltonian H into noninteracting patches and learns H using a quantum-enhanced divide-and-conquer approach. The proposed algorithm is robust against state preparation and measurement error, does not require eigenstates or thermal states, and only uses polylog⁡(ε –1 ) experiments. In contrast, the best existing algorithms require $\mathscr{O}$⁡⁡(ε –2 ) experiments and total evolution time. We prove a matching lower bound to establish the asymptotic optimality of our algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A variable-step-size robust delta modulator.

Description of an analytically obtained optimum adaptive delta modulator-demodulator configuration. The device utilizes two past samples to obtain a step size which minimizes the mean square error for a Markov-Gaussian source. The optimum system is compared, using computer simulations, with a linear delta modulator and an enhanced Abate delta modulator. In addition, the performance is compared to the rate distortion bound for a Markov source. It is shown that the optimum delta modulator is neither quantization nor slope-overload limited. The highly nonlinear equations obtained for the optimum transmitter and receiver are approximated by piecewise-linear equations in order to obtain system equations which can be transformed into hardware. The derivation of the experimental system is presented.

Song, C. L.↗

Verification of Numerical Algorithms

The following strategy is suggested for specification and proof: (1) Defer the construction of a formal program specification with respect to I/O assertions unit the correctness of the program with respect to an abstract mathematical model of program intent is demonstrated. (2) Prove that an abstract machine (using infinite precision arithmetic) would compute that object exactly. (3) Prove that the computational sequences of arithmetic operations that occur in the abstract machine must be precisely the same at every step as those occurring on an actual machine (with finite precision arithmetic), executing the same program. (4) Use a Verification Conditions VC-generator that knows about the semantics of arithmetic operations to annotate the program with assertions that bound (or in some circumstances estimate) the difference between the actual machine state variables and the corresponding ones of the abstract machine. Construct the formal program specification by combining the verification conditions into theorems about computational error that can be proved with mechanical assistance.

Source record↗

Use of the VLBI delay observable for orbit determination of Earth-orbiting VLBI satellites

Very long-baseline interferometry (VLBI) observations using a radio telescope in Earth orbit were performed first in the 1980s. Two spacecraft dedicated to VLBI are scheduled for launch in 1995; the primary scientific goals of these missions will be astrophysical in nature. This article addresses the use of space VLBI delay data for the additional purpose of improving the orbit determination of the Earth-orbiting spacecraft. In an idealized case of quasi-simultaneous observations of three radio sources in orthogonal directions, analytical expressions are found for the instantaneous spacecraft position and its error. The typical position error is at least as large as the distance corresponding to the delay measurement accuracy but can be much greater for some geometries. A number of practical considerations, such as system noise and imperfect calibrations, set bounds on the orbit-determination accuracy realistically achievable using space VLBI delay data. These effects limit the spacecraft position accuracy to at least 35 cm (and probably 3 m or more) for the first generation of dedicated space VLBI experiments. Even a 35-cm orbital accuracy would fail to provide global VLBI astrometry as accurate as ground-only VLBI. Recommended charges in future space VLBI missions are unlikely to make space VLBI competitive with ground-only VLBI in global astrometric measurements.

Ulvestad, J. S.↗

Calibration and postlaunch performance of the Meteor 3/TOMS instrument

Prelaunch and postlaunch calibration results for the Meteor 3/total ozone mapping spectrometer (TOMS) instrument are presented here. Ozone amounts are retrieved from measurements of Earth albedo in the 312- to 380-nm range. The accuracy of albedo measurements is primarily tied to knowledge of the reflective properties of diffusers used in the calibrations and to the instrument's wavelength selection. These and other important prelaunch calibrations are presented. Their estimated accuracies are within the bounds necessary to determine column ozone to better than 1%. However, postlaunch validation results indicate some prelaunch calibration uncertainties may be larger than originally estimated. Instrument calibrations have been maintained postlaunch to within a corresponding 1% error in retrieved ozone. Onboard calibrations, including wavelength monitoring and a three-diffuser solar measurement system, are described and specific results are presented. Other issues, such as the effects of orbital precession on calibration and recent chopper wheel malfunctions, are also discussed.

Jaross, G.↗

Precise and Scalable Static Program Analysis of NASA Flight Software

Recent NASA mission failures (e.g., Mars Polar Lander and Mars Orbiter) illustrate the importance of having an efficient verification and validation process for such systems. One software error, as simple as it may be, can cause the loss of an expensive mission, or lead to budget overruns and crunched schedules. Unfortunately, traditional verification methods cannot guarantee the absence of errors in software systems. Therefore, we have developed the CGS static program analysis tool, which can exhaustively analyze large C programs. CGS analyzes the source code and identifies statements in which arrays are accessed out of bounds, or, pointers are used outside the memory region they should address. This paper gives a high-level description of CGS and its theoretical foundations. It also reports on the use of CGS on real NASA software systems used in Mars missions (from Mars PathFinder to Mars Exploration Rover) and on the International Space Station.

Brat, G.↗

Entanglement enhances security in quantum communication

Secret sharing is a protocol in which a 'boss' wants to send a classical message secretly to two 'subordinates', such that none of the subordinates is able to know the message alone, while they can find it if they cooperate. Quantum mechanics is known to allow for such a possibility. We analyze tolerable quantum bit error rates in such secret sharing protocols in the physically relevant case when the eavesdropping is local with respect to the two channels of information transfer from the boss to the two subordinates. We find that using entangled encoding states is advantageous to legitimate users of the protocol. We therefore find that entanglement is useful for secure quantum communication. We also find that bound entangled states with positive partial transpose are not useful as a local eavesdropping resource. Moreover, we provide a criterion for security in secret sharing--a parallel of the Csiszar-Koerner criterion in single-receiver classical cryptography.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mountain-Top-to-Mountain-Top Optical Link Demonstration

A mountain-top-to-mountain-top optical communications demonstration was conducted between the JPL Table Mountain Facility (TMF), Wrightwood, California, and Strawberry Peak (SP), Lake Arrowhead, California, during the months of August and September of 2000. The link was nearly horizontal at an altitude of 2 km and spanned a range of 46.8 km. A 780-nm multibeam beacon broadcast from TMF was received by the JPL Optical Communications Demonstrator (OCD) located at SP. The received beacon was utilized as a pointing reference to retransmit an 852-nm communications laser beam, modulated at 400 Mb/s by a PN7 pseudo-random bit stream (PRBS) sequence. The long atmospheric path resulted in atmospheric-turbulence-induced angle-of-arrival fluctuations of the beacon at the OCD aperture. A .ne-steering control loop was used to track the resulting beacon centroid motion and update the pointing of the communications laser beam transmitted from SP to TMF. Fried parameters, or r0, inferred from focal spot sizes received at SP were 4 to 5 cm whereas, using the spot sizes received at TMF, they were 2 to 3 cm. In both cases, theory predicts larger r0 values. The predicted angle-of-arrival fluctuations compare well with measured rms displacements exhibited by the focal spots at either end of the link. An uncompensated error of ~1.1 rad in the x-axis and ~2 rad in the y-axis was obtained using centroid data logged by the OCD. Average bit-error rates of 10-5 were recorded for extended periods of time. An atmospheric coherence length r0 of 3 to 5 cm was inferred using the focal-plane spot size measured on the CCD tracking sensor and compared to a predicted value of 5 to 7 cm using reasonable atmospheric models. The irradiance bounds required for the CCD tracking sensor to perform centroiding was found to range from 2000 to 3000 integrated pixel counts, although a more reliable range was 600 to 3000, indicating a dynamic range of 6 to 11 dB. The motion of the spot on the focal plane was also recorded and yielded rms angle-of-arrival-induced focal-plane displacement of 9 to 11 m, compared to a predicted value of 7.8 to 11 m. The irradiance measurements made with the OCD clearly indicate that best tracking performance is obtained when the mean received signal is 2000 to 2200 counts. The best tracking performance resulted in an rms uncompensated error of 1.1 rad. The uncompensated error appeared to increase with either an increase or decrease in mean beacon-signal level. The rms uncompensated error determined by deriving the beacon displacement power spectral density from the beacon centroid-versustime data and the rejection function of the control loop yielded a higher value of 3.4 rad.

Biswas, A.↗