Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Information Theory”

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 235 records · Page 13

A Polynomial-Time Classical Algorithm for Noisy Quantum Circuits

We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g., the computational basis). Our approach is based upon the intuition that noise exponentially damps nonlocal correlations relative to local correlations. This enables one to classically simulate a noisy quantum circuit by keeping track of only the dynamics of local quantum information. Our algorithm also enables sampling from the output distribution of a circuit in quasipolynomial time, so long as the distribution anticoncentrates. A number of implications are discussed, including a fundamental limit on the efficacy of noise mitigation strategies: For constant noise rates, any quantum circuit for which error mitigation succeeds in polynomial-time on most input states can also be classically simulated in polynomial-time on most input states. Our algorithms scale exponentially in the inverse noise rate, which is fundamental and makes them impractical for current quantum devices.

decoherence↗

Ultra-Wideband Communications: Interference Challenges and Solutions

The idea of ultra-wideband (UWB) communications for short ranges (up to a few tens of meters) has been around for nearly three decades. However, despite significant efforts by the industry, UWB deployment has not yet reached its predicted potential. This article, thus, seeks to rectify this situation by providing a practical examination of UWB interference conditions. Through a spectrum survey of today's wireless environments, we explore the interference that UWB devices may face from a perspective of outage probability in both high- and low-rate configurations. We find that by suppressing interference, the outage probability can be reduced by one or more orders of magnitude. In the non-line-of-sight channels, in particular, we find that both interference suppression and bandwidth expansion are required to support the minimum data rates suggested in the IEEE802.15.4 series of standards. Here, we connect these findings to a recently proposed UWB signaling method based on filter banks and show this method fulfills the above requirements for implementing effective UWB systems.

99 - GENERAL AND MISCELLANEOUS↗

cabbi-bio/BECT-ABM

The emergence of the cellulosic bioeconomy requires not only adequate technological, economic, and policy advances, but also effective communication and coordination among the multiple stakeholders in the bioeconomy community. Aiming to facilitate stakeholder communication and collaboration for cellulosic bioeconomy growth, an agent-based model is developed as a community communication tool in this study. The tool simulates the behaviors and interactions of key stakeholders, as well as the responses and interactions between the stakeholders and biophysical, socioeconomic, and environmental conditions. The agent behavior rules are developed and validated based on behavior and economic theories and information attained from a stakeholder focus group study and a land use survey.

Yang, Pan↗

Variable Precision Computing (VPC) (Final Report)

The overall goal of the Variable Precision Computing project is exploring and identifying ways to reduce internodal communication cost in production physics simulation experiments running on a distributed-memory systems by compressing data, either in a lossy or lossless way, thus resulting in a significant computational performance increase. Among the several approaches proposed, the one discussed here has been proposed, designed and implemented by me. It concerns the application of information theory-derived metrics to classical molecular dynamics and computational fluid dynamics simulation experiments.

97 MATHEMATICS AND COMPUTING↗

Fundamental aspects of Spacetime and Quantum Fields

The proposal contained two goals: firstly, placing fundamental bound on thermalization in Quantum Field Theories (QFTs) and, secondly, developing our understanding of emergent spacetime from matrices through concrete models. Since the previous reporting period, in collaboration with Sean Hartnoll we have continued our study of entanglement edge modes in matrix quantum mechanics (MQM). This has resulted in two papers. The first applies our construction for the Matrix Quantum Hall system first to fuzzy sphere states known to correspond to stringy M2-branes in MQM. Entanglement in these states using machine learning methods have also been studied by Sean Hartnoll and Xizhi Han in previous work done under this grant. Our construction builds on this work, and further demonstrates how area laws on fuzzy geometries emerge from strongly coupled systems. The second paper generalizes this construction to all noncommutative geometries with curvature much larger than the noncommutativity parameter. We demonstrate that despite UV/IR mixing effects, the structure of entanglement edge mode irreducible representations is determined by the boundary area of subsystems. On manifolds without global symmetries, we have demonstrated that nonlocal effects inherent to noncommutative geometries resum into a change of frame of the metric structure, similar to the change from string frame to Einstein frame for entanglement entropies calculated in string theory. These advancements lay the groundwork for future progress in the understanding of emergent geometry from large-N theories. Using these techniques, we are currently working on applying our methods to noncom mutative geometries whose construction is not so well understood, such as the fuzzy 5-sphere. Despite their opacity these objects are quite important, as string physics in the bulk of holographic systems bears many features of noncommutative geometry. We have also laid the groundwork of applying our methods to tensor networks, one of the most powerful models for understanding how geometry emerges from entanglement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Need for a System Science Approach to Global Magnetospheric Models

