Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum Computing Stochastic Processes”

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 181 records · Page 10

Scalable training of graph convolutional neural networks for fast and accurate predictions of HOMO-LUMO gap in molecules

Abstract Graph Convolutional Neural Network (GCNN) is a popular class of deep learning (DL) models in material science to predict material properties from the graph representation of molecular structures. Training an accurate and comprehensive GCNN surrogate for molecular design requires large-scale graph datasets and is usually a time-consuming process. Recent advances in GPUs and distributed computing open a path to reduce the computational cost for GCNN training effectively. However, efficient utilization of high performance computing (HPC) resources for training requires simultaneously optimizing large-scale data management and scalable stochastic batched optimization techniques. In this work, we focus on building GCNN models on HPC systems to predict material properties of millions of molecules. We use HydraGNN, our in-house library for large-scale GCNN training, leveraging distributed data parallelism in PyTorch. We use ADIOS, a high-performance data management framework for efficient storage and reading of large molecular graph data. We perform parallel training on two open-source large-scale graph datasets to build a GCNN predictor for an important quantum property known as the HOMO-LUMO gap. We measure the scalability, accuracy, and convergence of our approach on two DOE supercomputers: the Summit supercomputer at the Oak Ridge Leadership Computing Facility (OLCF) and the Perlmutter system at the National Energy Research Scientific Computing Center (NERSC). We present our experimental results with HydraGNN showing (i) reduction of data loading time up to 4.2 times compared with a conventional method and (ii) linear scaling performance for training up to 1024 GPUs on both Summit and Perlmutter.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Jarzynski Equality for Conditional Stochastic Work

It has been established that the inclusive work for classical, Hamiltonian dynamics is equivalent to the two-time energy measurement paradigm in isolated quantum systems. However, a plethora of other notions of quantum work has emerged, and thus the natural question arises whether any other quantum notion can provide motivation for purely classical considerations. In the present analysis, we propose the conditional stochastic work for classical, Hamiltonian dynamics, which is inspired by the one-time measurement approach. This novel notion is built upon the change of expectation value of the energy conditioned on the initial energy surface. As main results, we obtain a generalized Jarzynski equality and a sharper maximum work theorem, which account for how non-adiabatic the process is. Our findings are illustrated with the parametric harmonic oscillator.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A wavelet-based computational method for solving stochastic Itô–Volterra integral equations

This paper presents a computational method based on the Chebyshev wavelets for solving stochastic Itô–Volterra integral equations. First, a stochastic operational matrix for the Chebyshev wavelets is presented and a general procedure for forming this matrix is given. Then, the Chebyshev wavelets basis along with this stochastic operational matrix are applied for solving stochastic Itô–Volterra integral equations. Convergence and error analysis of the Chebyshev wavelets basis are investigated. To reveal the accuracy and efficiency of the proposed method some numerical examples are included.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spin-squeezed Gottesman-Kitaev-Preskill codes for quantum error correction in atomic ensembles

Gottesman-Kitaev-Preskill (GKP) codes encode a qubit in displaced phase-space combs of a continuous-variable (CV) quantum system and are useful for correcting a variety of high-weight photonic errors. Here we propose atomic ensemble analogs of the single-mode CV GKP code by using the quantum central limit theorem to pull back the phase-space structure of a CV system to the compact phase space of a quantum spin system. We study the optimal recovery performance of these codes under error channels described by stochastic relaxation and isotropic ballistic dephasing processes using the diversity combining approach for calculating channel fidelity. Additionally, we find that the spin GKP codes outperform other spin system codes such as cat codes or binomial codes. Our spin GKP codes based on the two-axis countertwisting interaction and superpositions of SU(2) coherent states are direct spin analogs of the finite-energy CV GKP codes, whereas our codes based on one-axis twisting do not yet have well-studied CV analogs. A state preparation scheme for the spin GKP codes is proposed which uses the linear-combination-of-unitaries method, applicable to both the CV and spin GKP settings. Finally, we discuss a fault-tolerant approximate gate set for quantum computing with spin-GKP-encoded qubits, obtained by translating gates from the CV GKP setting using the quantum central limit theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Bloch decomposition-based stochastic Galerkin method for quantum dynamics with a random external potential

In this paper, we consider the numerical solution of the one-dimensional Schrödinger equation with a periodic lattice potential and a random external potential. This is an important model in solid state physics where the randomness results from complicated phenomena that are not exactly known. Here we generalize the Bloch decomposition-based time-splitting pseudospectral method to the stochastic setting using the generalized polynomial chaos with a Galerkin procedure so that the main effects of dispersion and periodic potential are still computed together. We prove that our method is unconditionally stable and numerical examples show that it has other nice properties and is more efficient than the traditional method. Finally, we give some numerical evidence for the well-known phenomenon of Anderson localization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic weighted particle methods for population balance equations with coagulation, fragmentation and spatial inhomogeneity

