Search NASA⌕ Search

SEARCH · Search NASA

Results for “approximate 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.

At least 631 records · Page 35

Deep Learning–Assisted Multiobjective Optimization of Geological CO 2 Storage Performance under Geomechanical Risks

In geological CO 2 storage, designing the optimal well control strategy for CO 2 injection to maximize CO 2 storage while minimizing the associated geomechanical risks is not trivial. This challenge arises due to pressure buildup, CO 2 plume migration, the highly nonlinear nature of geomechanical responses to rock-fluid interaction, and the high computational cost associated with coupled flow and geomechanics simulations. In this paper, we introduce a novel optimization framework to address these challenges. The optimization problem is formulated as follows: maximize total CO 2 storage while minimizing geomechanical risks by adjusting the injection schedules within bounded constraints. The geomechanical risks are primarily driven by injection-induced pressure build-up, which is characterized by ground displacement and the induced microseismicity. We used the Fourier neural operator (FNO)-based deep learning model to construct surrogate models, replacing the time-consuming coupled flow and geomechanics simulations for evaluating the aforementioned objective functions. The developed surrogate models have been incorporated into a multiobjective optimization framework through a genetic algorithm to reduce the computational burden. The proposed optimization framework reduces the computational cost from approximately 2,400 hours, when using objective function evaluations based on physics-based simulations, to around 20 minutes. A set of Pareto-optimal solutions of the proposed workflow yields nontrivial optimal decisions, reducing the microseismicity potential and the vertical displacement. This Pareto front highlights the optimal trade-offs between CO 2 storage amount, safety, and ground displacement, emphasizing the need for careful optimization and management of injection strategies to achieve a balanced outcome. The novelty of this work is twofold. First, we demonstrate the importance of incorporating the minimization of the geomechanical risks as objective functions into the CO 2 storage optimization workflow to mitigate the potential risk of induced microseismicity and ground displacement. Second, we leverage the FNO-based surrogate models to optimize a real-field CO 2 storage operation.

42 ENGINEERING↗

Mixing Cell Model: A One-Dimensional Numerical Model for Assessment of Water Flow and Contaminant Transport in the Unsaturated Zone

This report describes the Mixing Cell Model code, a one-dimensional model for water flow and solute transport in the unsaturated zone under steady-state or transient flow conditions. The model is based on the principles and assumptions underlying mixing cell model formulations. The unsaturated zone is discretized into a series of independent mixing cells. Each cell may have unique hydrologic, lithologic, and sorptive properties. Ordinary differential equations describe the material (water and solute) balance within each cell. Water flow equations are derived from the continuity equation assuming that unit-gradient conditions exist at all times in each cell. Pressure gradients are considered implicitly through model discretization. Unsaturated hydraulic conductivity and moisture contents are determined by the material-specific moisture characteristic curves. Solute transport processes include explicit treatment of advective processes, first-order chain decay, and linear sorption reactions. Dispersion is addressed through implicit and explicit dispersion. Implicit dispersion is an inherent feature of all mixing cell models and originates from the formulation of the problem in terms of mass balance around fully mixed volume elements. Expressions are provided that relate implicit dispersion to the physical dispersion of the system. Two FORTRAN codes were developed to solve the water flow and solute transport equations: (1) the Mixing-Cell Model for Flow (MCMF) solves transient water flow problems and (2) the Mixing Cell Model for Transport (MCMT) solves the solute transport problem. The transient water flow problem is typically solved first by estimating the water flux through each cell in the model domain as a function of time using the MCMF code. These data are stored in either ASCII or binary files that are later read by the solute transport code (MCMT). Code output includes solute pore water concentrations, water and solute inventories in each cell and at each specified output time, and water and solute fluxes through each cell and specified output time. Computer run times for coupled transient water flow and solute transport were typically several seconds on a 2 GHz Intel Pentium IV desktop computer. The model was benchmarked against analytical solutions and finite-element approximations to the partial differential equations (PDE) describing unsaturated flow and transport. Differences between the maximum solute flux estimated by the mixing-cell model and the PDE models were typically less than two percent.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Mixing Cell Model: A One-Dimensional Numerical Model for Assessment of Water Flow and Contaminant Transport in the Unsaturated Zone

