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 577 records · Page 32
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most often-used NP-hard problems in computer science to study the effectiveness of computing models and hardware platforms. In this regard, it is also heavily used as a vehicle to study the feasibility of the quantum computing paradigm for this class of problems. In this paper, we tackle the TSP using the quantum approximate optimization algorithm (QAOA) approach by formulating it as an optimization problem. By adopting an improved qubit encoding strategy and a layer-wise learning optimization protocol, we present numerical results obtained from the gate-based digital quantum simulator, specifically targeting TSP instances with 3, 4, and 5 cities. We focus on the evaluations of three distinctive QAOA mixer designs, considering their performances in terms of numerical accuracy and optimization cost. Notably, we find that a well-balanced QAOA mixer design exhibits more promising potential for gate-based simulators and realistic quantum devices in the long run, an observation further supported by our noise model simulations. Furthermore, we investigate the sensitivity of the simulations to the TSP graph. Overall, our simulation results show that the digital quantum simulation of problem-inspired ansatz is a successful candidate for finding optimal TSP solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Quantum Circuits for the Preparation of Spin Eigenfunctions on Quantum Computers

The application of quantum algorithms to the study of many-particle quantum systems requires the ability to prepare wave functions that are relevant in the behavior of the system under study. Hamiltonian symmetries are important instruments used to classify relevant many-particle wave functions and to improve the efficiency of numerical simulations. In this work, quantum circuits for the exact and approximate preparation of total spin eigenfunctions on quantum computers are presented. Two different strategies are discussed and compared: exact recursive construction of total spin eigenfunctions based on the addition theorem of angular momentum, and heuristic approximation of total spin eigenfunctions based on the variational optimization of a suitable cost function. The construction of these quantum circuits is illustrated in detail, and the preparation of total spin eigenfunctions is demonstrated on IBM quantum devices, focusing on three- and five-spin systems on graphs with triangle connectivity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Quantum approximate multi-objective optimization

The goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. We demonstrate its performance on an IBM Quantum computer, as well as with matrix product state numerical simulation, and show its potential to outperform classical approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

The Good, the Bad, and the Ugly: Pseudopotential Inconsistency Errors in Molecular Applications of Density Functional Theory

The pseudopotential (PP) approximation is one of the most common techniques in computational chemistry. Despite its long history, the development of custom PPs has not tracked with the explosion of different density functional approximations (DFAs). As a result, the use of PPs with exchange/correlation models for which they were not developed is widespread, although this practice is known to be theoretically unsound. The extent of PP inconsistency errors (PPIEs) associated with this practice has not been systematically explored across the types of energy differences commonly evaluated in chemical applications. Here, we evaluate PPIEs for a number of PPs and DFAs across 196 chemically relevant systems of both transition-metal and main-group elements, as represented by the W4-11, TMC34, and S22 data sets. Near the complete basis set limit, these PPs are found to cleanly approach all-electron (AE) results for noncovalent interactions but introduce root-mean-squared errors (RMSEs) upwards of 15 kcal mol –1 into predictions of covalent bond energies for a number of popular DFAs. We achieve significant improvements through the use of empirical atom- and DFA-specific PP corrections, indicating considerable systematicity of the PPIEs. The results of this work have implications for chemical modeling in both molecular contexts and for DFA design, which we discuss.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2019

Rates of adsorption and desorption: Entropic contributions and errors due to mean-field approximations

We have performed exact classical rate calculations to compute adsorption and desorption rate constants with a model representative of a real system. We compute the desorption rate using transition-state theory by taking the dividing-surface far from the surface of the solid. We find that using a mean-field assumption, i.e., applying potential of mean force to transition state theory, could lead to two orders-of-magnitude errors in the rate constant owing to large fluctuations in the desorption barrier. Furthermore, we compute the adsorption rate by including a dynamical factor which reflects the probability of sticking to the solid surface. We find that the sticking probability is highly sensitive to the coverage. Also, we find that the adsorption rate computed from the mean-field assumption is not very different from the exact adsorption rate. We also compute entropic contribution to desorption rates and compare it to that obtained from two limiting models of adsorption—2D ideal gas and 2D ideal lattice gas. We show that at high temperatures (700 K), the entropic contribution to desorption rates computed from the exact calculations is very close to that obtained from the 2D ideal gas model. However, for lower to intermediate temperatures from 200 K to 500 K, the entropic contributions cover a wide range which lies in between the two limiting models and could lead to over two-orders-of-magnitude errors in the rate coefficient.

Activation energies↗
DOE OSTI2022