Graphical abstract: -- Highlights: •Problems concerning multi-compartment population balance equations are studied. •A class of fragmentation weight transfer functions is presented. •Three stochastic weighted algorithms are compared against the direct simulation algorithm. •The numerical errors of the stochastic solutions are assessed as a function of fragmentation rate. •The algorithms are applied to a multi-dimensional granulation model. -- Abstract: This paper introduces stochastic weighted particle algorithms for the solution of multi-compartment population balance equations. In particular, it presents a class of fragmentation weight transfer functions which are constructed such that the number of computational particles stays constant during fragmentation events. The weight transfer functions are constructed based on systems of weighted computational particles and each of it leads to a stochastic particle algorithm for the numerical treatment of population balance equations. Besides fragmentation, the algorithms also consider physical processes such as coagulation and the exchange of mass with the surroundings. The numerical properties of the algorithms are compared to the direct simulation algorithm and an existing method for the fragmentation of weighted particles. It is found that the new algorithms show better numerical performance over the two existing methods especially for systems with significant amount of large particles and high fragmentation rates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bifurcation dynamics of the tempered fractional Langevin equation

Tempered fractional processes offer a useful extension for turbulence to include low frequencies. In this paper, we investigate the stochastic phenomenological bifurcation, or stochastic P-bifurcation, of the Langevin equation perturbed by tempered fractional Brownian motion. However, most standard tools from the well-studied framework of random dynamical systems cannot be applied to systems driven by non-Markovian noise, so it is desirable to construct possible approaches in a non-Markovian framework. We first derive the spectral density function of the considered system based on the generalized Parseval's formula and the Wiener-Khinchin theorem. Then we show that it enjoys interesting and diverse bifurcation phenomena exchanging between or among explosive-like, unimodal, and bimodal kurtosis. Therefore, our procedures in this paper are not merely comparable in scope to the existing theory of Markovian systems but also provide a possible approach to discern P-bifurcation dynamics in the non-Markovian settings.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An efficient particle Fokker–Planck algorithm for rarefied gas flows

This paper is devoted to the algorithmic improvement and careful analysis of the Fokker–Planck kinetic model derived by Jenny et al. [1] and Gorji et al. [2]. The motivation behind the Fokker–Planck based particle methods is to gain efficiency in low Knudsen rarefied gas flow simulations, where conventional direct simulation Monte Carlo (DSMC) becomes expensive. This can be achieved due to the fact that the resulting model equations are continuous stochastic differential equations in velocity space. Accordingly, the computational particles evolve along independent stochastic paths and thus no collision needs to be calculated. Therefore the computational cost of the solution algorithm becomes independent of the Knudsen number. In the present study, different computational improvements were persuaded in order to augment the method, including an accurate time integration scheme, local time stepping and noise reduction. For assessment of the performance, gas flow around a cylinder and lid driven cavity flow were studied. Convergence rates, accuracy and computational costs were compared with respect to DSMC for a range of Knudsen numbers (from hydrodynamic regime up to above one). In all the considered cases, the model together with the proposed scheme give rise to very efficient yet accurate solution algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Weighted Watson-Crick automata

There are tremendous works in biotechnology especially in area of DNA molecules. The computer society is attempting to develop smaller computing devices through computational models which are based on the operations performed on the DNA molecules. A Watson-Crick automaton, a theoretical model for DNA based computation, has two reading heads, and works on double-stranded sequences of the input related by a complementarity relation similar with the Watson-Crick complementarity of DNA nucleotides. Over the time, several variants of Watson-Crick automata have been introduced and investigated. However, they cannot be used as suitable DNA based computational models for molecular stochastic processes and fuzzy processes that are related to important practical problems such as molecular parsing, gene disease detection, and food authentication. In this paper we define new variants of Watson-Crick automata, called weighted Watson-Crick automata, developing theoretical models for molecular stochastic and fuzzy processes. We define weighted Watson-Crick automata adapting weight restriction mechanisms associated with formal grammars and automata. We also study the generative capacities of weighted Watson-Crick automata, including probabilistic and fuzzy variants. We show that weighted variants of Watson-Crick automata increase their generative power.

60 APPLIED LIFE SCIENCES↗

A stochastic Galerkin method for the Boltzmann equation with uncertainty

