Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum algorithm”

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,549 records · Page 86

Frequency-guided windowed Fourier ridges technique for automatic demodulation of a single closed fringe pattern

A frequency-guided windowed Fourier ridges (FG-WFR) technique for phase extraction from a single closed fringe pattern is proposed. The algorithm begins with a selected seed point and is then guided by the local frequency of the computed pixels. For the seed point, the whole spectral range is examined with WFR to provide reliable local frequency and phase estimation. However, for the rest of the pixels, the WFR algorithm is performed in a more narrow spectral range centered at the determined frequency of its computed neighboring pixel, which not only enforces the continuity of the local frequency between adjacent pixels but also reduces computation consumption significantly. Besides, since phase unwrapping can be readily implemented after demodulation of each pixel, the algorithm directly offers a continuous phase map. The proposed FG-WFR algorithm is verified by successfully demodulating two computer simulated fringe patterns and one noisy experimental fringe pattern.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Autonomous Sub-Pixel Satellite Track Endpoint Determination for Space Based Images

An algorithm for determining satellite track endpoints with sub-pixel resolution in spaced-based images is presented. The algorithm allows for significant curvature in the imaged track due to rotation of the spacecraft capturing the image. The motivation behind the subpixel endpoint determination is first presented, followed by a description of the methodology used. Results from running the algorithm on real ground-based and simulated spaced-based images are shown to highlight its effectiveness.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cabana: A Performance Portable Library for Particle-Based Simulations

Particle-based simulations are ubiquitous throughout many fields of computational science and engineering, spanning the atomistic level with molecular dynamics (MD), to mesoscale particle-in-cell (PIC) simulations for solid mechanics, device-scale modeling with PIC methods for plasma physics, and massive N-body cosmology simulations of galaxy structures, with many other methods in between (Hockney & Eastwood, 1989). While these methods use particles to represent significantly different entities with completely different physical models, many low-level details are shared including performant algorithms for short- and/or long-range particle interactions, multi-node particle communication patterns, and other data management tasks such as particle sorting and neighbor list construction. Cabana is a performance portable library for particle-based simulations, developed as part of the Co-Design Center for Particle Applications (CoPA) within the Exascale Computing Project (ECP) (Alexander et al., 2020). The CoPA project and its full development scope, including ECP partner applications, algorithm development, and similar software libraries for quantum MD, is described in (Mniszewski et al., 2021). Cabana uses the Kokkos library for on-node parallelism (Edwards et al., 2014; Trott et al., 2022), enabling simulation on multi-core CPU and GPU architectures, and MPI for GPU-aware, multi-node communication. Cabana provides particle simulation capabilities on almost all current Kokkos backends, including serial execution, OpenMP (including OpenMP-Target for GPUs), CUDA (NVIDIA GPUs), HIP (AMD GPUs), and SYCL (Intel GPUs), providing a clear path for the coming generation of accelerator-based exascale hardware. Cabana builds on Kokkos by providing new particle data structures and particle algorithms resulting in a similar execution policy-based, node-level programming model that is intended to be used in addition to the core Kokkos library within an application. Cabana is designed as an application and physics agnostic, but particle-specific toolkit which can either be used to generate a new application, or to be used as needed in existing applications at various levels of invasiveness including through interfaces that wrap user memory in existing data structures.

97 MATHEMATICS AND COMPUTING↗

Spatial and Spin Symmetry Breaking in Semidefinite-Programming-Based Hartree–Fock Theory

