Search NASA⌕ Search

SEARCH · Search NASA

Results for “Stochastic System”

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 127 records · Page 7

Effective Action for Relativistic Hydrodynamics from the Crooks Fluctuation Theorem

A new effective theory framework for fluctuating hydrodynamics in the relativistic regime is derived using standard thermodynamical principles and general properties of nonequilibrium stochastic dynamics. For the first time, we establish clear and concise conditions for ensuring that the resulting effective theories are causal, stable, and well-posed within general relativity. Here, these properties are independent of spacetime foliation and are valid in the full nonlinear regime. Out-of-equilibrium fluctuations are constrained by a relativistically covariant version of the Crooks fluctuation theorem, which determines how the entropy production is distributed even when the system is driven by an external force. This leads to an emerging Z 2 symmetry responsible for imposing fluctuation-dissipation relations for n-point correlation functions, which matches the standard constraints for the Schwinger-Keldysh effective action.

Fluctuation theorems↗

Dynamics of phage-host interactions in Bacteroides fragilis resolved by single-cell transcriptomics

The interactions between lytic phages and their hosts are typically studied in bulk culture, which obscures cell-cell differences in infection susceptibility or expression of protective factors. Here, we use bacterial single-cell RNA sequencing to profile the transcriptomes of ~50,000 cells from cultures of a human pathobiont, Bacteroides fragilis, infected with a lytic bacteriophage. From a single sampling, we quantified the asynchronous progression of phage infection in individual bacterial cells and reconstructed the infection timeline, characterizing both host and phage transcriptomic changes as infection unfolded. Further, we discovered phenotypic subpopulations of bacteria that remained uninfected. Each cell’s vulnerability to phage infection was influenced by expression of multiple genetic loci, most prominently phase-variable capsular polysaccharide (CPS) biosynthesis pathways and an operon predicted to encode fimbrial genes. These findings uncovered genome-wide phase variation and stochasticity that enable bacterial survival and re-growth without acquiring additional mutations. Overall, we establish bacterial single-cell RNA sequencing as a powerful platform for investigating the dynamics of host-phage interactions and revealing the roles of phase variation and stochasticity in bacterial defenses.

Bacteria↗

Neuromorphic heat transport effects in a molecular junction

Understanding energy transport at the nanoscale is an open and fundamental challenge in the molecular sciences with direct implications for the design of new electronics, computing devices, and materials. While nanoscale energy transport under steady-state conditions has been studied extensively, there is much less known about energy transport under time-dependent driving forces, particularly in the far-from-equilibrium regime. In this work, we use nonequilibrium molecular dynamics simulations and stochastic thermodynamics to investigate energy transport in a well-studied nanoscale system—a molecular junction—subjected to a time-periodic temperature gradient. The primary observation is that molecular junctions can exhibit heat transport hysteresis, a phenomenon in which the heat flux through a system depends not only on the instantaneous value of a time-dependent temperature bias but also on the temporal history of that bias. The presented findings illustrate that molecular junctions can exhibit the specific memory effect—heat transport hysteresis—that is essential for the design of thermal neuromorphic computers. This work elucidates a potential pathway toward the realization of such devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Noise-canceling quantum feedback: Non-Hermitian dynamics with applications to state preparation and magic state distillation

Time-continuous quantum measurement allows for the tracking of a quantum system in real time via sequences of short, and individually weak, measurement intervals. Such measurements are necessarily invasive, imparting backaction to the system, and allowing the observer to update their state estimate based on stochastic measurement outcomes. Feedback control then involves real-time interventions by an observer, conditioned on the time-continuous measurement signal that they receive. Here, we consider here diffusive quantum trajectories and focus on the “noise-canceling” subset of feedback protocols that aim to minimize the degree of stochasticity in the dynamics. We derive such a class of feedback operations, showing that under the idealized assumptions of pure states, unit measurement efficiency, and zero time delay in implementing feedback operations, perfectly noise-canceling feedback always exists. We consider the resulting noise-canceled dynamics generated by an effective non-Hermitian Hamiltonian; while non-Hermitian Hamiltonians from continuous monitoring generally describe rare dynamics (accessible by costly postselection), the use of noise-canceling feedback here leads to non-Hermitian dynamics that occur deterministically. We demonstrate this via examples of entangled state preparation and stabilization. We then illustrate the potential for the application of noise cancellation to boost success rates in magic state distillation protocols. We show that adding feedback based on noise cancellation into a time-continuous five-to-one distillation protocol leads to higher probabilities of successful distillation across a range of input errors and increases the threshold on input errors for which the protocol is effective. Our results highlight the efficacy of noise-canceling feedback-aided protocols for quantum state preparation and stabilization tasks.