We develop a stochastic Galerkin method for the Boltzmann equation with uncertainty. The method is based on the generalized polynomial chaos (gPC) approximation in the stochastic Galerkin framework, and can handle random inputs from collision kernel, initial data or boundary data. We show that a simple singular value decomposition of gPC related coefficients combined with the fast Fourier-spectral method (in velocity space) allows one to compute the high-dimensional collision operator very efficiently. In the spatially homogeneous case, we first prove that the analytical solution preserves the regularity of the initial data in the random space, and then use it to establish the spectral accuracy of the proposed stochastic Galerkin method. Several numerical examples are presented to illustrate the validity of the proposed scheme.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Generalized correlation integral vectors: A distance concept for chaotic dynamical systems

Several concepts of fractal dimension have been developed to characterise properties of attractors of chaotic dynamical systems. Numerical approximations of them must be calculated by finite samples of simulated trajectories. In principle, the quantities should not depend on the choice of the trajectory, as long as it provides properly distributed samples of the underlying attractor. In practice, however, the trajectories are sensitive with respect to varying initial values, small changes of the model parameters, to the choice of a solver, numeric tolerances, etc. The purpose of this paper is to present a statistically sound approach to quantify this variability. We modify the concept of correlation integral to produce a vector that summarises the variability at all selected scales. The distribution of this stochastic vector can be estimated, and it provides a statistical distance concept between trajectories. Here, we demonstrate the use of the distance for the purpose of estimating model parameters of a chaotic dynamic model. The methodology is illustrated using computational examples for the Lorenz 63 and Lorenz 95 systems, together with a framework for Markov chain Monte Carlo sampling to produce posterior distributions of model parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantification of errors in large-eddy simulations of a spatially evolving mixing layer using polynomial chaos

A stochastic approach based on generalized polynomial chaos (gPC) is used to quantify the error in large-eddy simulation (LES) of a spatially evolving mixing layer flow and its sensitivity to different simulation parameters, viz., the grid stretching in the streamwise and lateral directions and the subgrid-scale (SGS) Smagorinsky model constant (C{sub S}). The error is evaluated with respect to the results of a highly resolved LES and for different quantities of interest, namely, the mean streamwise velocity, the momentum thickness, and the shear stress. A typical feature of the considered spatially evolving flow is the progressive transition from a laminar regime, highly dependent on the inlet conditions, to a fully developed turbulent one. Therefore, the computational domain is divided in two different zones (inlet dependent and fully turbulent) and the gPC error analysis is carried out for these two zones separately. An optimization of the parameters is also carried out for both these zones. For all the considered quantities, the results point out that the error is mainly governed by the value of the C{sub S} constant. At the end of the inlet-dependent zone, a strong coupling between the normal stretching ratio and the C{sub S} value is observed. The error sensitivity to the parameter values is significantly larger in the inlet-dependent upstream region; however, low-error values can be obtained in this region for all the considered physical quantities by an ad hoc tuning of the parameters. Conversely, in the turbulent regime the error is globally lower and less sensitive to the parameter variations, but it is more difficult to find a set of parameter values leading to optimal results for all the analyzed physical quantities. A similar analysis is also carried out for the dynamic Smagorinsky model, by varying the grid stretching ratios. Comparing the databases generated with the different subgrid-scale models, it is possible to observe that the error cost function computed for the streamwise velocity and for the momentum thickness is not significantly sensitive to the used SGS closure. Conversely, the prediction of the shear stress is much more accurate when using a dynamic subgrid-scale model and the variance of the error is lower in magnitude.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The matrix product approximation for the dynamic cavity method

Stochastic dynamics of classical degrees of freedom, defined on vertices of locally tree-like graphs, can be studied in the framework of the dynamic cavity method which is exact for tree graphs. Such models correspond for example to spin-glass systems, Boolean networks, neural networks, and other technical, biological, and social networks. The central objects in the cavity method are edge messages—conditional probabilities of two vertex variable trajectories. In this paper, we discuss a rather pedagogical derivation for the dynamic cavity method, give a detailed account of the novel matrix product edge message (MPEM) algorithm for the solution of the dynamic cavity equation as introduced, and present optimizations and extensions. Matrix product approximations of the edge messages are constructed recursively in an iteration over time. Computation costs and precision can be tuned by controlling the matrix dimensions of the MPEM in truncations. Without truncations, the dynamics is exact. Data for Glauber–Ising dynamics shows a linear growth of computation costs in time. In contrast to Monte Carlo simulations, the approach has a much better error scaling. Hence, it gives for example access to low probability events and decaying observables like temporal correlations. Here, we discuss optimized truncation schemes and an extension that allows to capture models which have a continuum time limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The rigorous stochastic matrix multiplication scheme for the calculations of reduced equilibrium density matrices of open multilevel quantum systems