The Hartree–Fock problem was recently recast as a semidefinite optimization over the space of rank-constrained two-body reduced-density matrices (RDMs) [ Phys. Rev. A 2014, 89, 010502(R)]. This formulation of the problem transfers the nonconvexity of the Hartree–Fock energy functional to the rank constraint on the two-body RDM. We consider an equivalent optimization over the space of positive semidefinite one-electron RDMs (1-RDMs) that retains the nonconvexity of the Hartree–Fock energy expression. The optimized 1-RDM satisfies ensemble N-representability conditions, and ensemble spin-state conditions may be imposed as well. The spin-state conditions place additional linear and nonlinear constraints on the 1-RDM. We apply this RDM-based approach to several molecular systems and explore its spatial (point group) and spin (Ŝ 2 and Ŝ 3 ) symmetry breaking properties. When imposing Ŝ 2 and Ŝ 3 symmetry but relaxing point group symmetry, the procedure often locates spatial-symmetry-broken solutions that are difficult to identify using standard algorithms. For example, the RDM-based approach yields a smooth, spatial-symmetry-broken potential energy curve for the well-known Be–H 2 insertion pathway. We also demonstrate numerically that, upon relaxation of Ŝ 2 and Ŝ 3 symmetry constraints, the RDM-based approach is equivalent to real-valued generalized Hartree–Fock theory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Demonstration of a quantum-classical coprocessing protocol for simulating nuclear reactions

Quantum computers hold great promise for exact simulations of nuclear dynamical processes (e.g., scattering and reactions), which are paramount to the study of nuclear matter at the limit of stability and in the formation of chemical elements in stars. However, quantum simulations of the unitary (real) time dynamics of fermionic many-body systems require a currently prohibitive number of reliable and long-lived qubits. Here we propose a co-processing algorithm for the simulation of real-time dynamics in which the time evolution of the spatial coordinates is carried out on a classical processor, while the evolution of the spin degrees of freedom is carried out on quantum hardware. We demonstrate this hybrid scheme with the simulation of two neutrons scattering at the Lawrence Berkeley National Laboratory's Advanced Quantum Testbed. After implementing error mitigation strategies to improve the accuracy of the algorithm in addition to a combination of circuit compression techniques and tomography as methods to elucidate the onset of decoherence, our results validate the principle of the proposed co-processing scheme. A generalization of this present scheme will open the way for (real-time) path integral simulations of nuclear scattering.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Advances in QCD sum-rule calculations

We review the recent progress in the applications of QCD sum rules to hadron properties with the emphasis on the following selected problems: (i) development of new algorithms for the extraction of ground-state parameters from two-point correlators; (ii) form factors at large momentum transfers from three-point vacuum correlation functions: (iii) properties of exotic tetraquark hadrons from correlation functions of four-quark currents.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A solution algorithm for the fluid dynamic equations based on a stochastic model for molecular motion

In this paper, a stochastic model is presented to simulate the flow of gases, which are not in thermodynamic equilibrium, like in rarefied or micro situations. For the interaction of a particle with others, statistical moments of the local ensemble have to be evaluated, but unlike in molecular dynamics simulations or DSMC, no collisions between computational particles are considered. In addition, a novel integration technique allows for time steps independent of the stochastic time scale. The stochastic model represents a Fokker-Planck equation in the kinetic description, which can be viewed as an approximation to the Boltzmann equation. This allows for a rigorous investigation of the relation between the new model and classical fluid and kinetic equations. The fluid dynamic equations of Navier-Stokes and Fourier are fully recovered for small relaxation times, while for larger values the new model extents into the kinetic regime. Numerical studies demonstrate that the stochastic model is consistent with Navier-Stokes in that limit, but also that the results become significantly different, if the conditions for equilibrium are invalid. The application to the Knudsen paradox demonstrates the correctness and relevance of this development, and comparisons with existing kinetic equations and standard solution algorithms reveal its advantages. Moreover, results of a test case with geometrically complex boundaries are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Convergence analysis of two-node CMFD method for two-group neutron diffusion eigenvalue problem

In this paper, the nonlinear coarse-mesh finite difference method with two-node local problem (CMFD2N) is proven to be unconditionally stable for neutron diffusion eigenvalue problems. The explicit current correction factor (CCF) is derived based on the two-node analytic nodal method (ANM2N), and a Fourier stability analysis is applied to the linearized algorithm. It is shown that the analytic convergence rate obtained by the Fourier analysis compares very well with the numerically measured convergence rate. It is also shown that the theoretical convergence rate is only governed by the converged second harmonic buckling and the mesh size. It is also noted that the convergence rate of the CCF of the CMFD2N algorithm is dependent on the mesh size, but not on the total problem size. This is contrary to expectation for eigenvalue problem. The novel points of this paper are the analytical derivation of the convergence rate of the CMFD2N algorithm for eigenvalue problem, and the convergence analysis based on the analytic derivations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An algorithm for computing the 2D structure of fast rotating stars