This perspective advocates for the need of a combined system science approach to global magnetospheric models and to spacecraft magnetospheric data to answer the question “Do simulations behave in the same manner as the magnetosphere does?” (instead of the standard validation question “How well do simulations reproduce spacecraft data?”). This approach will 1) validate global magnetospheric models statistically, without the need for a direct comparison against spacecraft data, 2) expose the deficiencies of the models, and 3) provide physics support to the system analysis performed on the magnetospheric system.

79 ASTRONOMY AND ASTROPHYSICS↗

Diffusion Codes: Self-Correction from Small(er)-Set Expansion with Tunable Non-locality

Optimal constructions of classical LDPC codes can be obtained by choosing the Tanner graph uniformly at random among biregular graphs. We introduce a class of codes that we call ``diffusion codes'', defined by placing each edge connecting bits and checks on some graph, and acting on that graph with a random SWAP network. By tuning the depth of the SWAP network, we can tune a tradeoff between the amount of randomness -- and hence the optimality of code parameters -- and locality with respect to the underlying graph. For diffusion codes defined on the cycle graph, if the SWAP network has depth $\sim Tn$ with $T> n^{2β}$ for arbitrary $β>0$, then we prove that almost surely the Tanner graph is a lossless ``smaller set'' vertex expander for small sets up size $δ\sim \sqrt T \sim n^β$, with bounded bit and check degree. At the same time, the geometric size of the largest stabilizer is bounded by $\sqrt T$ in graph distance. We argue, based on physical intuition, that this result should hold more generally on arbitrary graphs. By taking hypergraph products of these classical codes we obtain quantum LDPC codes defined on the torus with smaller-set boundary and co-boundary expansion and the same expansion/locality tradeoffs as for the classical codes. These codes are self-correcting and admit single-shot decoding, while having the geometric size of the stabilizer growing as an arbitrarily small power law. Our proof technique establishes mixing of a random SWAP network on small subsystems at times scaling with only the subsystem size, which may be of independent interest.

Combinatorics (math.CO)↗

AI-Science for Performance Optimization and Diagnosis of Science Instrument Federations

Next generation of science workflows are expected to be executed over complex federations composed of supercomputers, science instruments, storage systems and networks, with new additions of the edge and cloud systems and services. The sheer complexity of these multi-domain federations makes it hard to manage them and optimize their performance, as small impedance mismatches (that can dynamically develop between systems) could drastically degrade the entire federation performance. Recent proliferation of Software Defined Everything (SDX) technologies combined with containerization frameworks provide custom instruments that can monitor and collect critical measurements at various levels to support diagnoses and performance optimization; but their data too enormous for human operators and analysts to process and generate decisions. Machine Learning (ML) methods that extract critical parameters, relationships and trends from the data offer general solutions. Artificial Intelligence (AI) and ML methods must be custom-developed for these problems based on solid, rigorous foundations, since black-box approaches are often ineffective and unsound.We propose to develop comprehensive AI-Science for the performance of science federations to (i) monitor and control storage, networks, experiments, and computing systems across multiple domains via softwarization layers, at speeds and scales orders of magnitude superior to current practice, (ii) optimally realize and orchestrate complex workflows with high performance by using dynamic state and performance estimation methods, and (iii) aggregate measurements across sites and time to develop infrastructure-level profiles, optimizations and diagnoses using AI-Science based on foundational principles from ML, game theory, and information fusion areas.

Rao, Nageswara↗

Security Analysis of a Class of Spread Spectrum Systems Presentation

A method of adding physical layer security to a class of spread spectrum systems has been recently proposed. In this paper, we look into the rate at which an eavesdropper may gain information about the system to decipher the data symbols. The Shannon mutual information is used to measure the rate of information that may be gained by an eavesdropper. The k-nearest neighbors (k-NN) method is used to obtain estimates of relevant entropy values, which will then be used to quantify the rate of information recovery as more data is transmitted. It turns out that such information recovery requires the adoption of special methods that avoid any destructive bias in the estimates. Details of these methods are also presented.

97 - MATHEMATICS AND COMPUTING↗

Security Analysis of a Class of Secured Spread Spectrum Systems

Abstract—A method of adding physical layer security to a class of spread spectrum systems has been recently proposed. In this paper, we look into the rate at which an eavesdropper may gain information about the system to decipher the data symbols. The Shannon mutual information is used to measure the rate of information that may be gained by an eavesdropper. The k-nearest neighbors (k-NN) method is used to obtain the estimates of relevant entropy values which will be then used to quantify the rate of information recovery as more data are being transmitted. It turns out that such information recovery requires adoption of special methods that avoid any destructive bias in the estimates. Details of these methods are also presented.

