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 1,225 records · Page 68

Variational quantum simulation of the critical Ising model with symmetry averaging

Here we investigate the use of deep multiscale entanglement renormalization ansatz (DMERA) circuits as a variational ansatz. We use the exactly solvable one-dimensional critical transverse-field Ising model as a test bed. Numerically exact simulation of the quantum circuit ansatz can in this case be carried out to hundreds of qubits by exploiting efficient classical algorithms for simulating matchgate circuits. We find that, for this system, the DMERA strongly outperforms a standard quantum approximate optimization algorithm (QAOA)–style ansatz, and that a major source of systematic error in correlation functions approximated using the DMERA is the breaking of the translational and Kramers-Wannier symmetries of the transverse-field Ising model. We are able to reduce this error by up to four orders of magnitude by symmetry averaging, without incurring additional cost in qubits or circuit depth. Here, we propose that this technique for mitigating systematic error could be applied to noisy intermediate-scale quantum (NISQ) simulations of physical systems with other symmetries.

1-dimensional spin chains↗

A First-Passage Kinetic Monte Carlo method for reaction–drift–diffusion processes

Stochastic reaction–diffusion models are now a popular tool for studying physical systems in which both the explicit diffusion of molecules and noise in the chemical reaction process play important roles. The Smoluchowski diffusion-limited reaction model (SDLR) is one of several that have been used to study biological systems. Exact realizations of the underlying stochastic processes described by the SDLR model can be generated by the recently proposed First-Passage Kinetic Monte Carlo (FPKMC) method. This exactness relies on sampling analytical solutions to one and two-body diffusion equations in simplified protective domains. In this work we extend the FPKMC to allow for drift arising from fixed, background potentials. As the corresponding Fokker–Planck equations that describe the motion of each molecule can no longer be solved analytically, we develop a hybrid method that discretizes the protective domains. The discretization is chosen so that the drift–diffusion of each molecule within its protective domain is approximated by a continuous-time random walk on a lattice. New lattices are defined dynamically as the protective domains are updated, hence we will refer to our method as Dynamic Lattice FPKMC or DL-FPKMC. We focus primarily on the one-dimensional case in this manuscript, and demonstrate the numerical convergence and accuracy of our method in this case for both smooth and discontinuous potentials. We also present applications of our method, which illustrate the impact of drift on reaction kinetics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Coefficient-to-Basis Network: a fine-tunable operator learning framework for inverse problems with adaptive discretizations and theoretical guarantees

We propose a Coefficient-to-Basis Network (C2BNet), a novel framework for solving inverse problems within the operator learning paradigm. C2BNet efficiently adapts to different discretizations through fine-tuning, using a pre-trained model to significantly reduce computational cost while maintaining high accuracy. Unlike traditional approaches that require retraining from scratch for new discretizations, our method enables seamless adaptation without sacrificing predictive performance. Furthermore, we establish theoretical approximation and generalization error bounds for C2BNet by exploiting low-dimensional structures in the underlying datasets. Our analysis demonstrates that C2BNet adapts to low-dimensional structures without relying on explicit encoding mechanisms, highlighting its robustness and efficiency. To validate our theoretical findings, we conducted extensive numerical experiments that showcase the superior performance of C2BNet on several inverse problems. The results confirm that C2BNet effectively balances computational efficiency and accuracy, making it a promising tool to solve inverse problems in scientific computing and engineering applications.

97 MATHEMATICS AND COMPUTING↗

Universal linear Bogoliubov transformations through one-way quantum computation

We show explicitly how to realize an arbitrary linear unitary Bogoliubov (LUBO) transformation on a multimode quantum state through homodyne-based one-way quantum computation. Any LUBO transformation can be approximated by means of a fixed, finite-sized, sufficiently squeezed Gaussian cluster state that allows for the implementation of beam splitters (in form of three-mode connection gates) and general one-mode LUBO transformations. In particular, we demonstrate that a linear four-mode cluster state is a sufficient resource for an arbitrary one-mode LUBO transformation. Arbitrary-input quantum states including non-Gaussian states could be efficiently attached to the cluster through quantum teleportation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Haar-Like Wavelets on Hierarchical Trees