This report describes the Mixing Cell Model code, a one-dimensional model for water flow and solute transport in the unsaturated zone under steady-state or transient flow conditions. The model is based on the principles and assumptions underlying mixing cell model formulations. The unsaturated zone is discretized into a series of independent mixing cells. Each cell may have unique hydrologic, lithologic, and sorptive properties. Ordinary differential equations describe the material (water and solute) balance within each cell. Water flow equations are derived from the continuity equation assuming that unit-gradient conditions exist at all times in each cell. Pressure gradients are considered implicitly through model discretization. Unsaturated hydraulic conductivity and moisture contents are determined by the material-specific moisture characteristic curves. Solute transport processes include explicit treatment of advective processes, first-order chain decay, and linear sorption reactions. Dispersion is addressed through implicit and explicit dispersion. Implicit dispersion is an inherent feature of all mixing cell models and originates from the formulation of the problem in terms of mass balance around fully mixed volume elements. Expressions are provided that relate implicit dispersion to the physical dispersion of the system. Two FORTRAN codes were developed to solve the water flow and solute transport equations: (1) the Mixing-Cell Model for Flow (MCMF) solves transient water flow problems and (2) the Mixing Cell Model for Transport (MCMT) solves the solute transport problem. The transient water flow problem is typically solved first by estimating the water flux through each cell in the model domain as a function of time using the MCMF code. These data are stored in either ASCII or binary files that are later read by the solute transport code (MCMT). Code output includes solute pore water concentrations, water and solute inventories in each cell and at each specified output time, and water and solute fluxes through each cell and specified output time. Computer run times for coupled transient water flow and solute transport were typically several seconds on a 2 GHz Intel Pentium IV desktop computer. The model was benchmarked against analytical solutions and finite-element approximations to the partial differential equations (PDE) describing unsaturated flow and transport. Differences between the maximum solute flux estimated by the mixing-cell model and the PDE models were typically less than two percent.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

360⁰ -View of Quantum Theory and Ab Initio Simulation at Extreme Conditions: 2014 Sanibel Symposium

The Sanibel Symposium 2014 was held February 16-21, 2014, at the King and Prince, St. Simons Island, GA. It was successful in bringing condensed-matter physicists and quantum chemists together productively to drive the emergence of those specialties. The Symposium had a significant role in preparing a whole generation of quantum theorists. The 54th Sanibel meeting looked to the future in two ways. We had 360⁰-View sessions to honor the exceptional contributions of Rodney Bartlett (70), Bill Butler (70), Yngve Öhrn (80), Fritz Schaefer (70), and Malcolm Stocks (70). The work of these five has greatly impacted several generations of quantum chemists and condensed matter physicists. The “360⁰” is the sum of their ages. More significantly, it symbolizes a panoramic view of critical developments and accomplishments in theoretical and computational chemistry and physics oriented toward the future. Thus, two of the eight 360⁰-View sessions focused specifically on younger scientists. The 360⁰-View program was the major component of the 2014 Sanibel meeting. Another four sessions included a sub-symposium on ab initio Simulations at Extreme Conditions, with focus on getting past the barriers of present-day Born-Oppenheimer molecular dynamics by advances in finite-temperature density functional theory, orbital-free DFT, and new all-numerical approaches.

360-view↗

Formulation And Implementation of A 1.75D Streamer Model

