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,675 records · Page 93

Noise Decoherence and Errors from Entanglement-function Theory for Quantum Computing

A significant problem in quantum computing is the development of physical realizations of algorithms that are robust against noise. One way to examine and mitigate noise would be to simulate large sets of qubits coupling to the external environment on classical computers. This is extremely challenging as quantum information processing is in some sense tied to computing resources that scale exponentially with the number of computing elements (qubits). In this LDRD, we set the foundation for a computational framework potentially allowing simulations of 1000s of qubits vs. 10s now possible. Exact wave-function-based methods demand exponentially increasing resources with system size. The method proposed, entanglement-functional theory (EFT), requires vastly fewer resources. The crucial step is to map the information contained in the wave-functions into a simpler object with associated 1.) auxiliary gate operations and 2.) entanglement functionals of this object. This is similar to the Time-dependent Density Functional Theory (TDDFT) approach that has revolutionized chemistry and materials science. Instead of dealing with the exponentially large wave-function, EFT works with a polynomially large set of projections (the density) that are easily manipulated through unitary operations. For a given set of quantum gates, an isomorphism exists that relates the sequence of events to the time-dependent density. A system of entangled qubits can be simulated at drastically reduced cost relative to existing state-of-the-art vector-state simulation codes.

97 MATHEMATICS AND COMPUTING↗

Multi-scale fusion algorithm of intensity and polarization-difference images based on edge information enhancement

To better integrate complementary and redundant information from different source images, improve the edge information, and facilitate the target detection. A multi-scale fusion algorithm of intensity and polarization-difference (PD) images based on edge information enhancement is proposed. Firstly, intensity images are obtained by the polarization information analysis method. PD images are obtained by the adaptive polarization-difference imaging approach based on the principle of minimum mutual information. Secondly, guided filter, affine transformations and Block-Matching and 3D filtering are embedded in visibility enhancement to improve the intensity and PD images. Thirdly, the two images are decomposed into high-frequency and low-frequency images by the dual-tree complex wavelet transform (DT-CWT). The high-frequency and low-frequency images are fused by the fusion rules based on edge detection and the regional variance matching degree respectively. Finally, the fusion image is obtained by the inverse DT-CWT. Experimental results demonstrate that fusion images of the proposed algorithm are significantly improved in information entropy, average gradient, and spatial frequency. Compared with the existing methods, it can achieve a better edge enhancement for images in a turbid medium.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A fast solver for the gyrokinetic field equation with adiabatic electrons

Describing turbulence and microinstabilities in fusion devices is often modelled with the gyrokinetic equation. During the time evolution of the distribution function a field equation for the electrostatic potential needs to be solved. In the case of adiabatic electrons it contains a flux-surface-average term resulting in an integro-differential equation. Its numerical solution is time and memory intensive for three-dimensional configurations. Here a new algorithm is presented which only requires the numerical inversion of a simpler differential operator and a subsequent addition of a correction term. This new procedure is as fast as solving the equation without the surface average.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stabilized multilevel Monte Carlo method for stiff stochastic differential equations

A multilevel Monte Carlo (MLMC) method for mean square stable stochastic differential equations with multiple scales is proposed. For such problems, that we call stiff, the performance of MLMC methods based on classical explicit methods deteriorates because of the time step restriction to resolve the fastest scales that prevents to exploit all the levels of the MLMC approach. We show that by switching to explicit stabilized stochastic methods and balancing the stabilization procedure simultaneously with the hierarchical sampling strategy of MLMC methods, the computational cost for stiff systems is significantly reduced, while keeping the computational algorithm fully explicit and easy to implement. Numerical experiments on linear and nonlinear stochastic differential equations and on a stochastic partial differential equation illustrate the performance of the stabilized MLMC method and corroborate our theoretical findings.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic superparameterization in quasigeostrophic turbulence

In this article we expand and develop the authors' recent proposed methodology for efficient stochastic superparameterization algorithms for geophysical turbulence. Geophysical turbulence is characterized by significant intermittent cascades of energy from the unresolved to the resolved scales resulting in complex patterns of waves, jets, and vortices. Conventional superparameterization simulates large scale dynamics on a coarse grid in a physical domain, and couples these dynamics to high-resolution simulations on periodic domains embedded in the coarse grid. Stochastic superparameterization replaces the nonlinear, deterministic eddy equations on periodic embedded domains by quasilinear stochastic approximations on formally infinite embedded domains. The result is a seamless algorithm which never uses a small scale grid and is far cheaper than conventional SP, but with significant success in difficult test problems. Various design choices in the algorithm are investigated in detail here, including decoupling the timescale of evolution on the embedded domains from the length of the time step used on the coarse grid, and sensitivity to certain assumed properties of the eddies (e.g. the shape of the assumed eddy energy spectrum). We present four closures based on stochastic superparameterization which elucidate the properties of the underlying framework: a ‘null hypothesis’ stochastic closure that uncouples the eddies from the mean, a stochastic closure with nonlinearly coupled eddies and mean, a nonlinear deterministic closure, and a stochastic closure based on energy conservation. The different algorithms are compared and contrasted on a stringent test suite for quasigeostrophic turbulence involving two-layer dynamics on a β-plane forced by an imposed background shear. The success of the algorithms developed here suggests that they may be fruitfully applied to more realistic situations. They are expected to be particularly useful in providing accurate and efficient stochastic parameterizations for use in ensemble-based state estimation and prediction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Post-processing interstitialcy diffusion from molecular dynamics simulations