Here, discrete wavelet methods, originally formulated in the setting of regularly sampled signals, can be adapted to data defined on a point cloud if some multiresolution structure is imposed on the cloud. A wide variety of hierarchical clustering algorithms can be used for this purpose, and the multiresolution structure obtained can be encoded by a hierarchical tree of subsets of the cloud. Prior work introduced the use of Haar-like bases defined with respect to such trees for approximation and learning tasks on unstructured data. This paper builds on that work in two directions. First, we present an algorithm for constructing Haar-like bases on general discrete hierarchical trees. Second, with an eye towards data compression, we present thresholding techniques for data defined on a point cloud with error controlled in the $L$ $\infty$ norm and in a Hölder-type norm. In a concluding trio of numerical examples, we apply our methods to compress a point cloud dataset, study the tightness of the $L$ $\infty$ error bound, and use thresholding to identify MNIST classifiers with good generalizability.

97 MATHEMATICS AND COMPUTING↗

Optimizing multigrid reduction-in-time and Parareal coarse-grid operators for linear advection

Parallel-in-time methods, such as multigrid reduction-in-time (MGRIT) and Parareal, provide an attractive option for increasing concurrency when simulating time-dependent partial differential equations (PDEs) in modern high-performance computing environments. While these techniques have been very successful for parabolic equations, it has often been observed that their performance suffers dramatically when applied to advection-dominated problems or purely hyperbolic PDEs using standard rediscretization approaches on coarse grids. In this paper, we apply MGRIT or Parareal to the constant-coefficient linear advection equation, appealing to existing convergence theory to provide insight into the typically nonscalable or even divergent behavior of these solvers for this problem. To overcome these failings, we replace rediscretization on coarse grids with improved coarse-grid operators that are computed by applying optimization techniques to approximately minimize error estimates from the convergence theory. Therefore, one of our main findings is that, in order to obtain fast convergence as for parabolic problems, coarse-grid operators should take into account the behavior of the hyperbolic problem by tracking the characteristic curves. Our approach is tested for schemes of various orders using explicit or implicit Runge–Kutta methods combined with upwind-finite-difference spatial discretizations. In all cases, we obtain scalable convergence in just a handful of iterations, with parallel tests also showing significant speed-ups over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗

Minimising the error in eigenvalue calculations involving the Boltzmann transport equation using goal-based adaptivity on unstructured meshes

This article presents a method for goal-based anisotropic adaptive methods for the finite element method applied to the Boltzmann transport equation. The neutron multiplication factor, k{sub eff}, is used as the goal of the adaptive procedure. The anisotropic adaptive algorithm requires error measures for k{sub eff} with directional dependence. General error estimators are derived for any given functional of the flux and applied to k{sub eff} to acquire the driving force for the adaptive procedure. The error estimators require the solution of an appropriately formed dual equation. Forward and dual error indicators are calculated by weighting the Hessian of each solution with the dual and forward residual respectively. The Hessian is used as an approximation of the interpolation error in the solution which gives rise to the directional dependence. The two indicators are combined to form a single error metric that is used to adapt the finite element mesh. The residual is approximated using a novel technique arising from the sub-grid scale finite element discretisation. Two adaptive routes are demonstrated: (i) a single mesh is used to solve all energy groups, and (ii) a different mesh is used to solve each energy group. The second method aims to capture the benefit from representing the flux from each energy group on a specifically optimised mesh. The k{sub eff} goal-based adaptive method was applied to three examples which illustrate the superior accuracy in criticality problems that can be obtained.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Biased degenerate ground-state sampling of small Ising models with converged quantum approximate optimization algorithm