Streamers are a type of ionization wave occurring during the early time phase of a gas discharge. They are typically launched when the evolving space charge of an electron avalanche reaches a certain critical level, beyond which the field of the space charge itself is sufficient to drive further evolution of the ionization process. One of the most common ways to model streamers is known as a 1.5D model where the field of a uniformly charged set of discs of chosen radius is evaluated along the cylinder axis. This field drives a one-dimensional kinetic ionization process, which results in the nonlinear evolution of the streamer. This model is efficient, but has the drawback of fixing the radius and requiring it as an input parameter. Previously, we tried to extend the 1.5D model to include evolution of its radius by developing a two-step process of axial and radial expansion but we encountered stability issues with the model that we thought could have been due to decoupling the two steps. In this report we introduce a new formulation of a streamer model that includes radial expansion. The goal is to take radial moments of the starting axisymmetric fluid equations and thereby include the radial evolution of the streamer naturally and self-consistently from the beginning. We first develop the fluid model moments without electron attachment. We review the calculation of the electric fields required for the model and investigate approximations to improve computational efficiency. We discuss the code implementation of the model and finally, we add attachment to allow the treatment of electronegative gases.

42 ENGINEERING↗

EVALUATION OF U10MO FUEL PLATE IRRADIATION BEHAVIOR VIA NUMERICAL AND EXPERIMENTAL BENCHMARKING

This article analyzes dimensional changes due to irradiation of monolithic plate-type nuclear fuel and compares results with finite element analysis of the plates during fabrication and irradiation. Monolithic fuel plates tested in the Advanced Test Reactor (ATR) at Idaho National Lab (INL) are being used to benchmark proposed fuel performance for several high power research reactors. Post-irradiation metallographic images of plates sectioned at the midpoint were analyzed to determine dimensional changes of the fuel and the cladding response. A constitutive model of the fabrication process and irradiation behavior of the tested plates was developed using the general purpose commercial finite element analysis package, Abaqus. Using calculated burn-up profiles of irradiated plates to model the power distribution and including irradiation behaviors such as swelling and irradiation enhanced creep, model simulations allow analysis of plate parameters that are either impossible or infeasible in an experimental setting. The development and progression of fabrication induced stress concentrations at the plate edges was of primary interest, as these locations have a unique stress profile during irradiation. Additionally, comparison between 2D and 3D models was performed to optimize analysis methodology. In particular, the ability of 2D and 3D models account for out of plane stresses which result in 3-dimensional creep behavior that is a product of these components. Results show that assumptions made in 2D models for the out-of-plane stresses and strains cannot capture the 3-dimensional physics accurately and thus 2D approximations are not computationally accurate. Stress-strain fields are dependent on plate geometry and irradiation conditions, thus, if stress based criteria is used to predict plate behavior (as opposed to material impurities, fine micro-structural defects, or sharp power gradients), unique 3D finite element formulation for each plate is required.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Systems and methods for determining optimal parameters for dynamic quantum clustering analyses

In the present work, quantum clustering is extended to provide a dynamical approach for data clustering using a time-dependent Schrodinger equation. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering. Additionally, the parameters of the analysis can be modified in order to improve the efficiency of the dynamic quantum clustering processes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Closed-Form Approximation of the Total Variation Proximal Operator

Total variation (TV) is a widely used function for regularizing imaging inverse problems that is particularly appropriate for images whose underlying structure is piecewise constant. TV regularized optimization problems are typically solved using proximal methods, but the way in which they are applied is constrained by the absence of a closed-form expression for the proximal operator of the TV function. A closed-form approximation of the TV proximal operator has previously been proposed, but its accuracy was not theoretically explored in detail. Here, we address this gap by making several new theoretical contributions, proving that the approximation leads to a proximal operator of some convex function, it is equivalent to a gradient descent step on a smoothed version of TV, and that its error can be fully characterized and controlled with its scaling parameter. We experimentally validate our theoretical results on image denoising and sparse-view computed tomography (CT) image reconstruction.

97 MATHEMATICS AND COMPUTING↗

Ultra-Scale Computing for Emergency Evacuation