An algorithm to rigorously trace the interstitialcy diffusion trajectory in crystals is developed. The algorithm incorporates unsupervised learning and graph optimization which obviate the need to input extra domain specific information depending on crystal or temperature of the simulation. The algorithm is implemented in a flexible framework as a post-processor to molecular dynamics (MD) simulations. We describe in detail the reduction of interstitialcy diffusion into known computational problems of unsupervised clustering and graph optimization. We also discuss the steps, computational efficiency and key components of the algorithm. Using the algorithm, thermal interstitialcy diffusion from low to near-melting point temperatures is studied. We encapsulate the algorithms in a modular framework with functionality to calculate diffusion coefficients, migration energies and other trajectory properties. The study validates the algorithm by establishing the conformity of output parameters with experimental values and provides detailed insights for the interstitialcy diffusion mechanism. The algorithm along with the help of supporting visualizations and analysis gives convincing details and a new approach to quantifying diffusion jumps, jump-lengths, time between jumps and to identify interstitials from lattice atoms. -- Graphical abstract:.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Currents and Green's functions of impurities out of equilibrium: Results from inchworm quantum Monte Carlo

Here, we generalize the recently developed inchworm quantum Monte Carlo method to the full Keldysh contour with forward, backward, and equilibrium branches to describe the dynamics of strongly correlated impurity problems with time-dependent parameters. We introduce a method to compute Green's functions, spectral functions, and currents for inchworm Monte Carlo and show how systematic error assessments in real time can be obtained. We then illustrate the capabilities of the algorithm with a study of the behavior of quantum impurities after an instantaneous voltage quench from a thermal equilibrium state.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Searching for Physics Beyond the Standard Model: Strongly-Coupled Field Theories at the Intensity and Energy Frontiers

This proposal is to develop the software and algorithmic infrastructure needed for the numerical study of quantum chromodynamics (QCD), and of theories that have been proposed to describe physics beyond the Standard Model (BSM) of high energy physics, on current and future computers. This infrastructure will enable users (1) to improve the accuracy of QCD calculations to the point where they no longer limit what can be learned from high-precision experiments that seek to test the Standard Model, and (2) to determine the predictions of BSM theories in order to understand which of them are consistent with the data that will soon be available from the LHC. Work will include the extension and optimizations of community codes for the next generation of leadership class computers, the IBM Blue Gene/Q and the Cray XE/XK, and for the dedicated hardware funded for our field by the Department of Energy. Members of our collaboration at Brookhaven National Laboratory and Columbia University worked on the design of the Blue Gene/Q, and have begun to develop software for it. Under this grant we will build upon their experience to produce high-efficiency production codes for this machine. Cray XE/XK computers with many thousands of GPU accelerators will soon be available, and the dedicated commodity clusters we obtain with DOE funding include growing numbers of GPUs. We will work with our partners in NVIDIA's Emerging Technology group to scale our existing software to thousands of GPUs, and to produce highly efficient production codes for these machines. Work under this grant will also include the development of new algorithms for the effective use of heterogeneous computers, and their integration into our codes. It will include improvements of Krylov solvers and the development of new multigrid methods in collaboration with members of the FASTMath SciDAC Institute, using their HYPRE framework, as well as work on improved symplectic integrators.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Turnpike solutions of control problems in quantum systems

The model of a quantum system of interacting spins based on the Shrödinger equation with unbounded linear control is transformed to an equivalent derived system (known from the degenerate problems theory). It consists of a regular differential system with new control and description of impulse control modes. This reveals the general turnpike structure of control processes and allows to propose some effective algorithms of their investigation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Pole-zero form fractional model identification in frequency domain

This paper deals with system identification in the frequency domain using non integer order models given in the pole-zero form. The usual identification techniques cannot be used in this case because of the non integer orders of differentiation which makes the problem strongly nonlinear. A general identification method based on Levenberg-Marquardt algorithm is developed and allows to estimate the (2n+2m+1) parameters of the model. Its application to identify the ''skin effect'' of a squirrel cage induction machine modeling is then presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Geometric integration of the Vlasov-Maxwell system with a variational particle-in-cell scheme