The quantum alternating operator ansatz, a generalization of the quantum approximate optimization algorithm (QAOA), is a quantum algorithm used for approximately solving combinatorial optimization problems. QAOA typically uses the transverse field mixer as the driving Hamiltonian. One of the interesting properties of the transverse field driving Hamiltonian is that it results in nonuniform sampling of degenerate ground states of optimization problems. In this study, we numerically examine the fair sampling properties of the transverse field mixer QAOA, and Grover mixer QAOA (GM-QAOA), which provides theoretical guarantees of fair sampling of degenerate optimal solutions, up to a large enough p such that the mean expectation value converges to an optimal approximation ratio of 1. This comparison is performed with high-quality heuristically computed, but not necessarily optimal, QAOA angles, which give strictly monotonically improving solution quality as p increases. These angles are computed using the Julia based numerical simulation software JuliQAOA. Fair sampling of degenerate ground states is quantified using the Shannon entropy of the ground-state amplitudes distribution. The fair sampling properties are reported on several quantum signature Hamiltonians from previous quantum annealing fair sampling studies. Small random fully connected spin glasses are shown, which exhibit exponential suppression of some degenerate ground states with transverse field mixer QAOA. The transverse field mixer QAOA simulations show that some problem instances clearly saturate the Shannon entropy of 0 with a maximally biased distribution that occurs when the learning converges to an approximation ratio of 1 while other problem instances never deviate from a maximum Shannon entropy (uniform distribution) at any p step. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computing Free Energies with Fluctuation Relations on Quantum Computers

As a central thermodynamic property, free energy enables the calculation of virtually any equilibrium property of a physical system, allowing for the construction of phase diagrams and predictions about transport, chemical reactions, and biological processes. Thus, methods for efficiently computing free energies, which in general is a difficult problem, are of great interest to broad areas of physics and the natural sciences. The majority of techniques for computing free energies target classical systems, leaving the computation of free energies in quantum systems less explored. Recently developed fluctuation relations enable the computation of free energy differences in quantum systems from an ensemble of dynamic simulations. While performing such simulations is exponentially hard on classical computers, quantum computers can efficiently simulate the dynamics of quantum systems. Here, we present an algorithm utilizing a fluctuation relation known as the Jarzynski equality to approximate free energy differences of quantum systems on a quantum computer. In this work we discuss under which conditions our approximation becomes exact, and under which conditions it serves as a strict upper bound. Furthermore, we successfully demonstrate a proof of concept of our algorithm using the transverse field Ising model on a real quantum processor. As quantum hardware continues to improve, we anticipate that our algorithm will enable computation of free energy differences for a wide range of quantum systems useful across the natural sciences.

97 MATHEMATICS AND COMPUTING↗

Scaling Limits and Generic Bounds for Exploration Processes

We consider exploration algorithms of the random sequential adsorption type both for homogeneous random graphs and random geometric graphs based on spatial Poisson processes. At each step, a vertex of the graph becomes active and its neighboring nodes become blocked. Given an initial number of vertices N growing to infinity, we study statistical properties of the proportion of explored (active or blocked) nodes in time using scaling limits. We obtain exact limits for homogeneous graphs and prove an explicit central limit theorem for the final proportion of active nodes, known as the jamming constant, through a diffusion approximation for the exploration process which can be described as a unidimensional process. We then focus on bounding the trajectories of such exploration processes on random geometric graphs, i.e., random sequential adsorption. As opposed to exploration processes on homogeneous random graphs, these do not allow for such a dimensional reduction. Instead we derive a fundamental relationship between the number of explored nodes and the discovered volume in the spatial process, and we obtain generic bounds for the fluid limit and jamming constant: bounds that are independent of the dimension of space and the detailed shape of the volume associated to the discovered node. Lastly, using coupling techinques, we give trajectorial interpretations of the generic bounds.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ISCOs in AdS/CFT

Abstract We study stable circular orbits in spherically symmetric AdS black holes in various dimensions and their limiting innermost stable circular orbits. We provide analytic expressions for their size, angular velocity and angular momentum in a large black hole mass regime. The dual interpretation is in terms of meta-stable states not thermalising in typical thermal scales and whose existence is due to non-perturbative effects on the spatial curvature. Our calculations reproduce the binding energy known in the literature, but also include a binding energy in the radial fluctuations corresponding to near circular trajectories. We also describe how particles are placed on these orbits from integrated operators on the boundary: they tunnel inside in a way that can be computed from both complex geodesics in the black hole background and from the WKB approximation of the wave equation. We explain how these two computations are related.

Astronomy & Astrophysics↗