Initial study on cross-section generation requirements for a PBR equilibrium core

A Serpent model of the equilibrium core HTR-PM small modular nuclear reactor in China, was developed for use in cross-section preparation studies in order to guide methods development for the Griffin reactor multiphysics application. The model includes detailed isotopics for 10 distinct pebble burnup groups in 126 core zones with unique fuel and moderator temperatures obtained from a coupled neutronics-thermal-fluids equilibrium core calculation using Griffin-Pronghorn. A sensitivity study of the fuel and moderator temperatures for various core regions was performed with the MOOSE stochastic tools. The results show that the uncertainties are, not unexpectedly, dominated by the value of the fluid temperature and that the power level, heat transfer coefficient and effective conduction to neighboring pebbles and fluid constitute, at best, second order effects. The temperature uncertainty range varies from 28 K to 57 K between the core entry and exit planes, respectively, but these values are probably higher. We still have to quantify the significance of these uncertainties in the preparation of cross-sections in future work. In addition, we verified that the effective pebble approximation used in the PEBBED and V.S.O.P. computer codes works well for the preparation of region averaged cross-sections. Nevertheless, there are some discrepancies in the cross-sections when compared to the multi-pebble model, which could affect the prediction of peak values and the depletion calculation. We conclude that is highly desirable for future studies with Griffin to be able to handle both the 'effective' pebble approximation and the multi-pebble approach for various pebble burnup groups. This enables Griffin users with the flexibility to perform higher-fidelity studies. Finally, we initiated the preparation of cross-sections for various core regions from the full core Serpent reference model. We quantified the differences in 26 group cross-sections from infinite domain models versus the full core approach. These reference cross-sections will serve to verify the double heterogeneity, self-shielding, and spectrum-correction methods in Griffin. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2022

Incorporating the effects of objects in an approximate model of light transport in scattering media

A computationally efficient radiative transport model is presented that predicts a camera measurement and accounts for the light reflected and blocked by an object in a scattering medium. The model is in good agreement with experimental data acquired at the Sandia National Laboratory Fog Chamber Facility (SNLFC). The model is applicable in computational imaging to detect, localize, and image objects hidden in scattering media. Here, a statistical approach was implemented to study object detection limits in fog.

42 ENGINEERING↗
DOE OSTI2023

Machine Learning Surrogates of a Fuel Matrix Degradation Process Model for Performance Assessment of a Nuclear Waste Repository

Spent nuclear fuel repository simulations are currently not able to incorporate detailed fuel matrix degradation (FMD) process models due to their computational cost, especially when large numbers of waste packages breach. The current paper uses machine learning to develop artificial neural network and k-nearest neighbor regression surrogate models that approximate the detailed FMD process model while being computationally much faster to evaluate. Further, using fuel cask temperature, dose rate, and the environmental concentrations of CO 3 2- , O 2 , Fe 2+ , and H 2 as inputs, these surrogates show good agreement with the FMD process model predictions of the UO 2 degradation rate for conditions within the range of the training data. A demonstration in a full-scale shale repository reference case simulation shows that the incorporation of the surrogate models captures local and temporal environmental effects on fuel degradation rates while retaining good computational efficiency.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2025

Real-Time Operator Evolution in Two and Three Dimensions via Sparse Pauli Dynamics

We study real-time operator evolution using sparse Pauli dynamics, a recently developed method for simulating expectation values of quantum circuits. On the examples of energy and charge diffusion in one-dimensional (1D) spin chains and sudden quench dynamics in the 2D transverse-field Ising model, it is shown that this approach can compete with state-of-the-art tensor network methods. We further demonstrate the flexibility of the approach by studying quench dynamics in the 3D transverse-field Ising model that is highly challenging for tensor network methods. For the simulation of expectation value dynamics starting in a computational basis state, we introduce an extension of sparse Pauli dynamics that truncates the growing sum of Pauli operators by discarding terms with a large number of X and Y matrices. This is validated by our 2D and 3D simulations. Finally, we argue that sparse Pauli dynamics is not only capable of converging challenging observables to high accuracy, but can also serve as a reliable approximate approach even when given only limited computational resources. Published by the American Physical Society 2025

Begušić, Tomislav (ORCID:0000000279424134)↗
DOE OSTI2018

Scale Mixtures of Frechet Distributions as Asymptotic Approximations of Extreme Precipitation

