Tensor lattice field theory for renormalization and quantum computing
Not Available
Meurice, Yannick (ORCID:0000000209959694)↗
SEARCH · Search NASA
Results for “coarse-grained time integration”
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.
Panorama 360 (Final Report)
This is the final technical report for the DOE-funded Panorama 360 project. Panorama 360 provided a resource for the collection, analysis, and sharing of performance data about end-to-end scientific workflows executing on DOE facilities. The work focused on workflows that include experimental data generation at DOE facilities. The main activities of Panorama 360 include the development of: 1. A distributed repository that stores different types of workflow execution data (e.g., point and time series performance traces at fine- and coarse-grained levels); 2. A set of open-source data capture, curation, and publishing tools fully integrated with a state-of-the-art workflow management system that automates data ingestion to the repository and enables users to discover, query, and process data from the repository; 3. A set of analysis algorithms and machine learning based tools to perform analysis and characterization of the gathered data, which can be used to detect anomalous performance or system faults; and 4. Best practices and recommendations for workflow evaluation, analysis, execution, and architectures.
97 MATHEMATICS AND COMPUTING↗
Panorama 360 (Final Report)
This final technical report from the lead institution, USC grant #DE-SC0012636, serves as the final technical report for collaborative institution UNC-CH grant #DE-SC0012390. The goal was to develop a repository and associated capabilities for data collection, ingestion, and analysis for a broad class of DOE applications that span experimental and simulation science workflows. In particular, this work focuses on workflows that include experimental data generation at DOE facilities. The main activities of Panorama 360 include the development of: (1) A distributed repository that stores different types of workflow execution data (e.g., point and time series performance traces at fine- and coarse-grained levels); (2) A set of open-source data capture, curation, and publishing tools fully integrated with a state-of-the-art workflow management system that automates data ingestion to the repository and enables users to discover, query, and process data from the repository; (3) A set of analysis algorithms and machine learning based tools to perform analysis and characterization of the gathered data, which can be used to detect anomalous performance or system faults; and (4) Best practices and recommendations for workflow evaluation, analysis, execution, and architectures.
97 MATHEMATICS AND COMPUTING↗
Temporal Coarse Graining for Classical Stochastic Noise in Quantum Systems
Simulations of quantum systems with Hamiltonian classical stochastic noise can be challenging when the noise exhibits temporal correlations over a multitude of time scales, such as for 1/f noise in solid-state quantum information processors. Here we present an approach for simulating Hamiltonian classical stochastic noise that performs temporal coarse-graining by effectively integrating out the high-frequency components of the noise. We focus on the case where the stochastic noise can be expressed as a sum of Ornstein-Uhlenbeck processes. Temporal coarse-graining is then achieved by conditioning the stochastic process on a coarse realization of the noise, expressing the conditioned stochastic process in terms of a sum of smooth, deterministic functions and bridge processes with boundaries fixed at zero, and performing the ensemble average over the bridge processes. For Ornstein-Uhlenbeck processes, the deterministic components capture all dependence on the coarse realization, and the stochastic bridge processes are not only independent but taken from the same distribution with correlators that can be expressed analytically, allowing the associated noise propagators to be precomputed once for all simulations. This combination of noise trajectories on a coarse time grid and ensemble averaging over bridge processes has practical advantages, such as a simple concatenation rule, that we highlight with numerical examples.
Albash, Tameem [Sandia National Lab. (SNL-NM), Alb↗
Emergence of Orchestrated and Dynamic Metabolism of Saccharomyces cerevisiae
Microbial metabolism is a fundamental cellular process that involves many biochemical events and is distinguished by its emergent properties. While the molecular details of individual reactions have been increasingly elucidated, it is not well understood how these reactions are quantitatively orchestrated to produce collective cellular behaviors. Here we developed a coarse-grained, systems, and dynamic mathematical framework, which integrates metabolic reactions with signal transduction and gene regulation to dissect the emergent metabolic traits of Saccharomyces cerevisiae. Our framework mechanistically captures a set of characteristic cellular behaviors, including the Crabtree effect, diauxic shift, diauxic lag time, and differential growth under nutrient-altered environments. It also allows modular expansion for zooming in on specific pathways for detailed metabolic profiles. Furthermore, this study provides a systems mathematical framework for yeast metabolic behaviors, providing insights into yeast physiology and metabolic engineering.
59 BASIC BIOLOGICAL SCIENCES↗
Perspective on Integrative Simulations of Bioenergetic Domains
Bioenergetic processes in cells, such as photosynthesis or respiration, integrate many time and length scales, which makes the simulation of energy conversion with a mere single level of theory impossible. Just like the myriad of experimental techniques required to examine each level of organization, an array of overlapping computational techniques is necessary to model energy conversion. Here, in this work, a perspective is presented on recent efforts for modeling bioenergetic phenomena with a focus on molecular dynamics simulations and its variants as a primary method. An overview of the various classical, quantum mechanical, enhanced sampling, coarse-grained, Brownian dynamics, and Monte Carlo methods is presented. Example applications discussed include multiscale simulations of membrane-wide electron transport, rate kinetics of ATP turnover from electrochemical gradients, and finally, integrative modeling of the chromatophore, a photosynthetic pseudo-organelle.
59 BASIC BIOLOGICAL SCIENCES↗
A data-driven peridynamic continuum model for upscaling molecular dynamics
Nonlocal models, including peridynamics, often use integral operators that embed lengthscales in their definition. However, the integrands in these operators are difficult to define from the data that are typically available for a given physical system, such as laboratory mechanical property tests. In contrast, molecular dynamics (MD) does not require these integrands, but it suffers from computational limitations in the length and time scales it can address. To combine the strengths of both methods and to obtain a coarse-grained, homogenized continuum model that efficiently and accurately captures materials’ behavior, we propose a learning framework to extract, from MD data, an optimal Linear Peridynamic Solid (LPS) model as a surrogate for MD displacements. To maximize the accuracy of the learnt model we allow the peridynamic influence function to be partially negative, while preserving the well-posedness of the resulting model. To achieve this, we provide sufficient well-posedness conditions for discretized LPS models with sign-changing influence functions and develop a constrained optimization algorithm that minimizes the equation residual while enforcing such solvability conditions. This framework guarantees that the resulting model is mathematically well-posed, physically consistent, and that it generalizes well to settings that are different from the ones used during training. We illustrate the efficacy of the proposed approach with several numerical tests for single layer graphene. Our two-dimensional tests show the robustness of the proposed algorithm on validation data sets that include thermal noise, different domain shapes and external loadings, and discretizations substantially different from the ones used for training.
homogenization↗
Data driven learning of robust nonlocal models
Nonlocal models use integral operators that embed length-scales in their definition. However, the integrands in these operators are difficult to define from the data that are typically available for a given physical system, such as laboratory mechanical property tests. In contrast, molecular dynamics (MD) does not require these integrands, but it suffers from computational limitations in the length and time scales it can address. To combine the strengths of both methods and to obtain a coarse-grained, homogenized continuum model that efficiently and accurately captures materials' behavior, we propose a learning framework to extract, from MD data, an optimal nonlocal model as a surrogate for MD displacements. Our framework guarantees that the resulting model is mathematically well-posed, physically consistent, and that it generalizes well to settings that are different from the ones used during training. The efficacy of this approach is demonstrated with several numerical tests for single layer graphene both in the case of perfect crystal and in the presence of thermal noise.
36 MATERIALS SCIENCE↗
Transfer learning of memory kernels for transferable coarse-graining of polymer dynamics
The present work concerns the transferability of coarse-grained (CG) modeling in reproducing the dynamic properties of the reference atomistic systems across a range of parameters. In particular, we focus on implicit-solvent CG modeling of polymer solutions. The CG model is based on the generalized Langevin equation, where the memory kernel plays the critical role in determining the dynamics in all time scales. Thus, we propose methods for transfer learning of memory kernels. The key ingredient of our methods is Gaussian process regression. By integration with the model order reduction via proper orthogonal decomposition and the active learning technique, the transfer learning can be practically efficient and requires minimum training data. Through two example polymer solution systems, we demonstrate the accuracy and efficiency of the proposed transfer learning methods in the construction of transferable memory kernels. The transferability allows for out-of-sample predictions, even in the extrapolated domain of parameters. Built on the transferable memory kernels, the CG models can reproduce the dynamic properties of polymers in all time scales at different thermodynamic conditions (such as temperature and solvent viscosity) and for different systems with varying concentrations and lengths of polymers.
Ma, Zhan↗
Temporal entanglement entropy as a probe of renormalization group flow
The recently introduced concept of timelike entanglement entropy has sparked a lot of interest. Unlike the traditional spacelike entanglement entropy, timelike entanglement entropy involves tracing over a timelike subsystem. In this work, we propose an extension of timelike entanglement entropy to Euclidean space (“temporal entanglement entropy”), and relate it to the renormalization group (RG) flow. Specifically, we show that tracing over a period of Euclidean time corresponds to coarse-graining the system and can be connected to momentum space entanglement. We employ Holography, a framework naturally embedding RG flow, to illustrate our proposal. Within cutoff holography, we establish a direct link between the UV cutoff and the smallest resolvable time interval within the effective theory through the irrelevant $T\bar{T}$ deformation. Increasing the UV cutoff results in an enhanced capability to resolve finer time intervals, while reducing it has the opposite effect. Moreover, we show that tracing over a larger Euclidean time interval is formally equivalent to integrating out more UV degrees of freedom (or lowering the temperature). As an application, we point out that the temporal entanglement entropy can detect the critical Lifshitz exponent z in non-relativistic theories which is not accessible from spatial entanglement at zero temperature and density.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Closed-loop control of active nematic flows
Stabilizing and shaping autonomous flows of active fluids is a fundamental challenge and a prerequisite for applications. We embed a light-responsive microtubule-based nematic in a proportional-integral control loop that adjusts the applied light intensity in response to real-time measurements of the spatially averaged flow speed. The self-regulating hardware/software/wetware system maintains a target flow speed against external or internal perturbations, including protein aging and aggregation, sample-to-sample variability, and temperature variation. Varying the controller’s gains reveals antagonistic roles between feedback and intrinsic processes, leading to nontrivial dynamics observed in fluctuation spectra. In particular, oscillations emerge from the interplay between the controller, motor binding kinetics, and active hydrodynamic relaxation. Accounting for the underlying binding timescale, our coarse-grained model and nematohydrodynamics simulations corroborate these observations. This work provides insight into the coupled dynamics of controlled active matter, laying the foundation for spatiotemporal patterning of active stress to generate and stabilize new dynamical configurations.
Nishiyama, Katsu [Brandeis Univ., Waltham, MA (Uni↗
Closed-Loop Control of Active Nematic Flows
Stabilizing and shaping autonomous flows of active fluids is a fundamental challenge and a prerequisite for applications. We embed a light-responsive microtubule-based nematic in a proportional-integral control loop that adjusts the applied light intensity in response to real-time measurements of the spatially averaged flow speed. The self-regulating hardware-software-wetware system maintains a target flow speed against external or internal perturbations, including protein aging and aggregation, sample-to-sample variability, and temperature variation. Varying the controller’s gains reveals antagonistic roles between feedback and intrinsic processes, leading to nontrivial dynamics observed in fluctuation spectra. In particular, oscillations emerge from the interplay between the controller, motor binding kinetics, and active hydrodynamic relaxation. Accounting for the underlying binding timescale, our coarse-grained model and nematohydrodynamics simulations corroborate these observations. This work provides insight into the coupled dynamics of controlled active matter, laying the foundation for spatiotemporal patterning of active stress to generate and stabilize new dynamical configurations.
Active nematics↗
DynPaC: Coarse-Grained, Dynamic, and Partially Reconfigurable Array for Streaming Applications
Coarse-grained reconfigurable arrays (CGRAs) provide higher flexibility than application-specific integrated circuits (ASICs) and higher efficiency than fine-grained reconfigurable devices such as Field Programmable Gate Arrays (FPGAs). However, CGRAs are generally designed to support offloading of a single kernel. While their design, based on communicating functional units, appears to naturally suit streaming applications composed of multiple cooperating kernels, current approaches only statically partition the resources across kernels. However, streaming applications often are data-dependent, leading to variable kernel execution times depending on the input data and impacting the throughput of the entire pipeline if resources are statically allocated. Therefore, in this paper, we discuss the design of DynPaC — a coarse-grained, dynamically, and partially reconfigurable array for data-dependent streaming applications. We discuss the required software and hardware components to manage partial dynamic reconfiguration. We demonstrate that by supporting partial dynamic reconfiguration, we can obtain an average speedup of 1.44X for a representative set of applications w.r.t. static partitioning, with a limited area overhead (6.4% of the entire chip).
Tan, Cheng↗
Shadow energy functionals and potentials in Born–Oppenheimer molecular dynamics
In Born–Oppenheimer molecular dynamics (BOMD) simulations based on the density functional theory (DFT), the potential energy and the interatomic forces are calculated from an electronic ground state density that is determined by an iterative self-consistent field optimization procedure, which, in practice, never is fully converged. The calculated energies and forces are, therefore, only approximate, which may lead to an unphysical energy drift and instabilities. Here, we discuss an alternative shadow BOMD approach that is based on backward error analysis. Instead of calculating approximate solutions for an underlying exact regular Born–Oppenheimer potential, we do the opposite. Instead, we calculate the exact electron density, energies, and forces, but for an underlying approximate shadow Born–Oppenheimer potential energy surface. In this way, the calculated forces are conservative with respect to the approximate shadow potential and generate accurate molecular trajectories with long-term energy stabilities. We show how such shadow Born–Oppenheimer potentials can be constructed at different levels of accuracy as a function of the integration time step, δt, from the constrained minimization of a sequence of systematically improvable, but approximate, shadow energy density functionals. For each energy functional, there is a corresponding ground state Born–Oppenheimer potential. These pairs of shadow energy functionals and potentials are higher-level generalizations of the original “zeroth-level” shadow energy functionals and potentials used in extended Lagrangian BOMD. The proposed shadow energy functionals and potentials are useful only within this extended dynamical framework, where also the electronic degrees of freedom are propagated as dynamical field variables together with the atomic positions and velocities. The theory is quite general and can be applied to MD simulations using approximate DFT, Hartree–Fock, or semi-empirical methods, as well as to coarse-grained flexible charge models.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DRIPS: Dynamic Rebalancing of Pipelined Streaming Applications on CGRAs
Coarse-grained reconfigurable arrays (CGRAs) provide higher flexibility than application-specific integrated circuits (ASICs) and higher efficiency than fine-grained reconfigurable devices such as Field Programmable Gate Arrays (FPGAs). However, CGRAs are generally designed to support offloading of a single kernel. While their design, based on communicating functional units, appears to naturally suit data streaming applications composed of multiple cooperating kernels, current approaches only statically partition the resources across application kernels. However, emerging streaming applications at the edge (scientific instruments, sensor networks, network processing) perform much more than digital signal processing and often are data and input dependent. This leads to extremely variable kernel execution times, severely impacting the throughput of the entire pipeline if resources are only statically allocated. Therefore, in this paper, we propose DRIPS — a coarse-grained, dynamically, and partially reconfigurable array for data-dependent streaming applications. We present a unified compiler framework to facilitate the mapping of a given streaming application onto the DRIPS CGRA architecture. The experimental results show that DRIPS achieves an average throughput improvement of 1.46$\times$ across a set of representative applications over a statically partitioned solution. The additional area overhead to enable dynamic rebalancing consumes 16.34% of the entire area for a 5x5 CGRA prototype.
Tan, Cheng↗
Learning Latent Representations to Bridge Coarse-Grained and Atomistic Resolutions in Polymer Simulations
We present a machine-learning-based framework for learning reduced-order representations of polymer chain conformations across coarse-grained (CG) and united-atom (UA) fidelities. By employing linear singular value decomposition and nonlinear autoencoders, we compress high-dimensional polymer configurations into latent spaces with minimal loss of structural accuracy. Crucially, we demonstrate a near-perfect linear mapping between CG and UA latent spaces, enabling an efficient super-resolution back-mapping procedure that reconstructs high-fidelity UA configurations from CG simulations. While minor structural inaccuracies occur, they are effectively corrected through a brief molecular dynamics relaxation, forming a practical hybrid machine learning−physics scheme. This approach establishes the key structural prerequisites for accelerated polymer dynamics simulations: a compact and accurate latent encoding of polymer chain conformations and a validated multi-fidelity mapping that permits reconstruction of UA structures from CG configurations. The extension of this framework to explicit time evolution within the latent space, enabling dynamics to be propagated at CG fidelity and decoded to UA resolution only when required, represents a natural and well-motivated direction for future work.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Integrating Ultra-Coarse-Grained Protein Models into Accessible Workflows for Multiscale Molecular Dynamics
To capture protein conformational transitions using molecular dynamics (MD), several simulation resolutions covering different spatial and temporal scales are typically needed. All-atom (AA) simulations provide fine resolution, but are computationally infeasible for large systems over longer durations. Coarse-grained (CG) and ultra-coarse-grained (UCG) models have a lower resolution and computational cost while still being able to conserve essential protein features. Prior work on a Multiscale Machinelearned Modeling Infrastructure (MuMMI) combined both AA and CG simulations to study RAS-RAF protein interactions, leveraging CG models for longer time scales and using AA to investigate unusual conformations in greater detail. However, MuMMI is still resource-intensive, and this study aims to maximize exploration of the protein conformational space while reducing computational cost. In this paper, we build on prior work that integrates UCG models based on heterogeneous elastic network modeling (hENM) into the MuMMI workflow. We demonstrate that UCG models enable accurate sampling of protein conformations, focusing on simulating RAS-RAF protein interactions. Using higher-resolution CG Martini simulation data, we can automatically refine intramolecular interactions in UCG models. We present a scalable Python package that uses fluctuations observed in higher-resolution CG Martini simulations to estimate bond coefficients of the UCG model. We built novel machine learning-based backmapping methods to recover more detailed CG Martini structures from UCG structures, using diffusion models to learn the mapping between scales. Finally, we present UCG-mini-MuMMI, an accessible and less compute-intensive version of MuMMI as a resource for the scientific community. Incorporating UCG models into MD studies is applicable to a broad range of systems and proteins, and our study offers insights into the advantages and limitations of these methods.
Chemical structure↗
Adaptive tau-leaping methods for microscopic-lattice kinetic Monte Carlo simulations
Traditional Kinetic Monte Carlo (KMC) approaches, rooted in Gillespie’s stochastic simulation algorithm, become computationally demanding in systems with a large range of timescales. The goal of this work is to propose and study new adaptive lattice-KMC time integration strategies for spatially non-uniform systems. To that end, two novel adaptive tau-leaping methods and their corresponding time integration strategies are developed based on the idea of the “n-fold” direct KMC method. These strategies allow for the simultaneous execution of multiple reactions, advancing time by adaptively selected coarse increments. We present numerical experiments comparing the proposed methods with existing approaches in a catalytic surface kinetics application involving ammonia decomposition.
Bimolecular reactions↗