97 - MATHEMATICS AND COMPUTING↗

Holographic scattering requires a connected entanglement wedge

In AdS/CFT, there can exist local 2-to-2 bulk scattering processes even when local scattering is not possible on the boundary; these have previously been studied in con- nection with boundary correlation functions. We show that boundary regions associated with these scattering configurations must have O(1/G N ) mutual information, and hence a connected entanglement wedge. One of us previously argued for this statement from the boundary theory using operational tools in quantum information theory. We improve that argument to make it robust to small errors and provide a proof in the bulk using focusing arguments in general relativity. We also provide a direct link to entanglement wedge reconstruction by showing that the bulk scattering region must lie inside the con- nected entanglement wedge. Our construction implies the existence of nonlocal quantum computation protocols that are exponentially more efficient than the optimal protocols currently known.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An overview of the operation architectures and energy management system for multiple microgrid clusters

The emerging novel energy infrastructures, such as energy communities, smart building-based microgrids, electric vehicles enabled mobile energy storage units raise the requirements for a more interconnective and interoperable energy system. It leads to a transition from simple and isolated microgrids to relatively large-scale and complex interconnected microgrid systems named multi-microgrid clusters. In order to efficiently, optimally, and flexibly control multi-microgrid clusters, cross-disciplinary technologies such as power electronics, control theory, optimization algorithms, information and communication technologies, cyber-physical, and big-data analysis are needed. This paper introduces an overview of the relevant aspects for multi-microgrids, including the outstanding features, architectures, typical applications, existing control mechanisms, as well as the challenges.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Speed of quantum information spreading in chaotic systems

In this work, we present a general theory of quantum information propagation in chaotic quantum many-body systems. The generic expectation in such systems is that quantum information does not propagate in localized form; instead, it tends to spread out and scramble into a form that is inaccessible to local measurements. To characterize this spreading, we define an information speed via a quench-type experiment and derive a general formula for it as a function of the entanglement density of the initial state. As the entanglement density varies from zero to one, the information speed varies from the entanglement speed to the butterfly speed. We verify that the formula holds both for a quantum chaotic spin chain and in field theories with an AdS/CFT gravity dual. For the second case, we study in detail the dynamics of entanglement in two-sided Vaidya-AdS-Reissner-Nordstrom black branes. We also show that, with an appropriate decoding process, quantum information can be construed as moving at the information speed, and, in the case of AdS/CFT, we show that a locally detectable signal propagates at the information speed in a spatially local variant of the traversable wormhole setup.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Information-theoretic astrophysical uncertainties in the effective theory of dark matter direct detection

The impact of astrophysical uncertainties in direct detection searches can vary significantly across particle dark matter models and detector targets, due to the different velocity and momentum dependencies of the scattering cross section. We address these uncertainties for all operators of the nonrelativistic effective field theory of dark-matter/nucleon interactions, making use of the Kullback-Leibler (KL) information divergence to measure the deviation of the true dark matter velocity distribution from the Maxwell-Boltzmann form. This approach quantifies how astrophysical uncertainties affect each operator in the effective theory, without assuming any specific functional form for the velocity distribution. While for some operators the uncertainties are smaller than 1 order of magnitude for entropically motivated deviations from the Maxwell-Boltzmann form, for other operators, these uncertainties can be as large as three orders of magnitude near threshold. Furthermore, we identify the dependence of the scattering rate for various operators of the effective theory with different velocity-weighted moments of the velocity distribution, functionally analogous to the mean, variance, or skewness. This provides new analytic insight into which features of the velocity distribution are most relevant to detect a given particle dark matter model. Our technique is general and could be applied to a broader class of physics problems where a physical observable depends on the statistical moments of an uncertain theoretical distribution.