This paper is a further development of the results of [20] where, based on the negative binomial model for the duration of wet periods measured in days [16], an asymptotic approximation was proposed for the distribution of the maximum daily precipitation volume within a wet period. This approximation has the form of a scale mixture of the Fr´echet distribution with the gamma mixing distribution and coincides with the distribution of a positive power of a random variable having the Snedecor–Fisher distribution. Here we extend this result to the mth extremes, m ∈ ℕ, and sample quantiles. The proof of this result is based on the representation of the negative binomial distribution as a mixed geometric (and hence, mixed Poisson) distribution [17] and limit theorems for extreme order statistics in samples with random sizes having mixed Poisson distributions [10]. Some analytic properties of the obtained limit distribution are described. In particular, it is demonstrated that under certain conditions the limit distribution of the maximum precipitation is mixed exponential and hence, is infinitely divisible. It is shown that under the same conditions this limit distribution can be represented as a scale mixture of stable or Weibull or Pareto or folded normal laws. The corresponding product representations for the limit random variable can be used for its computer simulation. The results of fitting this distribution to real data are presented illustrating high adequacy of the proposed model. It is also shown that the limit distribution of sample quantiles is the well-known Student distribution. Several methods are proposed for the estimation of the parameters of the asymptotic distributions. The obtained mixture representations for the limit laws and the corresponding asymptotic approximations provide better insight into the nature of mixed probability (“Bayesian”) models.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Analytical and EZmock covariance validation for the DESI 2024 results

The estimation of uncertainties in cosmological parameters is an important challenge in Large-Scale-Structure (LSS) analyses. For standard analyses such as Baryon Acoustic Oscillations (BAO) and Full-Shape two approaches are usually considered. First: analytical estimates of the covariance matrix use Gaussian approximations and (nonlinear) clustering measurements to estimate the matrix, which allows a relatively fast and computationally cheap way to generate matrices that adapt to an arbitrary clustering measurement. On the other hand, sample covariances are an empirical estimate of the matrix based on an ensemble of clustering measurements from fast and approximate simulations. While more computationally expensive due to the large amount of simulations and volume required, these allow us to take into account systematics that are impossible to model analytically. In this work we compare these two approaches in order to enable DESI's key analyses. We find that the configuration space analytical estimate performs satisfactorily in BAO analyses and its flexibility in terms of input clustering makes it the fiducial choice for DESI's 2024 BAO analysis. On the contrary, the analytical computation of the covariance matrix in Fourier space does not reproduce the expected measurements in terms of Full-Shape analyses, which motivates the use of a corrected mock covariance for DESI's 2024 Full Shape analysis.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

The impact of different neutrino transport methods on multidimensional core-collapse supernova simulations

Neutrinos play a crucial role in the core-collapse supernova (CCSN) explosion mechanism. The requirement of accurately calculating the transport of neutrinos makes simulations of the CCSN mechanism extremely challenging and computationally expensive. Historically, this stiff challenge has been met by making approximations to the full transport equation. In this work, we compare CCSN simulations in one- and two-dimensions with three approximate neutrino transport schemes, each implemented in the FLASH simulation framework. We compare a two-moment M1 scheme with an analytic closure (M1), the isotropic diffusion source approximation (IDSA), and the advanced spectral leakage method. We identify and discuss the advantages and disadvantages of each scheme. For each approximate transport scheme, we use identical grid setups, hydrodynamics, and gravity solvers to investigate the transport effects on supernova shock dynamics and neutrino quantities. We find that the transport scheme has a small effect on the evolution of protoneutron star (PNS) radius, PNS mass, and the mass accretion rate. The neutrino luminosities, mean energies, and shock radii have a ~10%–20% quantitative difference but the overall qualitative trends are fairly consistent between all three approximations. We find larger differences in the gain region properties, including the gain region mass and the net heating rate in the gain region, as well as the strength of PNS convection in the core. We investigate the progenitor, nuclear equation of state, and stochastic perturbation dependence of our simulations and find similar magnitudes of impact on key quantities. We also compare the computational expense of the various approximations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Performance evaluations of signed and unsigned noisy approximate quantum Fourier arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route toward a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted-sum optimization problems in data processing and machine learning, and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting-qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance and identify the most effective approximation depths for unsigned quantum addition and quantum multiplication within the given context. We then perform a similar analysis of signed addition and compare to the unsigned results. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges—relevant to signed, unsigned, modular and non-modular versions—that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze the performance trends in our results and speculate on possible future developments within this computational paradigm.

Computational models↗
DOE OSTI2023

On the Approximability of Random-Hypergraph MAX-3-XORSAT Problems with Quantum Algorithms