Stars may be understood as self-gravitating masses of a compressible fluid whose radiative cooling is compensated by nuclear reactions or gravitational contraction. The understanding of their time evolution requires the use of detailed models that account for a complex microphysics including that of opacities, equation of state and nuclear reactions. The present stellar models are essentially one-dimensional, namely spherically symmetric. However, the interpretation of recent data like the surface abundances of elements or the distribution of internal rotation have reached the limits of validity of one-dimensional models because of their very simplified representation of large-scale fluid flows. In this article, we describe the ESTER code, which is the first code able to compute in a consistent way a two-dimensional model of a fast rotating star including its large-scale flows. Compared to classical 1D stellar evolution codes, many numerical innovations have been introduced to deal with this complex problem. First, the spectral discretization based on spherical harmonics and Chebyshev polynomials is used to represent the 2D axisymmetric fields. A nonlinear mapping maps the spheroidal star and allows a smooth spectral representation of the fields. The properties of Picard and Newton iterations for solving the nonlinear partial differential equations of the problem are discussed. It turns out that the Picard scheme is efficient on the computation of the simple polytropic stars, but Newton algorithm is unsurpassed when stellar models include complex microphysics. Finally, we discuss the numerical efficiency of our solver of Newton iterations. This linear solver combines the iterative Conjugate Gradient Squared algorithm together with an LU-factorization serving as a preconditioner of the Jacobian matrix.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Matrix phased array (MPA) imaging technology for resistance spot welds

A three-dimensional MPA probe has been incorporated with a high speed phased array electronic board to visualize nugget images of resistance spot welds. The primary application area of this battery operated portable MPA ultrasonic imaging system is in the automotive industry which a conventional destructive testing process is commonly adopted to check the quality of resistance spot welds in auto bodies. Considering an average of five-thousand spot welds in a medium size passenger vehicle, the amount of time and effort given to popping the welds and measuring nugget size are immeasurable in addition to the millions of dollars' worth of scrap metals recycled per plant per year. This wasteful labor intensive destructive testing process has become less reliable as auto body sheet metal has transitioned from thick and heavy mild steels to thin and light high strength steels. Consequently, the necessity of developing a non-destructive inspection methodology has become inevitable. In this paper, the fundamental aspects of the current 3-D probe design, data acquisition algorithms, and weld nugget imaging process are discussed.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Internal ellipsoidal estimates of reachable set of impulsive control systems

A problem of estimating reachable sets of linear impulsive control system with uncertainty in initial data is considered. The impulsive controls in the dynamical system belong to the intersection of a special cone with a generalized ellipsoid both taken in the space of functions of bounded variation. Assume that an ellipsoidal state constraints are imposed. The algorithms for constructing internal ellipsoidal estimates of reachable sets for such control systems and numerical simulation results are given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Identification of parameters of discrete-continuous models

In the paper, the parameters of a discrete-continuous model have been identified on the basis of experimental investigations and formulation of optimization problem. The discrete-continuous model represents a cantilever stepped Timoshenko beam. The mathematical model has been formulated and solved according to the Lagrange multiplier formalism. Optimization has been based on the genetic algorithm. The presented proceeding’s stages make the identification of any parameters of discrete-continuous systems possible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and versatile quantum phase estimation method