Herrera, Gonzalo [MIT, MKI; Harvard U.; Virginia T↗

Parsimonious Inference Information-Theoretic Foundations for a Complete Theory of Machine Learning (CIS-LDRD Project 218313 Final Technical Report)

This work examines how we may cast machine learning within a complete Bayesian framework to quantify and suppress explanatory complexity from first principles. Our investigation into both the philosophy and mathematics of rational belief leads us to emphasize the critical role of Bayesian inference in learning well-justified predictions within a rigorous and complete extended logic. The Bayesian framework allows us to coherently account for evidence in the learned plausibility of potential explanations. As an extended logic, the Bayesian paradigm regards probability as a notion of degrees of truth. In order to satisfy critical properties of probability as a coherent measure, as well as maintain consistency with binary propositional logic, we arrive at Bayes' Theorem as the only justifiable mechanism to update our beliefs to account for empiracle evidence. Yet, in the machine learning paradigm, where explanations are unconstrained algorithmic abstractions, we arrive at a critical challenge: Bayesian inference requires prior belief. Conventional approaches fail to yield a consistent framework in which we could compare prior plausibility among the infinities of potential choices in learning architectures. The difficulty of articulating well-justified prior belief over abstract models is the provinence of memorization in traditional machine learning training practices. This becomes exceptionally problematic in the context of limited datasets, when we wish to learn justifiable predictions from only a small amount of data.

97 MATHEMATICS AND COMPUTING↗

Information and Statistics in Nuclear Experiment and Theory (ISNET)

As with all empirical sciences, nuclear physics operates in the virtuous cycle of the scientific method: observations inspire theoretical models; models lead to new predictions; predictions are tested in experiments; experiments lead to new observations; and so on. Evaluating what we are inferring, and how certain we are of it, is key to this process. These requirements, and a general interest in applying novel statistical, mathematical, and computational techniques, led to the formation of a dedicated research community entitled “Information and Statistics in Nuclear Experiment and Theory (ISNET)” (https://isnet-series.github.io/), which now includes more than 300 members. While the community’s interests lean toward nuclear theory, the unifying theme for this group is the inference of knowledge from data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

AEOLUS: Advances in Experimental Design, Optimal Control, and Learning for Uncertain Complex Systems

Sustained advances in the mathematics of modeling and simulation have resulted in the capability today for routine simulation of a number of large scale complex DOE-relevant systems. As remarkable as this capability for solving the so-called forward problem is, it is typically only the first step-an inner loop within an outer loop that explores the simulation model's parameter space and decision space to characterize uncertainty in the model's predictions, learn unknown model parameters from data, design the most informative experiments, determine optimal control strategies, and create optimal designs. Broadly, what unifies all of these outer loop problems is that they are, in one form or another, optimization problems over parameter/control/design space that are constrained by complex uncertain models. To fully realize the power of scientific simulation as a basis for scientific discovery, technological innovation, and rational decision-making, it is imperative to move beyond simulation to tackle the outer loop of optimization for learning from data, experimental design, and control with complex uncertain models. When the models under consideration are large-scale and complex, and when the optimization variable and uncertain parameter spaces are high (or infinite) dimensional, this constitutes a grand challenge of the highest order, and is intractable with conventional methods. To overcome these challenges, the AEOLUS Center was established to develop a unified mathematical, computational, and statistical framework for (1) Learning predictive models from complex data via Bayesian inference and optimization, and (2) Optimizing experiments, processes, and designs using the resulting uncertain models. These problems are intractable with conventional methods, for several reasons: (1) The simulation problems that govern the inner loops of the optimization problems are expensive to execute (due to severe nonlinearity, heterogeneity, multiphysics/multiscale coupling); (2) The optimization variable and uncertain parameter spaces are high dimensional, often stemming from discretizations of infinite dimensional fields such as initial conditions, sources, or material properties. We argue that the key to overcoming these challenges is to develop new mathematical, computational, and statistical methods that exploit the structure of the Bayesian inference and optimization problems mediated by their underlying complex uncertain models. This structure includes the regularity, sparsity, geometry, low intrinsic dimensionality, and multifidelity nature of the maps from uncertain parameter/optimization variable spaces to the specific objectives targeted: Bayesian inference, optimal experimental design, and optimal control design. Black box methods developed as generic tools are incapable of exploiting this structure. To be successful, we must create, integrate, and cross-fertilize ideas across multiple areas of applied math--including approximation theory, Bayesian inference, data science, experimental design, information theory, machine learning, model reduction, optimal control theory, parallel algorithms, PDE-constrained optimization, randomized algorithms, stochastic optimization, and uncertainty quantification--all while exploiting the structure of the problems at hand. With this goal in mind, we have marshaled a team of leading authorities in these areas. While the methods we develop will be broadly applicable across a wide spectrum of DOE problems in which experiments inform models and the systems those models describe must be optimized under uncertainty, we have chosen a specific area, advanced manufacturing and materials, to drive our work. AMM is characterized by complex models across multiple scales, and is a rich source of challenging problems in inference, experimental design, and optimal control, requiring multifaceted and integrated advances in applied mathematics. As such, AMM serves as an excellent vehicle to motivate and demonstrate the advances in applied mathematics developed by our center.

97 MATHEMATICS AND COMPUTING↗