Clustering in massive neutrino cosmologies via Eulerian Perturbation Theory

We introduce an Eulerian Perturbation Theory to study the clustering of tracers for cosmologies in the presence of massive neutrinos. Our approach is based on mapping recently-obtained Lagrangian Perturbation Theory results to the Eulerian framework. We add Effective Field Theory counterterms, IR-resummations and a biasing scheme to compute the one-loop redshift-space power spectrum. To assess our predictions, we compare the power spectrum multipoles against synthetic halo catalogues from the QUIJOTE simulations, finding excellent agreement on scales k ≲ 0.25 h Mpc-1. One can obtain the same fitting accuracy using higher wave-numbers, but then the theory fails to give a correct estimation of the linear bias parameter. We further discuss the implications for the tree-level bispectrum. Finally, calculating loop corrections is computationally costly, hence we derive an accurate approximation wherein we retain only the main features of the kernels, as produced by changes to the growth rate. As a result, we show how FFTLog methods can be used to further accelerate the loop computations with these reduced kernels.

79 ASTRONOMY AND ASTROPHYSICS↗

Hydrodynamics of nonintegrable systems from a relaxation-time approximation

We develop a general kinetic theory framework to describe the hydrodynamics of strongly interacting, nonequilibrium quantum systems in which integrability is weakly broken, leaving a few residual conserved quantities. This framework is based on a generalized relaxation-time approximation; it gives a simple, but surprisingly accurate, prescription for computing nonequilibrium transport even in strongly interacting systems. We validate the predictions of this approximation against matrix product operator calculations on chaotic quantum spin chains, finding surprisingly good agreement. Lastly, we show that despite its simplicity, our framework can capture phenomena distinctive to strongly interacting systems, such as widely separated charge and energy diffusion constants.

1-dimensional spin chains↗

Global error analysis of the Chebyshev rational approximation method

The Chebyshev rational approximation method (CRAM) has become a widely adopted method for solving nuclear depletion problems. Therefore, understanding CRAM’s accuracy is important for the safe operation of nuclear power plants. This article performs a global error analysis of CRAM and finds that, as the length of the time step approaches zero, the relative error measured between the exact and CRAM solutions at a fixed end time approaches one and infinity for even and odd orders, respectively; for intermediate time step sizes, a minimum in relative error is observed. Finally, we show that the reason for CRAM’s behavior is that the method is inconsistent. Two best practices for using CRAM, derived from these results, are: (1) use CRAM order 16 or higher, (2) if necessary, increase the CRAM order when multiphysics coupling requires smaller time steps.

97 MATHEMATICS AND COMPUTING↗

High-order parabolic beam approximation for aero-optics

The parabolic beam equations are solved using high-order compact differences for the Laplacians and Runge-Kutta integration along the beam path. The solution method is verified by comparison to analytical solutions for apertured beams and both constant and complex index of refraction. An adaptive 4th-order Runge-Kutta using an embedded 2nd-order method is presented that has demonstrated itself to be very robust. For apertured beams, the results show that the method fails to capture near aperture effects due to a violation of the paraxial approximation in that region. Initial results indicate that the problem appears to be correctable by successive approximations. A preliminary assessment of the effect of turbulent scales is undertaken using high-order Lagrangian interpolation. The results show that while high fidelity methods are necessary to accurately capture the large scale flow structure, the method may not require the same level of fidelity in sampling the density for the index of refraction. The solution is used to calculate a phase difference that is directly compared with that commonly calculated via the optical path difference. Propagation through a supersonic boundary layer shows that for longer wavelengths, the traditional method to calculate the optical path is less accurate than for shorter wavelengths. While unlikely to supplant more traditional methods for most aero-optics applications, the current method can be used to give a quantitative assessment of the other methods as well as being amenable to the addition of more physics.

97 MATHEMATICS AND COMPUTING↗

Attributes from NMIS Time Coincidence, Fast-Neutron Imaging, Fission Mapping, And Gamma-Ray Spectrometry Data