Emergency evacuations are carried out in anticipation of a disaster such as hurricane landfall or flooding, and in response to a disaster that strikes without a warning. Existing emergency evacuation modeling and simulation tools are primarily designed for evacuation planning and are of limited value in operational support for real time evacuation management. In order to align with desktop computing, these models reduce the data and computational complexities through simple approximations and representations of real network conditions and traffic behaviors, which rarely represent real-world scenarios. With the emergence of high resolution physiographic, demographic, and socioeconomic data and supercomputing platforms, it is possible to develop micro-simulation based emergency evacuation models that can foster development of novel algorithms for human behavior and traffic assignments, and can simulate evacuation of millions of people over a large geographic area. However, such advances in evacuation modeling and simulations demand computational capacity beyond the desktop scales and can be supported by high performance computing platforms. This paper explores the motivation and feasibility of ultra-scale computing for increasing the speed of high resolution emergency evacuation simulations.

99 GENERAL AND MISCELLANEOUS↗

Random Phase Approximation Correlation Energy Using Real-Space Density Functional Perturbation Theory

We present a real-space method for computing the random phase approximation (RPA) correlation energy within Kohn–Sham density functional theory, leveraging the low-rank nature of the frequency-dependent density response operator. In particular, we employ a cubic-scaling formalism based on density functional perturbation theory that circumvents the calculation of the response function matrix, instead relying on the ability to compute its product with a vector through the solution of the associated Sternheimer linear systems. We develop a large-scale parallel implementation of this formalism using the subspace iteration method in conjunction with the spectral quadrature method while employing the Kronecker product-based method for the application of the Coulomb operator and the conjugate orthogonal conjugate gradient method for the solution of the linear systems. We demonstrate convergence with respect to key parameters and verify the method’s accuracy by comparing with plane-wave results. We show that the framework achieves good strong scaling to many thousands of processors, reducing the time to solution for a lithium hydride system with 128 electrons to around 150 s on 4608 processors.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fast Emulation of Expensive Simulations using Approximate Gaussian Processes [Slides]

Nuclear Computational Low-Energy Initiative (NUCLEI) collaboration uses Density Functional Theory (DFT) simulations to predict the structure and binding energies of nuclei over a wide range of proton (Z) and neutron (N) numbers. The DFT simulations utilize a particular parameterization of a Skyrme energy density functional called UNEDF1 which depends on 12 free parameters that must be fit to data (M Kortelainen et al 2014). Fitting involves comparing (e.g.) predicted binding energies of nuclei to experimentally measured values. We use only binding energies as observables, but DFT with UNEDF1 will predict structure (shape) observables as well. In this work, assessing the capability of approximate GP emulators to balance emulator accuracy with computational speed to facilitate improved UNEDF1 calibration. Sparse GPs are straightforward to train and accurate. Calibration is not straightforward with MCMC (using MH or HMC/NUTS). We produced reusable software for continuing and building on this work as well as accessing and using Darwin cluster compute resources

97 MATHEMATICS AND COMPUTING↗

Minimal Energy Routing of a Leader and a Wingmate with Periodic Connectivity

We consider a route planning problem in which two unmanned vehicles are required to complete a set of tasks present at distinct locations, referred to as targets, with minimum energy consumption. The mission environment is hazardous, and to ensure a safe operation, the UVs are required to communicate with each other at every target they visit. The problem objective is to determine the allocation of the tasks to the UVs and plan tours for the UVs to visit the targets such that the weighted sum of the distances traveled by the UVs and the distances traveled by the communicating signals between them is minimized. We formulate this problem as an Integer program and show that naively solving the problem using commercially available off-the-shelf solvers is insufficient in determining scalable solutions efficiently. To address this computational challenge, we develop an approximation and a heuristic algorithm, and employ them to compute high-quality solutions to a special case of the problem where equal weights are assigned to the distances traveled by the vehicles and the communicating signals. For this special case, we show that the approximation algorithm has a fixed approximation ratio of 3.75. We also develop lower bounds to the optimal cost of the problem to evaluate the performance of these algorithms on large-scale instances. We demonstrate the performance of these algorithms on 500 randomly generated instances with the number of targets ranging from 6 to 100, and show that the algorithms provide high-quality solutions to the problem swiftly; the average computation time of the algorithmic solutions is within a fraction of a second for instances with at most 100 targets. Finally, we show that the approximation ratio has a variable ratio for the weighted case of the problem. Specifically, if ρ denotes the ratio of the weights assigned to the distances representing the communication and travel costs, the algorithm has an a posteriori ratio of $3 + \frac{3ρ}{4}$ when ρ ≥ 1, and $\frac{3}{ρ}$ + $\frac{3}{4}$ when ρ ≤ 1.