Constraint satisfaction problems are an important area of computer science. Many of these problems are in the complexity class NP which is exponentially hard for all known methods, both for worst cases and often typical. Fundamentally, the lack of any guided local minimum escape method ensures the hardness of both exact and approximate optimization classically, but the intuitive mechanism for approximation hardness in quantum algorithms based on Hamiltonian time evolution is poorly understood. We explore this question using the prototypically hard MAX-3-XORSAT problem class. We conclude that the mechanisms for quantum exact and approximation hardness are fundamentally distinct. We qualitatively identify why traditional methods such as quantum adiabatic optimization are not good approximation algorithms. We propose a new spectral folding optimization method that does not suffer from these issues and study it analytically and numerically. We consider random rank-3 hypergraphs including extremal planted solution instances, where the ground state satisfies an anomalously high fraction of constraints compared to truly random problems. We show that, if we define the energy to be $E = N_{unsat}-N_{sat}$, then spectrally folded quantum optimization will return states with energy $E \leq A E_{GS}$ (where $E_{GS}$ is the ground state energy) in polynomial time, where conservatively, $A \simeq 0.6$. We thoroughly benchmark variations of spectrally folded quantum optimization for random classically approximation-hard (planted solution) instances in simulation, and find performance consistent with this prediction. We do not claim that this approximation guarantee holds for all possible hypergraphs, though our algorithm's mechanism can likely generalize widely. These results suggest that quantum computers are more powerful for approximate optimization than had been previously assumed.

Kapit, Eliot↗
DOE OSTI2022

Flexibility of the factorized form of the unitary coupled cluster Ansatz

The factorized form of the unitary coupled cluster Ansatz is a popular state preparation Ansatz for electronic structure calculations of molecules on quantum computers. It is often viewed as an approximation (based on the Trotter product formula) for the conventional unitary coupled cluster operator. In this work, we show that the factorized form is quite flexible, allowing one to range from a conventional configuration interaction, to conventional unitary coupled cluster, to efficient approximations that lie in between these two. The variational minimization of the energy often allows simpler factorized unitary coupled cluster approximations to achieve high accuracy, even if they do not accurately approximate the Trotter product formula. This is similar to how quantum approximate optimization algorithms can achieve high accuracy with a small number of levels.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Loschmidt-echo approach to error estimation in Krylov-subspace approximation

The Krylov subspace method is a traditional approach to approximate quantum evolution, allowing us to treat systems with large Hilbert spaces. Despite its popularity, current bounds typically overestimate the error, which translates into more expensive simulation routines. Here, in this paper, we tackle this problem by realizing that the error can be understood as a Loschmidt echo in a one-dimensional (1D) noninteracting tight-binding Hamiltonian. We show that the different time regimes of the approximation can be understood using simple physical ideas. More importantly, we obtain computationally cheap error bounds that describe with high precision the actual error in the approximation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Diagonal Approximation for Holographic Rényi Entropies

Recently, Dong et al., [A modified cosmic brane proposal for holographic Renyi entropy, J. High Energy Phys. 06 (2024) 120] proposed a modified cosmic brane prescription for computing the Rényi entropy 𝑆𝛼 of a holographic system in the presence of multiple extremal surfaces. This prescription was found by assuming a diagonal approximation, where the Rényi entropy is computed after first measuring the areas of all extremal surfaces. We derive this diagonal approximation for the case of two extremal surfaces and show that it accurately computes Rényi entropies up to 𝑂⁡(log⁡𝐺) corrections. For 𝛼 <1, this allows us to derive the modified cosmic brane prescription, which differs from the original cosmic brane prescription at leading order in 𝐺. For 𝛼 >1, it leads to the original cosmic brane prescription without needing to assume that replica symmetry is unbroken in the bulk.

FOS: Physical sciences↗
DOE OSTI2023

An Infinite Domain 3D Poisson Solver Based on the Barnes-Hut Algorithm

We present a domain decomposition method for the solution of the 3D Poisson equation with infinite domain boundary conditions. The method is based on an application of the Barnes-Hut tree particle scheme adapted to gridded data. Long range interactions are computed using the first two terms in the Cartesian multipole expansion of Green’s function convoluted with the charge while short range computations are performed using Hockney’s domain doubling algorithm. A standard domain decomposition strategy requires O(N 2 ) applications of Hockney’s algorithm, where N is the number of subdomains that intersect that charge support, while in the present approach only O(Nlog 2 N) such computations suffice. The discretization scheme employed is a sixth order Mehrstellen approximation of the 3D Laplace opera tor. The method exhibits satisfactory accuracy at a substantially reduced computational cost compared to the full domain decomposition Hockney’s algorithm.

97 MATHEMATICS AND COMPUTING↗