This work tests a systematic procedure for analyzing data acquired by the Nuclear Materials Identification System (NMIS) at Oak Ridge National Laboratory with fast-neutron imaging and high-purity germanium (HPGe) gamma spectrometry capabilities. NMIS has been under development by the US Department of Energy Office of Nuclear Verification since the mid-1990s, and prior to that by the National Nuclear Security Administration Y-12 National Security Complex, with NMIS having been used at Y-12 for template matching to confirm inventory and receipts. In this present work, a complete set of NMIS time coincidence, fast-neutron imaging, fission mapping, and HPGe gamma-ray spectrometry data was obtained from Monte Carlo simulations for a configuration of fissile and nonfissile materials. The data were then presented for analysis to someone who had no prior knowledge of the unknown object to accurately determine the description of the object by applying the previously mentioned procedure to the simulated data. The best approximation indicated that the unknown object was composed of concentric cylinders: a void inside highly enriched uranium (HEU) (84.7 {+-} 1.9 wt % 235 U), surrounded by depleted uranium, surrounded by polyethylene. The final estimation of the unknown object had the correct materials and geometry, with error in the radius estimates of material regions varying from 1.58% at best and 4.25% at worst; error in the height estimates varied from 2% to 12%. The error in the HEU enrichment estimate was 5.9 wt % (within 2.5Σ of the true value). The accuracies of the determinations could be adequate for arms control applications. Future work will apply this iterative reconstructive procedure to other unknown objects to further test and refine it.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Self-consistent calculation of nuclear photoabsorption cross sections: Finite amplitude method with Skyrme functionals in the three-dimensional real space

The finite amplitude method (FAM), which we have recently proposed [T. Nakatsukasa, T. Inakura, and K. Yabana, Phys. Rev. C 76, 024318 (2007)], significantly simplifies the fully self-consistent calculation of the random-phase approximation (RPA). This article presents a computational scheme of FAM suitable for systematic investigation and shows its performance for realistic Skyrme energy functionals. We adopt the mixed representation in which the forward and backward RPA amplitudes are represented by index of hole orbitals and of the spatial grid points for the three-dimensional real space. We solve a linear algebraic problem with a sparse non-Hermitian matrix, using an iterative method. We show results of the dipole response for selected spherical and deformed nuclei. The calculated peak energies of the giant dipole resonance well agree with experiments for heavy nuclei. However, they are systematically underestimated for light nuclei. We also discuss the width of the giant dipole resonance in the fully self-consistent RPA calculation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Enhancing photoionization rate calculations in low-temperature plasmas using spectral methods

Photoionization plays a central role in the development of streamer discharges and other non-equilibrium plasma phenomena. It creates seed electrons, which are essential for positive streamer propagation, allowing the ionization front to move forward. Because of this, accurate modeling of photoionization is very important for predicting streamer behavior and plasma evolution. The photoionization process in air (N 2 – O 2 mixture) is often described by the Zheleznyak model (1982). This model is usually solved through Helmholtz-type equations that approximate the Zheleznyak photoionization model (Zheleznyak et al. 1982) as Partial Differential Equations (PDEs). Conventional numerical methods, such as the Finite Difference Method (FDM) or Finite Volume Method (FVM), are widely used to solve these equations. Although they are prevalent, the computational cost of these methods due to their need for matrix operations and iterative solver is demanding. To address this challenge, this work develops a spectral solver based on the Fast Fourier Transform (FFT) combined with Discrete Cosine Transform (DCT) and Discrete Sine Transform (DST) to calculate the photoionization rate efficiently in an axisymmetric cylindrical domain. This method naturally satisfies the boundary conditions used in the model and converts the PDE into algebraic ones in spectral space. Thus, avoids the need for iterative matrix solvers. When compared with FDM results, it is demonstrated that the new solver not only maintains accuracy, but also reduces the computational cost, showing a performance increase of approximately 100 compared to FDM over a wide range of problem sizes. The method is parallelized using Message Passing Interface (MPI) and has been integrated into a fluid plasma model for streamer simulation. Here, this FFT-based approach provides a fast and reliable alternative for calculating photoionization in fluid models, helping large-scale plasma simulations run faster and efficiently, and allows higher-resolution simulation without extra computational cost.

Axisymmetric system↗