42 ENGINEERING↗

Tool employing homotopy-based approaches in finding the controlling unstable equilibrium point in the electric power grid

The analysis tool employs a computer-implemented algorithm that uses homotopy-based approaches to map the solution from the exit point to the controlling unstable equilibrium point (UEP). The computational time is reduced significantly by using an approximate exit point rather than computing an accurate exit point as it is required in finding the controlling UEPs using traditional transient stability direct methods. In addition, this method eliminates the necessity of computing the minimum gradient point (MGP) which is a key element in using Newton methods. These properties provide an advantage to homotopy-based approaches over traditional iterative methods in terms of both speed of computation and reliability of finding solutions.

97 MATHEMATICS AND COMPUTING↗

Validation of GPUMCD for low-energy brachytherapy seed dosimetry

Purpose: To validate GPUMCD, a new package for fast Monte Carlo dose calculations based on the GPU (graphics processing unit), as a tool for low-energy single seed brachytherapy dosimetry for specific seed models. As the currently accepted method of dose calculation in low-energy brachytherapy computations relies on severe approximations, a Monte Carlo based approach would result in more accurate dose calculations, taking in to consideration the patient anatomy as well as interseed attenuation. The first step is to evaluate the capability of GPUMCD to reproduce low-energy, single source, brachytherapy calculations which could ultimately result in fast and accurate, Monte Carlo based, brachytherapy dose calculations for routine planning. Methods: A mixed geometry engine was integrated to GPUMCD capable of handling parametric as well as voxelized geometries. In order to evaluate GPUMCD for brachytherapy calculations, several dosimetry parameters were computed and compared to values found in the literature. These parameters, defined by the AAPM Task-Group No. 43, are the radial dose function, the 2D anisotropy function, and the dose rate constant. These three parameters were computed for two different brachytherapy sources: the Amersham OncoSeed 6711 and the Imagyn IsoStar IS-12501. Results: GPUMCD was shown to yield dosimetric parameters similar to those found in the literature. It reproduces radial dose functions to within 1.25% for both sources in the 0.5< r <10 cm range. The 2D anisotropy function was found to be within 3% at r = 5 cm and within 4% at r = 1 cm. The dose rate constants obtained were within the range of other values reported in the literature.Conclusion: GPUMCD was shown to be able to reproduce various TG-43 parameters for two different low-energy brachytherapy sources found in the literature. The next step is to test GPUMCD as a fast clinical Monte Carlo brachytherapy dose calculations with multiple seeds and patient geometry, potentially providing more accurate results than the TG-43 formalism while being much faster than calculations using general purpose Monte Carlo codes.

61 RADIATION PROTECTION AND DOSIMETRY↗

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING↗

Multi-element least square HDMR methods and their applications for stochastic multiscale model reduction

Stochastic multiscale modeling has become a necessary approach to quantify uncertainty and characterize multiscale phenomena for many practical problems such as flows in stochastic porous media. The numerical treatment of the stochastic multiscale models can be very challengeable as the existence of complex uncertainty and multiple physical scales in the models. To efficiently take care of the difficulty, we construct a computational reduced model. To this end, we propose a multi-element least square high-dimensional model representation (HDMR) method, through which the random domain is adaptively decomposed into a few subdomains, and a local least square HDMR is constructed in each subdomain. These local HDMRs are represented by a finite number of orthogonal basis functions defined in low-dimensional random spaces. The coefficients in the local HDMRs are determined using least square methods. We paste all the local HDMR approximations together to form a global HDMR approximation. To further reduce computational cost, we present a multi-element reduced least-square HDMR, which improves both efficiency and approximation accuracy in certain conditions. To effectively treat heterogeneity properties and multiscale features in the models, we integrate multiscale finite element methods with multi-element least-square HDMR for stochastic multiscale model reduction. This approach significantly reduces the original model's complexity in both the resolution of the physical space and the high-dimensional stochastic space. We analyze the proposed approach, and provide a set of numerical experiments to demonstrate the performance of the presented model reduction techniques. - Highlights: • Multi-element least square HDMR is proposed to treat stochastic models. • Random domain is adaptively decomposed into some subdomains to obtain adaptive multi-element HDMR. • Least-square reduced HDMR is proposed to enhance computation efficiency and approximation accuracy in certain conditions. • Integrating MsFEM and multi-element least square HDMR can significantly reduce computation complexity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Approximate Weighted Matching On Emerging Manycore and Multithreaded Architectures

