Mapping renormalized coupled cluster methods to quantum computers through a compact unitary representation of nonunitary operators
Not Available
97 MATHEMATICS AND COMPUTING↗
SEARCH · Engineering Papers
Results for “mathematics computing”
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.
Uncertainty Visualization Challenges in Decision Systems with Ensemble Data & Surrogate Models
Uncertainty visualization is a key component in translating important insights from ensemble simulation data into actionable decision-making by visually conveying various aspects of uncertainty within a system. With the recent advent of fast surrogate models trained on ensemble data, we can substitute computationally expensive simulations, which allows users to interact with more aspects of data spaces than ever before. However, the use of ensemble data with surrogate models in a decision-making tool brings up new challenges for uncertainty visualization, namely how to reconcile and communicate the new and different types of uncertainties brought in by surrogates and how to utilize these new data estimates in actionable ways. In this work, we examine these issues as they relate to high-dimensional data visualization, the integration of discrete datasets and the continuous representations of those datasets, and the unique difficulties associated with systems that allow users to iterate between input and output spaces. We assess the role of uncertainty visualization in facilitating intuitive and actionable interaction with ensemble data and surrogate models, and highlight key challenges in this new frontier of computational simulation.
ensemble data↗
Nonparametric Inference for the Reproductive Rate in Generalized Compartmental Models
We develop a tractable nonparametric model for the time-varying reproductive rate of infectious diseases that combines the structure of a deterministic compartmental model and a stochastic model for incidence data. We use Bayesian inference to estimate, with uncertainty, the reproductive rate of the Coronavirus 2019 outbreak in the U.S. states of California, Florida, Michigan, New Mexico, New York, and Texas from January 2020 to March 2022. Employing the inferred reproductive rates, we estimate the posterior distribution of the time-varying reproduction numbers for each state. Compering the time-varying reproduction numbers across the states, we identify some epidemic waves, potentially driven from changes in human behavior and virus mutations.
97 MATHEMATICS AND COMPUTING↗
Communication-Constrained Expansion Planning for Resilient Distribution Systems
Distributed generation and remotely controlled switches have emerged as important technologies to improve the resiliency of distribution grids against extreme weather-related disturbances. Therefore it becomes important to study how best to place them on the grid in order to meet a resiliency criteria, while minimizing costs and capturing their dependencies on the associated communication systems that sustain their distributed operations. This paper introduces the Optimal Resilient Design Problem for Distribution and Communication Systems (ORDPDC) to address this need. The ORDPDC is formulated as a two-stage stochastic mixed-integer program that captures the physical laws of distribution systems, the communication connectivity of the smart grid components, and a set of scenarios that specifies which components are affected by potential disasters. The paper proposes an exact branch-and-price algorithm for the ORDPDC that features a strong lower bound and a variety of acceleration schemes to address degeneracy. The ORDPDC model and branch-and-price algorithm were evaluated on a variety of test cases with varying disaster intensities and network topologies. The results demonstrate the significant impact of the network topologies on the expansion plans and costs, as well as the computational benefits of the proposed approach.
97 MATHEMATICS AND COMPUTING↗
A multiscale model of the action of a capsid assembly modulator for the treatment of chronic hepatitis B
Chronic hepatitis B virus (HBV) infection is strongly associated with increased risk of liver cancer and cirrhosis. While existing treatments effectively inhibit the HBV life cycle, viral rebound frequently occurs following treatment interruption. Consequently, functional cure rates of chronic HBV infection remain low and there is increased interest in a novel treatment modality, capsid assembly modulators (CAMs). Here, we develop a multiscale mathematical model of CAM treatment in chronic HBV infection. By fitting the model to participant data from a phase I trial of the first-generation CAM vebicorvir, we estimate the drug’s dose-dependent effectiveness and identify the physiological mechanisms that drive the observed biphasic decline in HBV DNA and RNA, and mechanistic differences between HBeAg-positive and negative infection. Finally, we demonstrate analytically and numerically that the relative change of HBV RNA more accurately reflects the antiviral effectiveness of a CAM than the relative change in HBV DNA.
59 BASIC BIOLOGICAL SCIENCES↗
A Survey of Constrained Gaussian Process: Approaches and Implementation Challenges
Gaussian process regression is a popular Bayesian framework for surrogate modeling of expensive data sources. As part of a larger effort in scientific machine learning, many recent works have incorporated physical constraints or other a priori information within Gaussian process regression to supplement limited data and regularize the behavior of the model. We provide an overview and survey of several classes of Gaussian process constraints, including positivity or bound constraints, monotonicity and convexity constraints, differential equation constraints provided by linear PDEs, and boundary condition constraints. We compare the strategies behind each approach as well as the differences in implementation, concluding with a discussion of the computational challenges introduced by constraints.
97 MATHEMATICS AND COMPUTING↗
Nuclear Science User Facilities High Performance Computing: FY2019 Operations and Accomplishments Report
This report highlights a subset of accomplishments including projects that were completed in FY 2019 by researchers using Idaho National Laboratory's High-Performance Computing (HPC) resources.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Domaine-Specific Runtime to Orchestrate Computation on Heterogeneous Platforms
Task-based runtime systems in the past have sought to exploit inherent asynchronicity in the application execution to reduce overall runtime. In the last decade focus shifted to supporting the heterogeneity that is increasingly prevalent in high-performance computing systems. However, existing task-based runtime systems, being general, come with a challenging set of issues such as the complexity of abstractions and overheads. And they still leave much of the burden of exposing the parallelism on the application developers who also have to fit their applications to the runtime systems’ interfaces. In this paper we take a different approach for applications to target heterogeneous systems through domain-specific run-times. Our design aspires to leverage the domain-specific knowledge of a focused class of scientific simulations to pragmatically orchestrate computations in the simulations.
97 MATHEMATICS AND COMPUTING↗
Scalable Interpolation on GPUs for Thermal Fluids Applications
The need for efficient interpolation arises in many use cases for spectral element simulations. Towards this end, we present a fast and robust GPU-enable interpolation utility for NekRS, a spectral-element, Navier-Stokes solver. This utility is based on the findpts and findpts eval routines from the gslib library. To demonstrate the functionality, we added support for particle tracking. The GPU implementation of the interpolation allows for tracking 100 times more particles for the same computational cost.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
TEAM Project Review, Year 2
This report summarizes our research activities within the TEAM project between December 2020 and December 2021, funded by the ASCR Advanced Research in Quantum Computing program. During the reporting period the LLNL-MSU team has made progress on several fronts. An overarching goal of the team is to provide a comprehensive suite of software tools that can be used for the Characterize-Optimize-Compute loop needed to implement and execute algorithms on quantum devices. We are concurrently developing lightweight solvers that can be used on desktop computers to find optimal control pulses and to characterize small quantum systems (consisting of a few transmons and cavities). However, desktop computers are insufficient for simulating and characterizing larger quantum systems. We have therefore also developed parallel, distributed memory, simulators and optimization solvers, both for open and closed quantum systems. These parallel solvers have, for example, been used to study quantum optimal control for pure-state preparation, utilizing 1000’s of cores on a modern high-performance computing (HPC) platform.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Quantum Computing for Quantum Dynamics in Nuclear Physics [Slides]
Abstract not provided.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
A Hybrid Method for Tensor Decompositions that Leverages Stochastic and Deterministic Optimization
In this paper, we propose a hybrid method that uses stochastic and deterministic search to compute the maximum likelihood estimator of a low-rank count tensor with Poisson loss via state-of-theart local methods. Our approach is inspired by Simulated Annealing for global optimization and allows for fine-grain parameter tuning as well as adaptive updates to algorithm parameters. We present numerical results that indicate our hybrid approach can compute better approximations to the maximum likelihood estimator with less computation than the state-of-the-art methods by themselves.
97 MATHEMATICS AND COMPUTING↗
Advanced Turbulence Models for Large-Scale Atmospheric Boundary Layer Flows
We present high-fidelity large-eddy-simulation (LES) modeling approaches for the turbulent atmospheric boundary layer (ABL) flows. Wind energy is a prime example of an application driven by ABL. Generation of electrical energy from farms of wind turbines at night in the stable ABL is a particularly interesting situation. In this report, we consider the well-known GEWEX (Global Energy and Water Cycle Experiment) Atmospheric Boundary Layer Study (GABLS) stably stratified benchmark LES case. We use a high-order spectral element code Nek5000/RS, which is supported under the DOE's Exascale Computing Project (ECP) Center for Efficient Exascale Discretizations (CEED) project, targeting application simulations on various acceleration-device based exascale computing platforms. In our earlier ANL report, we demonstrated our newly developed subgrid-scale (SGS) models based on high-pass filter (HPF), mean-field eddy viscosity (MFEV), and Smagorinsky (SMG) with no-slip and traction boundary conditions, provided with low-order statistics, convergence and turbulent structure analysis. In this report, we extend the range of our SGS modeling approaches in the context of the mean-field eddy viscosity (MFEV), to include the solution of an SGS turbulent kinetic energy equation (TKE). We demonstrate the model fidelity of Nek5000/RS in comparison to that of AMR-Wind, a block-structured second-order finite-volume code with adaptive-mesh-refinement capabilities, with which we studied scaling performance for both codes in comparison on DOE's leadership computing platforms.
17 WIND ENERGY↗
LANL ASC Vision for Computer Science R&D: "Business-as-usual will not be adequate" [Slides]
Key Messages: ASC has a strong legacy of mission contribution. Looking ahead, strategic drivers continuously push us to be faster, better, and smarter; Evolving mission drivers and technology markets mean that business-as-usual will not be adequate for the ASC Program; Call to action: How will our computer science R&D portfolio evolve to meet these challenges and opportunities?
97 MATHEMATICS AND COMPUTING↗
Revolutionizing Neuromorphic Computing for Science (Brochure on the 2024 ASCR Workshop on Neuromorphic Computing for Science)
The ASCR basic research needs for Neuromorphic Computing for Science workshop was held in September 2024. The workshop brochure and report aim to inform and draft a set of grand challenges for advancing the field of neuromorphic computing and developing proof of principle neuromorphic circuits applicable for High Performance Computer (HPC) acceleration for scientific discovery, and brainstorm ideas needed for a successful, robust, and world leading basic research program. The resulting priority research directions are: (1) Neuromorphic computing circuit primitives; (2) Connectivity, communication, and hardware integration; (3) Neuroscience-derived dynamics and algorithms; and (4) Ecosystem for scalable neuromorphic co-design. Breakthroughs in understanding, designing, and prototyping the circuitry and simulation capabilities for a truly neuromorphic computer are essential to enable progress in the field.
97 MATHEMATICS AND COMPUTING↗
Revolutionizing Neuromorphic Computing for Science (Report for the 2024 ASCR Workshop on Neuromorphic Computing for Science)
The ASCR basic research needs for Neuromorphic Computing for Science workshop was held in September 2024. The workshop brochure and report aim to inform and draft a set of grand challenges for advancing the field of neuromorphic computing and developing proof of principle neuromorphic circuits applicable for High Performance Computer (HPC) acceleration for scientific discovery, and brainstorm ideas needed for a successful, robust, and world leading basic research program. The resulting priority research directions are: (1) Neuromorphic computing circuit primitives; (2) Connectivity, communication, and hardware integration; (3) Neuroscience-derived dynamics and algorithms; and (4) Ecosystem for scalable neuromorphic co-design. Breakthroughs in understanding, designing, and prototyping the circuitry and simulation capabilities for a truly neuromorphic computer are essential to enable progress in the field.
97 MATHEMATICS AND COMPUTING↗
Quantum Computing at Los Alamos
Explore the source record for details and available documents.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Scattering wave packets of hadrons in gauge theories: Preparation on a quantum computer
Quantum simulation holds promise of enabling a complete description of high-energy scattering processes rooted in gauge theories of the Standard Model. A first step in such simulations is preparation of interacting hadronic wave packets. To create the wave packets, one typically resorts to adiabatic evolution to bridge between wave packets in the free theory and those in the interacting theory, rendering the simulation resource intensive. In this work, we construct a wave-packet creation operator directly in the interacting theory to circumvent adiabatic evolution, taking advantage of resource-efficient schemes for ground-state preparation, such as variational quantum eigensolvers. By means of an ansatz for bound mesonic excitations in confining gauge theories, which is subsequently optimized using classical or quantum methods, we show that interacting mesonic wave packets can be created efficiently and accurately using digital quantum algorithms that we develop. Specifically, we obtain high-fidelity mesonic wave packets in the Z 2 and U(1) lattice gauge theories coupled to fermionic matter in 1+1 dimensions. Our method is applicable to both perturbative and non-perturbative regimes of couplings. The wave-packet creation circuit for the case of the Z 2 lattice gauge theory is built and implemented on the Quantinuum H1-1 trapped-ion quantum computer using 13 qubits and up to 308 entangling gates. The fidelities agree well with classical benchmark calculations after employing a simple symmetry-based noise-mitigation technique. This work serves as a step toward quantum computing scattering processes in quantum chromodynamics.
97 MATHEMATICS AND COMPUTING↗