Understanding the roles of the temporary and spatial structures of quantum functional noise in open multilevel quantum molecular systems attracts a lot of theoretical interests. I want to establish a rigorous and general framework for functional quantum noises from the constructive and computational perspectives, i.e., how to generate the random trajectories to reproduce the kernel and path ordering of the influence functional with effective Monte Carlo methods for arbitrary spectral densities. This construction approach aims to unify the existing stochastic models to rigorously describe the temporary and spatial structure of Gaussian quantum noises. In this paper, I review the Euclidean imaginary time influence functional and propose the stochastic matrix multiplication scheme to calculate reduced equilibrium density matrices (REDM). In addition, I review and discuss the Feynman-Vernon influence functional according to the Gaussian quadratic integral, particularly its imaginary part which is critical to the rigorous description of the quantum detailed balance. As a result, I establish the conditions under which the influence functional can be interpreted as the average of exponential functional operator over real-valued Gaussian processes for open multilevel quantum systems. I also show the difference between the local and nonlocal phonons within this framework. With the stochastic matrix multiplication scheme, I compare the normalized REDM with the Boltzmann equilibrium distribution for open multilevel quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mean-Field-Game Model for Botnet Defense in Cyber-Security

We initiate the analysis of the response of computer owners to various offers of defence systems against a cyber-hacker (for instance, a botnet attack), as a stochastic game of a large number of interacting agents. We introduce a simple mean-field game that models their behavior. It takes into account both the random process of the propagation of the infection (controlled by the botner herder) and the decision making process of customers. Its stationary version turns out to be exactly solvable (but not at all trivial) under an additional natural assumption that the execution time of the decisions of the customers (say, switch on or out the defence system) is much faster that the infection rates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic Modeling in a Multimaterial Continuum Mixture Shock Physics Code

Stochastic modelling approaches are presented to capture random effects at multiple time and length scales. Random processes that occur at the microscale produce nondeterministic effects at the macroscale. Here we present three stochastic modeling approaches that describe random processes at microscopic length scales and map these processes to the macroscopic length scale. The first stochastic modeling approach is based upon a particle based numerical technique to solve a Stochastic Differential Equation (SDE) using an arbitrary diffusion process to capture random processes at the microstructural level. The second approach prescribes a Probability Density Function (PDF) for the drift and diffusion of the random variable derived using the forward and backward Kolmogorov equations. This method requires mean and drift evolution PDF transport equations. The third approach is the coupling of multiple random variables which are dependent on each other. The relationship of the PDFs and a coupling function, known as a copula, produces a Joint Probability Density Function (JPDF). These stochastic modeling approaches are implemented into a Multiple Component (MC) shock physics computational code and used to model statistical fracture and reactive flow applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Development Optimization and Uncertainty Analysis Methods for Oil and Gas Reservoirs

Uncertainty complicates the development optimization of oil and gas exploration and production projects, but methods have been devised to analyze uncertainty and its impact on optimal decision-making. This paper compares two methods for development optimization and uncertainty analysis: Monte Carlo (MC) simulation and stochastic programming. Two example problems for a gas field development and an oilfield development are solved and discussed to elaborate the advantages and disadvantages of each method. Development optimization involves decisions regarding the configuration of initial capital investment and subsequent operational decisions. Uncertainty analysis involves the quantification of the impact of uncertain parameters on the optimum design concept. The gas field development problem is designed to highlight the differences in the implementation of the two methods and to show that both methods yield the exact same optimum design. The results show that both MC optimization and stochastic programming provide unique benefits, and that the choice of method depends on the goal of the analysis. While the MC method generates more useful information, along with the optimum design configuration, the stochastic programming method is more computationally efficient in determining the optimal solution. Reservoirs comprise multiple compartments and layers with multiphase flow of oil, water, and gas. We present a workflow for development optimization under uncertainty for these reservoirs, and solve an example on the design optimization of a multicompartment, multilayer oilfield development.

02 PETROLEUM↗

A stochastic asymptotic-preserving scheme for a kinetic-fluid model for disperse two-phase flows with uncertainty

In this paper we consider a kinetic-fluid model for disperse two-phase flows with uncertainty. We propose a stochastic asymptotic-preserving (s-AP) scheme in the generalized polynomial chaos stochastic Galerkin (gPC-sG) framework, which allows the efficient computation of the problem in both kinetic and hydrodynamic regimes. The s-AP property is proved by deriving the equilibrium of the gPC version of the Fokker–Planck operator. The coefficient matrices that arise in a Helmholtz equation and a Poisson equation, essential ingredients of the algorithms, are proved to be positive definite under reasonable and mild assumptions. The computation of the gPC version of a translation operator that arises in the inversion of the Fokker–Planck operator is accelerated by a spectrally accurate splitting method. Numerical examples illustrate the s-AP property and the efficiency of the gPC-sG method in various asymptotic regimes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