Quantum phase estimation is one of the most powerful quantum primitives. This work proposes a new approach for the problem of multiple eigenvalue estimation: Quantum Multiple Eigenvalue Gaussian filtered Search (QMEGS). QMEGS leverages the Hadamard test circuit structure and only requires simple classical postprocessing. QMEGS is the first algorithm to simultaneously satisfy the following two properties: (1) It can achieve the Heisenberg-limited scaling without relying on any spectral gap assumption. (2) With a positive energy gap and additional assumptions on the initial state, QMEGS can estimate all dominant eigenvalues to ϵ accuracy utilizing a significantly reduced circuit depth compared to the standard quantum phase estimation algorithm. In the most favorable scenario, the maximal runtime can be reduced to as low as log(1/ϵ). This implies that QMEGS serves as an efficient and versatile approach, achieving the best-known results for both gapped and gapless systems. Numerical results validate the efficiency of our proposed algorithm in various regimes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Small-angle Coulomb collision model for particle-in-cell simulations

We construct and investigate a set of stochastic differential equations that incorporate the physics of velocity-dependent small-angle Coulomb collisions among the plasma particles in a particle-in-cell simulation. Each particle is scattered stochastically from all the other particles in a simulation cell modeled as one or more Maxwellians. Total energy and momentum are conserved by linear transformation of the velocity increments. In two test simulations the proposed 'particle-moment' collision algorithm performs well with time steps as large as 10% of the relaxation time - far larger than a particle-pairing collision algorithm, in which pairs of particles are scattered from one another, requires to achieve the same accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable parallel methods for monolithic coupling in fluid-structure interaction with application to blood flow modeling

We introduce and study numerically a scalable parallel finite element solver for the simulation of blood flow in compliant arteries. The incompressible Navier-Stokes equations are used to model the fluid and coupled to an incompressible linear elastic model for the blood vessel walls. Our method features an unstructured dynamic mesh capable of modeling complicated geometries, an arbitrary Lagrangian-Eulerian framework that allows for large displacements of the moving fluid domain, monolithic coupling between the fluid and structure equations, and fully implicit time discretization. Simulations based on blood vessel geometries derived from patient-specific clinical data are performed on large supercomputers using scalable Newton-Krylov algorithms preconditioned with an overlapping restricted additive Schwarz method that preconditions the entire fluid-structure system together. The algorithm is shown to be robust and scalable for a variety of physical parameters, scaling to hundreds of processors and millions of unknowns.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantitative grating-based x-ray dark-field computed tomography

Grating-based x-ray dark-field computed tomography is a functional method that utilizes the scattering contrast mechanism to explore the inaccessible spatially resolved internal structure of the sample. In this letter, we show that the second moment of the scattering angle distribution can be expressed as the minus logarithm of the visibility degradation of the oscillation curve in grating-based imaging. According to the conclusion of Khelashvili et al. [Phys. Med. Biol. 51, 221 (2006)], the minus logarithm of the visibility ratio fulfills the line integral condition; consequently the scattering information can be reconstructed quantitatively by conventional computed tomography algorithms. Results from a computer simulation and from an actual experiment both validate our deduction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reconstruction of apparent orthotropic conductivity tensor image using magnetic resonance electrical impedance tomography

Magnetic resonance electrical impedance tomography visualizes current density and/or conductivity distributions inside an electrically conductive object. Injecting currents into the imaging object along at least two different directions, induced magnetic flux density data can be measured using a magnetic resonance imaging scanner. Without rotating the object inside the scanner, we can measure only one component of the magnetic flux density denoted as B{sub z}. Since the biological tissues such as skeletal muscle and brain white matter show strong anisotropic properties, the reconstruction of anisotropic conductivity tensor is indispensable for the accurate observations in the biological systems. In this paper, we propose a direct method to reconstruct an axial apparent orthotropic conductivity tensor by using multiple B{sub z} data subject to multiple injection currents. To investigate the anisotropic conductivity properties, we first recover the internal current density from the measured B{sub z} data. From the recovered internal current density and the curl-free condition of the electric field, we derive an over-determined matrix system for determining the internal absolute orthotropic conductivity tensor. The over-determined matrix system is designed to use a combination of two loops around each pixel. Numerical simulations and phantom experimental results demonstrate that the proposed algorithm stably determines the orthotropic conductivity tensor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