Graph matching is a prototypical combinatorial problem with many applications in computer science and scientific computing, but algorithms for computing optimal matchings are challenging to parallelize. Approximate matching algorithms provide an alternate route for parallelization, and in many contexts compute near-optimal matchings for large-scale graphs. We present sharedmemory parallel implementations for computing half-approximate weighted matching on state-of-the-art multicore (Intel Nehalem and AMD Magny-Cours), manycore (Nvidia Tesla and Nvidia Fermi) and massively multithreaded (Cray XMT) platforms. We provide two implementations: the first implementation uses shared work queues, and is suited to all these platforms; the second implementation is based on dataflow principles, and exploits the architectural features of the Cray XMT. Using a carefully chosen dataset that exhibits characteristics from a wide range of real-world applications, we show scalable performance across different platforms. In particular, for one instance of the input, an R-MAT graph (RMAT-G), we show speedups of: about 32 on 48 cores of an AMD Magny-Cours; 7 on 8 cores of Intel Nehalem; 3 on Nvidia Tesla and 10 on Nvidia Fermi relative to one core of Intel Nehalem; and 60 on 128 processors of Cray XMT. We demonstrate good weak and strong scaling for graphs with up to a billion edges using up to 12, 800 threads. Given the breadth of this work, we focus on simplicity and portability of software rather than excessive fine-tuning for each platform. To the best of our knowledge, this is the first such large-scale study of the half-approximate weighted matching problem on shared-memory platforms. Driven by the critical enabling role of combinatorial algorithms such as matching in scientific computing and the emergence of informatics applications, there is a growing demand to support irregular computations on current and future computing platforms. In this context, we evaluate the capability of emerging multithreaded platforms to tolerate latency induced by irregular memory access patterns, and to support fine-grained parallelism via light-weight synchronization mechanisms. By contrasting the architectural features of these platforms against the Cray XMT, which is specifically designed to support irregular memory-intensive applications, we delineate the impact of these choices on performance.

Halappanavar, Mahantesh↗

VAN-DAMME: GPU-accelerated and symmetry-assisted quantum optimal control of multi-qubit systems

We present an open-source software package, VAN-DAMME (Versatile Approaches to Numerically Design, Accelerate, and Manipulate Magnetic Excitations), for massively-parallelized quantum optimal control (QOC) calculations of multi-qubit systems. To enable large QOC calculations, the VAN-DAMME software package utilizes symmetry-based techniques with custom GPU-enhanced algorithms. This combined approach allows for the simultaneous computation of hundreds of matrix exponential propagators that efficiently leverage the intra-GPU parallelism found in high-performance GPUs. In addition, to maximize the computational efficiency of the VAN-DAMME code, we carried out several extensive tests on data layout, computational complexity, memory requirements, and performance. These extensive analyses allowed us to develop computationally efficient approaches for evaluating complex-valued matrix exponential propagators based on Padé approximants. To assess the computational performance of our GPU-accelerated VAN-DAMME code, we carried out QOC calculations of systems containing 10 - 15 qubits, which showed that our GPU implementation is 18.4× faster than the corresponding CPU implementation. Our GPU-accelerated enhancements allow efficient calculations of multi-qubit systems, which can be used for the efficient implementation of QOC applications across multiple domains.

97 MATHEMATICS AND COMPUTING↗