Karmakar, Tathagata [University of California, Ber↗

Effective description of ajar systems with a 𝑈⁡(1) symmetry

We introduce the concept of “ajar systems” as an intermediate case between closed and open systems, where the time scale for charge exchange with the environment is parametrically larger than all other characteristic time scales. The Schwinger-Keldysh effective action for such finite-temperature systems exhibits a symmetry group G 1 × G 2 weakly broken to its diagonal subgroup G diag , which we systematically describe using spurion techniques. For G = U(1), we calculate leading-order corrections to correlation functions in both diffusive and spontaneously broken phases. Unlike systems with approximate symmetries where both real and imaginary parts of dispersion relations receive corrections, ajar systems modify only the imaginary part—preserving gapless modes while adding finite damping.

Effective field theory↗

Saturation and Recurrence of Quantum Complexity in Random Local Quantum Dynamics

Quantum complexity is a measure of the minimal number of elementary operations required to approximately prepare a given state or unitary channel. Recently, this concept has found applications beyond quantum computing—in studying the dynamics of quantum many-body systems and the long-time properties of anti–de Sitter black holes. In this context, Brown and Susskind [] conjectured that the complexity of a chaotic quantum system grows linearly in time up to times exponential in the system size, saturating at a maximal value, and remaining maximally complex until undergoing recurrences at doubly exponential times. In this work, we prove the saturation and recurrence of complexity in two models of chaotic time evolutions based on (i) random local quantum circuits and (ii) stochastic local Hamiltonian evolution. Our results advance an understanding of the long-time behavior of chaotic quantum systems and could shed light on the physics of black-hole interiors. From a technical perspective, our results are based on establishing new quantitative connections between the Haar measure and high-degree approximate designs, as well as the fact that random quantum circuits of sufficiently high depth converge to approximate designs. Published by the American Physical Society 2024

Oszmaniec, Michał (ORCID:0000000249466835)↗

Scaling kinetic Monte-Carlo simulations of grain growth with combined convolutional and graph neural networks

Graph neural networks (GNN) have emerged as a promising machine learning method for microstructure simulations such as grain growth. However, accurate modeling of realistic grain boundary networks requires large simulation cells, which GNN has difficulty scaling up to. To alleviate the computational costs and memory footprint of GNN, we suggest a hybrid architecture combining a convolutional neural network (CNN) based bijective autoencoder to compress the spatial dimensions, and a GNN that evolves the microstructure in the latent space of reduced spatial sizes. Our results demonstrate that the new design significantly reduces computational costs with using fewer message passing layer (from 12 down to 3) compared with GNN alone. The reduction in computational cost becomes more pronounced as the spatial size increases, indicating strong computational scalability. For the largest mesh evaluated (160 3 ), our method reduces memory usage and runtime in inference by 117× and 115×, respectively, compared with GNN-only baseline. More importantly, it shows higher accuracy and stronger spatiotemporal capability than the GNN-only baseline, especially in long-term testing. Such combination of scalability and accuracy is essential for simulating realistic material microstructures over extended time scales. The improvements can be attributed to the bijective autoencoder’s ability to compress information losslessly from spatial domain into a high dimensional feature space, thereby producing more expressive latent features for the GNN to learn from, while also contributing its own spatiotemporal modeling capability. Training data are generated from stochastic grain growth simulations, providing realistic variability for learning robust microstructure evolution. Comprehensive system validation confirms that the model is accurate, robust, and scalable.

36 MATERIALS SCIENCE↗

Optimizing Power Line Undergrounding Decisions under Varying Wildfire Risk and Weather Scenarios

Abstract—The threat of wildfire ignitions from electric power equipment has led utilities to increasingly turn to preemptive power shutoffs, which, while effective in reducing grid-induced wildfire risk, can cause significant load loss. Undergrounding power lines is an alternative strategy for preventing grid-induced wildfires. However, undergrounding lines is costly, so an efficient undergrounding plan must balance reductions in wildfire risk and load loss with the cost of undergrounding lines. We propose a robust optimization model to identify which power lines to underground to maximize load served while limiting wildfire risk across a range of wildfire risk and weather scenarios. Since solving this problem may be computationally heavy for large power grids and many operating scenarios, we present a delayed constraint generation algorithm to iteratively add scenarios until an optimal solution is found. We evaluate the performance of this framework on the RTS-GMLC with scenarios representing a year of operating conditions and compare it with a stochastic programming formulation. Our results indicate that our undergrounding model is successful in reducing load shed and risk compared to baseline cases in which no mitigation action is taken and only power shutoffs are implemented (no undergrounding). The robust formulation also reduces more load shed than the stochastic formulation in the most extreme scenarios. Index Terms—grid resilience, optimization, transmission systems, underground power lines, wildfire risk.

Taylor, S. [Department of Electrical and Computer ↗

Identifying Hydropower Operational Flexibilities in Presence of Streamflow and Net-load Uncertainty (Final Technical report)

In the existing operations, hydropower contributions to future system flexibility are generally modeled while maintaining traditional operating rules and constraints in supporting grid operation, such as the balancing of variable renewable energy production. Moreover, operation of large scale hydropower systems on major rivers has been investigated for decades, utilizing various systems engineering approaches, with the evolving electric grid, as the result of renewable resources integration, compounded by the changing climate (variability of river flows, intensification of hydrologic cycle resulting in more frequent extreme events) affecting water availability, the need for more advanced stochastic modeling and effective uncertainty analysis approaches have become necessary. The research results supported by this funding and presented in this report provide a new look at hydropower operational flexibility enforced by the changes identified above. Understanding how hydropower operates in response to the underlying uncertainties with respect to the system constraints is crucial in identifying its operational flexibility potentials. In this project, the flexibility of the operating hydropower facility is described by capturing uncertainties in both water and power system and formulating the operations as a multistage stochastic optimization problem. The proposed approach supports short- to seasonal-term operations and planning decision horizons.

13 HYDRO ENERGY↗

Binary Quantum Control Optimization with Uncertain Hamiltonians

Optimizing the controls of quantum systems plays a crucial role in advancing quantum technologies. The time-varying noises in quantum systems and the widespread use of inhomogeneous quantum ensembles raise the need for high-quality quantum controls under uncertainties. In this paper, we consider a stochastic discrete optimization formulation of a discretized binary optimal quantum control problem involving Hamiltonians with predictable uncertainties. We propose a sample-based reformulation that optimizes both risk-neutral and risk-averse measurements of control policies, and solve these with two gradient-based algorithms using sum-up-rounding approaches. Furthermore, we discuss the differentiability of the objective function and prove upper bounds of the gaps between the optimal solutions to binary control problems and their continuous relaxations. We conduct numerical simulations on various sized problem instances based on two applications of quantum pulse optimization; we evaluate different strategies to mitigate the impact of uncertainties in quantum systems. In conclusion, we demonstrate that the controls of our stochastic optimization model achieve significantly higher quality and robustness compared with the controls of a deterministic model.

conditional value-at-risk (CVaR)↗

Noise-aware circuit compilations for a continuously parameterized two-qubit gateset

State-of-the-art noisy-intermediate-scale quantum processors are currently implemented across a variety of hardware platforms, each with their own distinct gatesets. As such, circuit compilation should not only be aware of but also deeply connect to the native gateset and noise properties of each. Trapped-ion processors are one such platform that provides a gateset that can be continuously parameterized across both one- and two-qubit gates. Here we use the Quantum Scientific Computing Open User Testbed to study noise-aware compilations focused on continuously parameterized two-qubit 𝑍⁢𝑍 gates (based on the Mølmer-Sørensen interaction) using $\scriptsize{SUPERSTAQ}$, a quantum software platform for hardware-aware circuit compiler optimizations. We discuss the realization of 𝑍⁢𝑍 gates with arbitrary angle on the all-to-all connected trapped-ion system. Then we discuss a variety of different compiler optimizations that innately target these 𝑍⁢𝑍 gates and their noise properties. These optimizations include moving from a restricted maximally entangling gateset to a continuously parameterized one, swap mirroring to further reduce the total entangling angle of the operations, focusing the heaviest 𝑍⁢𝑍 angle participation on the best-performing gate pairs, and circuit approximation to remove the least impactful 𝑍⁢𝑍 gates. We demonstrate these compilation approaches on the hardware with randomized quantum volume circuits, observing the potential to realize a larger quantum volume as a result of these optimizations. Using differing yet complementary analysis techniques, we observe the distinct improvements in system performance provided by these noise-aware compilations and study the role of stochastic and coherent error channels for each compilation choice.

Noise↗

GRACE Final Technical Report

The GRACE project (Grid that is Risk-Aware for Clean Electricity) was a five-year research initiative funded by the U.S. Department of Energy's Advanced Research Projects Agency- Energy (ARPA-E) under the PERFORM program. Led by Duke University's Nicholas School of the Environment, with contributions from The Ohio State University, North Carolina State University, Dartmouth College, and Pacific Northwest National Laboratory, the project addressed a fundamental challenge in grid management: conventional software plans for a single most-likely outcome and relies on reserves as a buffer, leaving utilities poorly equipped for the growing variability introduced by renewable energy. GRACE demonstrated a better approach: explicitly representing thousands of plausible future scenarios and choosing operating schedules that perform well across all of them.

14 SOLAR ENERGY↗

Demonstration of Optimal Benchmark Selection Website and Validation of the q c Coverage Metric Using HEU-SOL-THERM-013-003 Experiment

In the work documented in this interim report, the experiment selection toolkit web site was demonstrated and q C coverage metric methodology was validated for IEU-MET-FAST-002-001, MIX-COMP-THERM 004-004, and HEU-SOL-THERM-013-003 experiments. 𝑞 𝐶 is an information-theoretic measure based on mutual information that quantifies the ability of candidate benchmark experiments to reduce the bias and uncertainty of a target criticality safety application. The metric and an accompanying open-source Python toolkit with a web-based interface were tested against a benchmark set of 425 experiments drawn from the International Criticality Safety Benchmark Evaluation Project Handbook. The interface is hosted at https://edim.covdef.com. It accepts sensitivity data files produced by the TSUNAMI-IP module of the SCALE code system and supports both (i) deterministic analysis using the ENDF/B-VII.0 covariance library and (ii) stochastic analysis based on user-supplied keff samples. Demonstrations on representative applications across a range of material composition, spectrum, and form show that q C -guided benchmark selection achieves greater uncertainty reduction with fewer experiments and yields more stable posterior bias and uncertainty estimates than traditional similarity coefficient ( c k )–based selection, while also capturing valuable low-ck experiments that one-to-one metrics overlook.

Abdel-khalik, Hany S. [Indiana Univ.-Purdue Univ. ↗

Simulating Open Quantum Systems Using Hamiltonian Simulations

We present a novel method to simulate the Lindblad equation, drawing on the relationship between Lindblad dynamics, stochastic differential equations, and Hamiltonian simulations. We derive a sequence of unitary dynamics in an enlarged Hilbert space that can approximate the Lindblad dynamics up to an arbitrarily high order. This unitary representation can then be simulated using a quantum circuit that involves only Hamiltonian simulation and tracing out the ancilla qubits. There is no need for additional postselection in measurement outcomes, ensuring a success probability of one at each stage. Our method can be directly generalized to the time-dependent setting. We provide numerical examples that simulate both time-independent and time-dependent Lindbladian dynamics with accuracy up to the third order. Published by the American Physical Society 2024

Ding, Zhiyan (ORCID:000000018863403X)↗

Kubo-Anderson theory of polariton line shape

We apply the Kubo-Anderson stochastic theory of molecular spectral line shapes to the case of polaritons formed in the collective strong-coupling regime. We investigate both the fast and slow limits of the random frequency modulation of the emitter as well as the intermediate regime and show how the interplay between the characteristic timescales of the cavity and the molecular disorder is expressed in the observed polaritons line shapes. The analytical solution obtained for the slow limit is valid for any ratio between the inhomogeneous broadening of the molecules and the Rabi splitting, which is especially relevant for molecular polaritons where these two quantities can be of the same order of magnitude.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Determining the N -Representability of a Reduced Density Matrix via Unitary Evolution and Stochastic Sampling

The N-representability problem consists in determining whether, for a given p-body matrix, there exists at least one N-body density matrix from which the p-body matrix can be obtained by contraction, that is, if the given matrix is a p-body reduced density matrix (p-RDM). The knowledge of all necessary and sufficient conditions for a p-body matrix to be N-representable allows the constrained minimization of a many-body Hamiltonian expectation value with respect to the p-body density matrix and, thus, the determination of its exact ground state. However, the number of constraints that complete the N-representability conditions grows exponentially with system size, and hence, the procedure quickly becomes intractable for practical applications. This work introduces a hybrid quantum-stochastic algorithm to effectively replace the N-representability conditions. The algorithm consists of applying to an initial N-body density matrix a sequence of unitary evolution operators constructed from a stochastic process that successively approaches the reduced state of the density matrix on a p-body subsystem, represented by a p-RDM, to a target p-body matrix, potentially a p-RDM. The generators of the evolution operators follow the well-known adaptive derivative-assembled pseudo-Trotter method (ADAPT), while the stochastic component is implemented by using a simulated annealing process. The resulting algorithm is independent of any underlying Hamiltonian, and it can be used to decide whether a given p-body matrix is N-representable, establishing a criterion to determine its quality and correcting it. We apply the proposed hybrid ADAPT algorithm to alleged reduced density matrices from a quantum chemistry electronic Hamiltonian, from the reduced Bardeen–Cooper–Schrieffer model with constant pairing, and from the Heisenberg XXZ spin model. In all cases, the proposed method behaves as expected for 1-RDMs and 2-RDMs, evolving the initial matrices toward different targets.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Adaptive Uncertainty Quantification for Stochastic Hyperbolic Conservation Laws

Here, we propose a predictor-corrector adaptive method for the study of hyperbolic partial differential equations (PDEs) under uncertainty. Constructed around the framework of stochastic finite volume (SFV) methods, our approach circumvents sampling schemes or simulation ensembles while also preserving fundamental properties, in particular hyperbolicity of the resulting systems and conservation of the discrete solutions. Furthermore, we augment the existing SFV theory with a priori convergence results for statistical quantities, in particular push-forward densities, which we demonstrate through numerical experiments. By linking refinement indicators to regions of the physical and stochastic spaces, we drive anisotropic refinements of the discretizations, introducing new degrees of freedom where deemed profitable. To illustrate our proposed method, we consider a series of numerical examples for nonlinear hyperbolic PDEs based on Burgers’ and Euler’s equations.

97 MATHEMATICS AND COMPUTING↗

Decomposing causality into its synergistic, unique, and redundant components

Causality lies at the heart of scientific inquiry, serving as the fundamental basis for understanding interactions among variables in physical systems. Despite its central role, current methods for causal inference face significant challenges due to nonlinear dependencies, stochastic interactions, self-causation, collider effects, and influences from exogenous factors, among others. While existing methods can effectively address some of these challenges, no single approach has successfully integrated all these aspects. Here, we address these challenges with SURD: Synergistic-Unique-Redundant Decomposition of causality. SURD quantifies causality as the increments of redundant, unique, and synergistic information gained about future events from past observations. The formulation is non-intrusive and applicable to both computational and experimental investigations, even when samples are scarce. We benchmark SURD in scenarios that pose significant challenges for causal inference and demonstrate that it offers a more reliable quantification of causality compared to previous methods.

applied mathematics↗