A fully variational, unstructured, electromagnetic particle-in-cell integrator is developed for integration of the Vlasov-Maxwell equations. Using the formalism of discrete exterior calculus [Desbrun et al., e-print arXiv:math/0508341 (2005)], the field solver, interpolation scheme, and particle advance algorithm are derived through minimization of a single discrete field theory action. As a consequence of ensuring that the action is invariant under discrete electromagnetic gauge transformations, the integrator exactly conserves Gauss's law.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Communication: A reduced scaling J-engine based reformulation of SOS-MP2 using graphics processing units

We present a low-prefactor, cubically scaling scaled-opposite-spin second-order Møller-Plesset perturbation theory (SOS-MP2) method which is highly suitable for massively parallel architectures like graphics processing units (GPU). The scaling is reduced from O(N{sup 5}) to O(N{sup 3}) by a reformulation of the MP2-expression in the atomic orbital basis via Laplace transformation and the resolution-of-the-identity (RI) approximation of the integrals in combination with efficient sparse algebra for the 3-center integral transformation. In contrast to previous works that employ GPUs for post Hartree-Fock calculations, we do not simply employ GPU-based linear algebra libraries to accelerate the conventional algorithm. Instead, our reformulation allows to replace the rate-determining contraction step with a modified J-engine algorithm, that has been proven to be highly efficient on GPUs. Thus, our SOS-MP2 scheme enables us to treat large molecular systems in an accurate and efficient manner on a single GPU-server.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Polychromatic sparse image reconstruction and mass attenuation spectrum estimation via B-spline basis function expansion

We develop a sparse image reconstruction method for polychromatic computed tomography (CT) measurements under the blind scenario where the material of the inspected object and the incident energy spectrum are unknown. To obtain a parsimonious measurement model parameterization, we first rewrite the measurement equation using our mass-attenuation parameterization, which has the Laplace integral form. The unknown mass-attenuation spectrum is expanded into basis functions using a B-spline basis of order one. We develop a block coordinate-descent algorithm for constrained minimization of a penalized negative log-likelihood function, where constraints and penalty terms ensure nonnegativity of the spline coefficients and sparsity of the density map image in the wavelet domain. This algorithm alternates between a Nesterov’s proximal-gradient step for estimating the density map image and an active-set step for estimating the incident spectrum parameters. Numerical simulations demonstrate the performance of the proposed scheme.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix

We present an iterative algorithm for computing an invariant subspace associated with the algebraically smallest eigenvalues of a large sparse or structured Hermitian matrix A. We are interested in the case in which the dimension of the invariant subspace is large (e.g., over several hundreds or thousands) even though it may still be small relative to the dimension of A. These problems arise from, for example, density functional theory (DFT) based electronic structure calculations for complex materials. The key feature of our algorithm is that it performs fewer Rayleigh–Ritz calculations compared to existing algorithms such as the locally optimal block preconditioned conjugate gradient or the Davidson algorithm. It is a block algorithm, and hence can take advantage of efficient BLAS3 operations and be implemented with multiple levels of concurrency. We discuss a number of practical issues that must be addressed in order to implement the algorithm efficiently on a high performance computer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bi-directional evolutionary optimization for photonic band gap structures

Toward an efficient and easy-implement optimization for photonic band gap structures, this paper extends the bi-directional evolutionary structural optimization (BESO) method for maximizing photonic band gaps. Photonic crystals are assumed to be periodically composed of two dielectric materials with the different permittivity. Based on the finite element analysis and sensitivity analysis, BESO starts from a simple initial design without any band gap and gradually re-distributes dielectric materials within the unit cell so that the resulting photonic crystal possesses a maximum band gap between two specified adjacent bands. Numerical examples demonstrated the proposed optimization algorithm can successfully obtain the band gaps from the first to the tenth band for both transverse magnetic and electric polarizations. Some optimized photonic crystals exhibit novel patterns markedly different from traditional designs of photonic crystals.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Coupling compositional liquid gas Darcy and free gas flows at porous and free-flow domains interface

This paper proposes an efficient splitting algorithm to solve coupled liquid gas Darcy and free gas flows at the interface between a porous medium and a free-flow domain. This model is compared to the reduced model introduced in [6] using a 1D approximation of the gas free flow. For that purpose, the gas molar fraction diffusive flux at the interface in the free-flow domain is approximated by a two point flux approximation based on a low-frequency diagonal approximation of a Steklov–Poincaré type operator. The splitting algorithm and the reduced model are applied in particular to the modelling of the mass exchanges at the interface between the storage and the ventilation galleries in radioactive waste deposits.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Basis functions for electronic structure calculations on spheres

We introduce a new basis function (the spherical Gaussian) for electronic structure calculations on spheres of any dimension D. We find general expressions for the one- and two-electron integrals and propose an efficient computational algorithm incorporating the Cauchy-Schwarz bound. Using numerical calculations for the D = 2 case, we show that spherical Gaussians are more efficient than spherical harmonics when the electrons are strongly localized.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