Characterizing Electrical Device Behavior with Functional Tolerance Bounds.
Abstract not provided.
Adams, Jason↗
SEARCH · Search NASA
Results for “Tolerance Bounds”
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.
Bounding uncertainty in functional data: A case study
Functional data are fast becoming a preeminent source of information across a wide range of industries. A particularly challenging aspect of functional data is bounding uncertainty. In this unique case study, we present our attempts at creating bounding functions for selected applications at Sandia National Laboratories (SNL). The first attempt involved a simple extension of functional principal component analysis (fPCA) to incorporate covariates. Though this method was straightforward, the extension was plagued by poor coverage accuracy for the bounding curve. This led to a second attempt utilizing elastic methodology which yielded more accurate coverage at the cost of more complexity.
97 MATHEMATICS AND COMPUTING↗
Quantum error correction in the black hole interior
We study the quantum error correction properties of the black hole interior in a toy model for an evaporating black hole: Jackiw-Teitelboim gravity entangled with a non-gravitational bath. After the Page time, the black hole interior degrees of freedom in this system are encoded in the bath Hilbert space. We use the gravitational path integral to show that the interior density matrix is correctable against the action of quantum operations on the bath which (i) do not have prior access to details of the black hole microstates, and (ii) do not have a large, negative coherent information with respect to the maximally mixed state on the bath, with the lower bound controlled by the black hole entropy and code subspace dimension. Thus, the encoding of the black hole interior in the radiation is robust against generic, low-rank quantum operations. For erasure errors, gravity comes within an O (1) distance of saturating the Singleton bound on the tolerance of error correcting codes. For typical errors in the bath to corrupt the interior, they must have a rank that is a large multiple of the bath Hilbert space dimension, with the precise coefficient set by the black hole entropy and code subspace dimension.
2D gravity↗
Peer-to-Peer Communication Trade-Offs for Smart Grid Applications: Preprint
Peer-to-peer energy management systems for smart grids require developers to consider the trade-offs between the amount of communication traffic generated and the quality and speed of convergence of the control algorithms that are deployed. Employing a fully connected communication causes messages to scale exponentially with the number of nodes, while using a sparse connectivity causes less information dissemination leading to degradation of the algorithm performance. The best communication topology for a particular application lies somewhere in between and often requires empirical evaluation by application designers. Existing methods do not put focus on the needs for smart grid applications, which is information dissemination throughout the network and they do not provide a flexible solution for application developers to prototype and deploy different topologies without modifying the application code. This paper introduces a configurable virtual communication topology framework TopLinkMgr, allowing users to specify any chosen communication topology and deploy peer-to-peer applications using it. It also introduces a self-adaptive, fault-tolerant topology management algorithm, Bounded Path Dissemination that can ensure the dissemination of information to all peers within a specified threshold for a sparsely connected topology. Experiments show that the algorithm improves on convergence speed and accuracy over state-of-the-art methods and is also robust against node failures. The results indicate the possibility of achieving a close-to optimal convergence without overloading the network allowing the realization of peer-to-peer control platforms covering larger and more complex power systems.
Bounded Path Dissemination↗
QIP 2023 Poster Abstract: Solving relativistic bound-state problems in QCD with a fault-tolerant quantum computer.
Abstract not provided.
Rhodes, Mason↗
Solving Relativistic Bound-State Problems in QCD with a Fault-Tolerant Quantum Computer
Explore the source record for details and available documents.
Kreshchuk, Michael↗
Benchmarking quantum logic operations relative to thresholds for fault tolerance
Contemporary methods for benchmarking noisy quantum processors typically measure average error rates or process infidelities. However, thresholds for fault-tolerant quantum error correction are given in terms of worst-case error rates—defined via the diamond norm—which can differ from average error rates by orders of magnitude. One method for resolving this discrepancy is to randomize the physical implementation of quantum gates, using techniques like randomized compiling (RC). In this work, we use gate set tomography to perform precision characterization of a set of two-qubit logic gates to study RC on a superconducting quantum processor. We find that, under RC, gate errors are accurately described by a stochastic Pauli noise model without coherent errors, and that spatially correlated coherent errors and non-Markovian errors are strongly suppressed. We further show that the average and worst-case error rates are equal for randomly compiled gates, and measure a maximum worst-case error of 0.0197(3) for our gate set. Our results show that randomized benchmarks are a viable route to both verifying that a quantum processor’s error rates are below a fault-tolerance threshold, and to bounding the failure rates of near-term algorithms, if—and only if—gates are implemented via randomization methods which tailor noise.
97 MATHEMATICS AND COMPUTING↗
Scalable, In-situ Data Clustering Data Analysis for Extreme Scale Scientific Computing (Final Report)
The objective of this project is to address challenges in the design and development of scalable in-situ data clustering and analytics algorithms and software. Our goal is to develop parallel software consisting of a set of spatio-temporal data clustering and anomaly detection functions, both of which are very important for large-scale analysis and have wide applicability for in-situ runs as well as post-processing analysis. Our design principles for in-situ analysis consider the following: (1) identify parts of the computation can be done close to the data within the nodes, while it is still in memory; (2) extract analysis components can (and should) be performed in remote staging and analysis nodes; (3) develop error-bound approximation methods for applications tolerable for small errors; (4) identify the type of derived distributions and statistics, for spatio-temporal data, that can be kept locally in order to both accelerate computations and meet energy constraints in subsequent iterations and phases; (5) use a self-describing data format so that data can be consistent and understood among local storage (memory and SSDs) and at staging and analysis nodes, thereby providing portability and flexibility; (6) develop service-oriented functions that can schedule in-situ and post-hoc analysis tasks based on the dynamic requirements of applications. Our development focus is to produce the parallel data analysis software/library that will be scalable, reusable, extensible, and generic for applications in different disciplines. The software will be able to run in-situ with the simulations as well as post-hoc analysis. This approach will satisfy many synergistic requirements for data intensive applications executed on data coming from instruments and experiments. In particular, the proposed multilevel approach is directly applicable to perform design tradeoffs for running part of the algorithms near the instruments and the rest on remote (analysis) systems.
97 MATHEMATICS AND COMPUTING↗
Optical vortex manipulation for topological quantum computation
Topological quantum computation based on Majorana bound states may enable new paths to fault-tolerant quantum computing. Several recent experiments have suggested that the vortex cores of topological superconductors, such as iron-based superconductors, may host Majorana bound states at zero energy. However, quantum computation with these zero-energy vortex bound states requires precise and fast manipulation of individual vortices, which is difficult to do in a scalable manner. To address this issue, in this study we propose a control scheme based on local heating via, for example, scanning optical microscopy to braid vortex-bound Majorana zero modes in a two-dimensional topological superconductor. First, we derive the conditions required for transporting a single vortex between two defects in the superconducting material by trapping it with a hot spot generated by local optical heating. Equipped with critical conditions for the vortex motion, we then establish the ideal material properties for vortex braiding and describe how transition errors resulting from finite speed and/or temperature can be minimized. Our work paves the way toward optical or microscopic control of zero-energy vortex bound states in two-dimensional topological superconductors.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
JANUS: Resilient and Adaptive Data Transmission for Enabling Timely and Efficient Cross-Facility Scientific Workflows
In modern science, the growing complexity of large-scale scientific projects has led to an increasing reliance on cross-facility scientific workflows, where resources and expertise from multiple institutions and geographic locations are leveraged to accelerate scientific discovery. These workflows often require transmitting huge amounts of scientific data through wide-area networks. Although high-speed networks like ESnet and transfer services such as Globus have improved data mobility, several challenges remain. The sheer volume of data can overwhelm network bandwidth, widely used transport protocols such as TCP suffer from inefficiencies due to retransmissions triggered by packet loss, and existing fault-tolerance mechanisms like erasure coding introduce substantial overhead. In this paper, we propose Janus, a resilient and adaptable data transmission approach designed for cross-facility scientific workflows. Unlike traditional TCP-based methods, Janus leverages UDP, integrates erasure coding for fault tolerance, and combines it with error-bounded lossy compression to reduce overhead. This novel design allows users to balance data transmission time and accuracy, optimizing transfer performance based on specific scientific requirements. Additionally, Janus dynamically adjusts erasure coding parameters in response to real-time network conditions, ensuring efficient data transfers even in fluctuating environments. We develop optimization models for determining ideal configurations and implement adaptive data transfer protocols to enhance reliability. Through extensive simulations and real-network experiments, we demonstrate that Janus significantly improves transfer efficiency while maintaining data fidelity.
Esaulov, Vladislav [Georgia State University, Atla↗
Quantifying the Impacts of Grain-scale Heterogeneity on Mechanical Response
Driven by the exceedingly high computational demands of simulating mechanical response in complex engineered systems with finely resolved finite element models, there is a critical need to optimally reduce the fidelity of such simulations. The minimum required fidelity is constrained by error tolerances on the simulation results, but error bounds are often impossible to obtain a priori. One such source of error is the variability of material properties within a body due to spatially non-uniform processing conditions and inherent stochasticity in material microstructure. This study seeks to quantify the effects of microstructural heterogeneity on component- and system-scale performance to aid in the choice of an appropriate material model and spatial resolution for finite element analysis.
36 MATERIALS SCIENCE↗
Structural and functional characterization of NEMO cleavage by SARS-CoV-2 3CLpro
Abstract In addition to its essential role in viral polyprotein processing, the SARS-CoV-2 3C-like protease (3CLpro) can cleave human immune signaling proteins, like NF-κB Essential Modulator (NEMO) and deregulate the host immune response. Here, in vitro assays show that SARS-CoV-2 3CLpro cleaves NEMO with fine-tuned efficiency. Analysis of the 2.50 Å resolution crystal structure of 3CLpro C145S bound to NEMO 226–234 reveals subsites that tolerate a range of viral and host substrates through main chain hydrogen bonds while also enforcing specificity using side chain hydrogen bonds and hydrophobic contacts. Machine learning- and physics-based computational methods predict that variation in key binding residues of 3CLpro-NEMO helps explain the high fitness of SARS-CoV-2 in humans. We posit that cleavage of NEMO is an important piece of information to be accounted for, in the pathology of COVID-19.
60 APPLIED LIFE SCIENCES↗
Stochastic Error Cancellation in Analog Quantum Simulation
Analog quantum simulation is a promising path towards solving classically intractable problems in many-body physics on near-term quantum devices. However, the presence of noise limits the size of the system and the length of time that can be simulated. In our work, we consider an error model in which the actual Hamiltonian of the simulator differs from the target Hamiltonian we want to simulate by small local perturbations, which are assumed to be random and unbiased. We analyze the error accumulated in observables in this setting and show that, due to stochastic error cancellation, with high probability the error scales as the square root of the number of qubits instead of linearly. We explore the concentration phenomenon of this error as well as its implications for local observables in the thermodynamic limit. Moreover, we show that stochastic error cancellation also manifests in the fidelity between the target state at the end of time-evolution and the actual state we obtain in the presence of noise. This indicates that, to reach a certain fidelity, more noise can be tolerated than implied by the worst-case bound if the noise comes from many statistically independent sources.
Analog quantum simulation↗
Modifying the Asynchronous Jacobi Method for Data Corruption Resilience
Moving scientific computation from high-performance computing (HPC) and cloud computing (CC) environments to devices on the edge, i.e., physically near instruments of interest, has received tremendous interest in recent years. Such edge computing environments can operate on data in situ, offering enticing benefits over data aggregation to HPC and CC facilities that include avoiding costs of transmission, increased data privacy, and real-time data analysis. Because of the inherent unreliability of edge computing environments, new fault-tolerant approaches must be developed before the benefits of edge computing can be realized. Motivated by algorithm-based fault tolerance, a variant of the asynchronous Jacobi (ASJ) method is developed that achieves resilience to data corruption by rejecting solution approximations from neighbor devices according to a bound derived from convergence theory. Numerical results on a two-dimensional Poisson problem show that the new rejection criterion, along with a novel approximation to the shortest path length on which the criterion depends, restores convergence for the ASJ variant in the presence of certain types data corruption. Numerical results are obtained for when the singular values in the analytic bound are approximated. Additional linear systems are also explored, one with a more dense sparsity pattern and one that includes advection. All results indicate that successful resilience to data corruption depends on whether the bound tightens fast enough to reject corrupted data before the iteration evolution deviates significantly from that predicted by the convergence theory defining the bound. This observation generalizes to future work on algorithm-based fault tolerance for other asynchronous algorithms, including upcoming approaches that leverage Krylov subspaces.
97 MATHEMATICS AND COMPUTING↗
An Analysis of the Johnson-Lindenstrauss Lemma with the Bivariate Gamma Distribution
Probabilistic proofs of the Johnson-Lindenstrauss lemma imply that random projection can reduce the dimension of a data set and approximately preserve pairwise distances. If a distance being approximately preserved is called a success, and the complement of this event is called a failure, then such a random projection likely results in no failures. Assuming a Gaussian random projection, the lemma is proved by showing that the no-failure probability is positive using a combination of Bonferroni's inequality and Markov's inequality. This paper modifies this proof in two ways to obtain a greater lower bound on the no-failure probability. First, Bonferroni's inequality is applied to pairs of failures instead of individual failures. Second, since a pair of projection errors has a bivariate gamma distribution, this probability of a pair of successes is bounded using an inequality from [Jensen, 1969]. If n is the number of points to be embedded and μ is the probability of success, then this leads to an increase in the lower bound on the no-failure probability of $\frac{1}{2}$ ($\genfrac{}{}{0pt}{}{n}{2}$) (1- μ ) 2 is ($\genfrac{}{}{0pt}{}{n}{2}$) is even and $\frac{1}{2}$ (($\genfrac{}{}{0pt}{}{n}{2}$)-1) (1- μ ) 2 if ($\genfrac{}{}{0pt}{}{n}{2}$) is odd. For example, if n =10 5 points are to be embedded in k =10 4 dimensions with a tolerance of ϵ=0.1, then the improvement in the lower bound is on the order of 10 -14 . We also show that further improvement is possible if the inequality in [Jensen, 1969] extends to three successes, though we do not have a proof of this result.
96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
Structural insights into protection against a SARS-CoV-2 spike variant by T cell receptor diversity
T cells play a crucial role in combatting SARS-CoV-2 and forming long-term memory responses to this coronavirus. The emergence of SARS-CoV-2 variants that can evade T cell immunity has raised concerns about vaccine efficacy and the risk of reinfection. Some SARS-CoV-2 T cell epitopes elicit clonally restricted CD8 + T cell responses characterized by T cell receptors (TCRs) that lack structural diversity. Mutations in such epitopes can lead to loss of recognition by most T cells specific for that epitope, facilitating viral escape. Here, we studied an HLA-A2–restricted spike protein epitope (RLQ) that elicits CD8 + T cell responses in COVID-19 convalescent patients characterized by highly diverse TCRs. We previously reported the structure of an RLQ-specific TCR (RLQ3) with greatly reduced recognition of the most common natural variant of the RLQ epitope (T1006I). Opposite to RLQ3, TCR RLQ7 recognizes T1006I with even higher functional avidity than the WT epitope. To explain the ability of RLQ7, but not RLQ3, to tolerate the T1006I mutation, we determined structures of RLQ7 bound to RLQ–HLA-A2 and T1006I–HLA-A2. These complexes show that there are multiple structural solutions to recognizing RLQ and thereby generating a clonally diverse T cell response to this epitope that assures protection against viral escape and T cell clonal loss.
60 APPLIED LIFE SCIENCES↗
Lieb-Robinson Bounds with Exponential-in-Volume Tails
Lieb-Robinson bounds demonstrate the emergence of locality in many-body quantum systems. Intuitively, Lieb-Robinson bounds state that, with local or exponentially decaying interactions, the correlation that can be built up between two sites separated by distance 𝑟 after a time 𝑡 decays as exp (𝑣𝑡 −𝑟), where 𝑣 is the emergent Lieb-Robinson velocity. In many problems, it is important to also capture how much of an operator grows to act on 𝑟 𝑑 sites in 𝑑 spatial dimensions. Perturbation theory and cluster expansion methods suggest that, at short times, these volume-filling operators are suppressed as exp (−𝑟 𝑑 ). We confirm this intuition, showing that, for 𝑟 >𝑣𝑡, the volume-filling operator is suppressed by exp (−(𝑟−𝑣𝑡) 𝑑 /(𝑣𝑡) 𝑑−1 ). This closes a conceptual and practical gap between the cluster expansion and the Lieb-Robinson bound. We then present two very different applications of this new bound. Firstly, we obtain improved bounds on the classical computational resources necessary to simulate many-body dynamics with error tolerance 𝜀 for any finite time 𝑡: as 𝜀 becomes sufficiently small, only 𝜀 −O(𝑡 𝑑−1 ) resources are needed. A protocol that likely saturates this bound is given. Secondly, we prove that disorder operators have volume-law suppression near the “solvable (Ising) point” in quantum phases with spontaneous symmetry breaking, which implies a new diagnostic for distinguishing many-body phases of quantum matter.
computational complexity↗
Robustness of Vacancy-Bound Non-Abelian Anyons in the Kitaev Model in a Magnetic Field
Non-Abelian anyons in quantum spin liquids (QSLs) provide a promising route to fault-tolerant topological quantum computation. In the exactly solvable Kitaev honeycomb model, such anyons of the QSL state can be bound to nonmagnetic spin vacancies and endowed with non-Abelian statistics by an infinitesimal magnetic field. Here, we investigate how this approach for stabilizing non-Abelian anyons extends to a finite magnetic field represented by a proper Zeeman term. Through large-scale density-matrix renormalization group simulations, we compute the vacancy-anyon binding energy as a function of magnetic field for both the ferromagnetic and antiferromagnetic Kitaev models. Here, we find that anyon binding remains robust within the entire QSL phase for the ferromagnetic Kitaev model but breaks down already inside this phase for the antiferromagnetic Kitaev model. To compute a binding energy several orders of magnitude below the magnetic energy scale, we introduce both a refined definition and an extrapolation scheme based on carefully tailored perturbations.
Xiao, Bo [Oak Ridge National Laboratory (ORNL), Oa↗