Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum, Quantum Algorithms”

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,693 records · Page 94

The method of transition boundary for the solution of diffraction problems

A new method, which enables one to solve some diffraction problems, is put forth. The technique is based on a relation between the diffracted and scattered geometric optics waves at the transition boundaries. The concept of initial waves is also used instead of the incident field. The general algorithm of the method is outlined and applied to the diffraction problems of waves by perfect electric conductor half-screen, resistive half-plane and impedance sheet junction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A fast algorithm for parabolic PDE-based inverse problems based on Laplace transforms and flexible Krylov solvers

We consider the problem of estimating parameters in large-scale weakly nonlinear inverse problems for which the underlying governing equations is a linear, time-dependent, parabolic partial differential equation. A major challenge in solving these inverse problems using Newton-type methods is the computational cost associated with solving the forward problem and with repeated construction of the Jacobian, which represents the sensitivity of the measurements to the unknown parameters. Forming the Jacobian can be prohibitively expensive because it requires repeated solutions of the forward and adjoint time-dependent parabolic partial differential equations corresponding to multiple sources and receivers. We propose an efficient method based on a Laplace transform-based exponential time integrator combined with a flexible Krylov subspace approach to solve the resulting shifted systems of equations efficiently. Our proposed solver speeds up the computation of the forward and adjoint problems, thus yielding significant speedup in total inversion time. We consider an application from Transient Hydraulic Tomography (THT), which is an imaging technique to estimate hydraulic parameters related to the subsurface from pressure measurements obtained by a series of pumping tests. The algorithms discussed are applied to a synthetic example taken from THT to demonstrate the resulting computational gains of this proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Killing tensors, warped products and the orthogonal separation of the Hamilton-Jacobi equation

We study Killing tensors in the context of warped products and apply the results to the problem of orthogonal separation of the Hamilton-Jacobi equation. This work is motivated primarily by the case of spaces of constant curvature where warped products are abundant. We first characterize Killing tensors which have a natural algebraic decomposition in warped products. We then apply this result to show how one can obtain the Killing-Stäckel space (KS-space) for separable coordinate systems decomposable in warped products. This result in combination with Benenti's theory for constructing the KS-space of certain special separable coordinates can be used to obtain the KS-space for all orthogonal separable coordinates found by Kalnins and Miller in Riemannian spaces of constant curvature. Next we characterize when a natural Hamiltonian is separable in coordinates decomposable in a warped product by showing that the conditions originally given by Benenti can be reduced. Finally, we use this characterization and concircular tensors (a special type of torsionless conformal Killing tensor) to develop a general algorithm to determine when a natural Hamiltonian is separable in a special class of separable coordinates which include all orthogonal separable coordinates in spaces of constant curvature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A fingerprint based metric for measuring similarities of crystalline structures

Measuring similarities/dissimilarities between atomic structures is important for the exploration of potential energy landscapes. However, the cell vectors together with the coordinates of the atoms, which are generally used to describe periodic systems, are quantities not directly suitable as fingerprints to distinguish structures. Based on a characterization of the local environment of all atoms in a cell, we introduce crystal fingerprints that can be calculated easily and define configurational distances between crystalline structures that satisfy the mathematical properties of a metric. This distance between two configurations is a measure of their similarity/dissimilarity and it allows in particular to distinguish structures. The new method can be a useful tool within various energy landscape exploration schemes, such as minima hopping, random search, swarm intelligence algorithms, and high-throughput screenings.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantitative phase reconstruction from input-output intensities using a shift-invariant linear imaging system

We formulate an iteration scheme for quantitative two-dimensional phase retrieval of complex scalar wave fields from input-output intensity profiles using a coherent rotationally symmetric shift-invariant linear optical imaging system. This method is a generalization of our previous method for quantitative single-image pure phase reconstruction using an imperfect shift-invariant linear imaging system. The method is somewhat analogous to the Gerchberg-Saxton iterative phase-retrieval algorithm, but typically converges much more rapidly. We have demonstrated the efficacy of the method using simulated data in the presence of noise.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data analysis of gravitational-wave signals from spinning neutron stars. V. A narrow-band all-sky search

We present theory and algorithms to perform an all-sky coherent search for periodic signals of gravitational waves in narrow-band data of a detector. Our search is based on a statistic, commonly called the F-statistic, derived from the maximum-likelihood principle in Paper I of this series. We briefly review the response of a ground-based detector to the gravitational-wave signal from a rotating neuron star and the derivation of the F-statistic. We present several algorithms to calculate efficiently this statistic. In particular our algorithms are such that one can take advantage of the speed of fast Fourier transform in calculation of the F-statistic. We construct a grid in the parameter space such that the nodes of the grid coincide with the Fourier frequencies. We present interpolation methods that approximately convert the two integrals in the F-statistic into Fourier transforms so that the fast Fourier transform algorithm can be applied in their evaluation. We have implemented our methods and algorithms into computer codes and we present results of the Monte Carlo simulations performed to test these codes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Acyclic and star colorings of joins of graphs and an algorithm for cographs.

An acyclic coloring of a graph is a proper vertex coloring such that the subgraph induced by the union of any two color classes is a disjoint collection of trees. The more restricted notion of star coloring requires that the union of any two color classes induces a disjoint collection of stars. The acyclic and star chromatic numbers of a graph G are defined analogously to the chromatic number {chi}(G) and are denoted by {chi}{sub a}(G) and {chi}{sub s}(G), respectively. In this paper, we consider acyclic and star colorings of graphs that are decomposable with respect to the join operation, which builds a new graph from a collection of two or more disjoint graphs by adding all possible edges between them. In particular, we present a recursive formula for the acyclic chromatic number of joins of graphs and show that a similar formula holds for the star chromatic number. We also demonstrate the algorithmic implications of our results for the cographs, which have the unique property that they are recursively decomposable with respect to the join and disjoint union operations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Communication: The correct interpretation of surface hopping trajectories: How to calculate electronic properties

In a recent paper, we presented a road map for how Tully's fewest switches surface hopping (FSSH) algorithm can be derived, under certain circumstances, from the mixed quantum-classical Liouville equation. In this communication, we now demonstrate how this new interpretation of surface hopping can yield significantly enhanced results for electronic properties in nonadiabatic calculations. Specifically, we calculate diabatic populations for the spin-boson problem using FSSH trajectories. We show that, for some Hamiltonians, without changing the FSSH algorithm at all but rather simply reinterpreting the ensemble of surface hopping trajectories, we recover excellent results and remove any and all ambiguity about the initial condition problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical evaluation of convex-roof entanglement measures with applications to spin rings

We present two ready-to-use numerical algorithms to evaluate convex-roof extensions of arbitrary pure-state entanglement monotones. Their implementation leaves the user merely with the task of calculating derivatives of the respective pure-state measure. We provide numerical tests of the algorithms and demonstrate their good convergence properties. We further employ them in order to investigate the entanglement in particular few-spins systems at finite temperature. Namely, we consider ferromagnetic Heisenberg exchange-coupled spin-(1/2) rings subject to an inhomogeneous in-plane field geometry obeying full rotational symmetry around the axis perpendicular to the ring through its center. We demonstrate that highly entangled states can be obtained in these systems at sufficiently low temperatures and by tuning the strength of a magnetic field configuration to an optimal value which is identified numerically.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

PASTA: A Parallel Sparse Tensor Algorithm Benchmark Suite

Tensor methods have gained increasingly attention from various applications, including machine learning, quantum chemistry, healthcare analytics, social network analysis, data mining, and signal processing, to name a few. Sparse tensors and their algorithms become critical to further improve the performance of these methods and enhance the interpretability of their output. This work presents a sparse tensor algorithm benchmark suite (PASTA) for single- and multi-core CPUs. To the best of our knowledge, this is the first benchmark suite for sparse tensor world. PASTA targets on: 1) helping application users to evaluate different computer systems using its representative computational workloads; 2) providing insights to better utilize existed computer architecture and systems and inspiration for the future design. This benchmark suite will be publicly released.

HPC, sparse tensor, benchmark↗

Modelling transient heat conduction in solids at multiple length and time scales: A coupled non-equilibrium molecular dynamics/continuum approach

A method for controlling the thermal boundary conditions of non-equilibrium molecular dynamics simulations is presented. The method is simple to implement into a conventional molecular dynamics code and independent of the atomistic model employed. It works by regulating the temperature in a thermostatted boundary region by feedback control to achieve the desired temperature at the edge of an inner region where the true atomistic dynamics are retained. This is necessary to avoid intrinsic boundary effects in non-equilibrium molecular dynamics simulations. Three thermostats are investigated: the global deterministic Nose-Hoover thermostat and two local stochastic thermostats, Langevin and stadium damping. The latter thermostat is introduced to avoid the adverse reflection of phonons that occurs at an abrupt interface. The method is then extended to allow atomistic/continuum models to be thermally coupled concurrently for the analysis of large steady state and transient heat conduction problems. The effectiveness of the algorithm is demonstrated for the example of heat flow down a three-dimensional atomistic rod of uniform cross-section subjected to a variety of boundary conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Finite element formulation of fluctuating hydrodynamics for fluids filled with rigid particles using boundary fitted meshes

In this paper, we present a finite element implementation of fluctuating hydrodynamics with a moving boundary fitted mesh for treating the suspended particles. The thermal fluctuations are incorporated into the continuum equations using the Landau and Lifshitz approach [1]. The proposed implementation fulfills the fluctuation–dissipation theorem exactly at the discrete level. Since we restrict the equations to the creeping flow case, this takes the form of a relation between the diffusion coefficient matrix and friction matrix both at the particle and nodal level of the finite elements. Brownian motion of arbitrarily shaped particles in complex confinements can be considered within the present formulation. A multi-step time integration scheme is developed to correctly capture the drift term required in the stochastic differential equation (SDE) describing the evolution of the positions of the particles. The proposed approach is validated by simulating the Brownian motion of a sphere between two parallel plates and the motion of a spherical particle in a cylindrical cavity. The time integration algorithm and the fluctuating hydrodynamics implementation are then applied to study the diffusion and the equilibrium probability distribution of a confined circle under an external harmonic potential.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Attenuation of wall disturbances in an electron cyclotron resonance oxygen–argon plasma using real time control

Present practice in plasma-assisted semiconductor manufacturing specifies recipes in terms of inputs such as gas flow rates, power and pressure. However, ostensibly identical chambers running identical recipes may produce very different results. Extensive chamber matching, i.e., initial iterative, empirical tuning of the process recipe, which entails time-consuming, ex situ statistical analysis of process metrics such as etch depth, uniformity, anisotropy and selectivity, is required to ensure acceptable results. Once matched, chambers are run open loop and are thus sensitive to disturbances such as actuator drift, wall seasoning and substrate loading, which may impact negatively on process reproducibility. An alternative approach, which may obviate the need for chamber matching and reduce the sensitivity of process metrics to exogenous disturbances, would be to specify a recipe in terms of quantities such as active species densities, and to regulate these in real time by adjusting the inputs with a suitable control algorithm. In this work, real time control of an electron cyclotron resonance O{sub 2}/Ar plasma used for photoresist ashing has been implemented. The design of elementary, model-based algorithms for the control of the argon 750 and oxygen 844 line intensities measured by optical emission spectroscopy is described. Fluorination of the chamber walls by means of an SF{sub 6} plasma prior to ashing inhibits wall recombination of oxygen radicals resulting in an approximately 20% increase in ash rate in the open loop case. However, closed loop control almost completely attenuates the effect of fluorination, thus demonstrating the efficacy of the control algorithms in ensuring a reproducible ash rate in the face of a wall disturbance.

42 ENGINEERING↗

Formation Conditions and Stability Criteria for Small-Size Cluster Systems

The formation conditions and stability criteria for small-size cluster systems consisting of several particles interacting via an arbitrary isotropic pair potential are considered. Analytical criteria for instability development in horizontal (quasi-two-dimensional) and vertical (chain) structures consisting of three, four, and five charged particles are obtained for the first time. A simple algorithm to search for similar criteria in systems consisting of a larger number of particles is proposed. The obtained relations are verified by numerically solving the problem for Yukawa systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Polynomial Scaling Localized Active Space Unitary Selective Coupled Cluster Singles and Doubles

We present a polynomial-scaling algorithm for the localized active space unitary selective coupled cluster singles and doubles (LAS-USCCSD) method. In this approach, cluster excitations are selected based on a threshold ϵ determined by the absolute gradients of the LAS-UCCSD energy with respect to cluster amplitudes. Using the generalized Wick’s theorem for multireference wave functions, we derive the gradient expression as a polynomial function of one-, two-, and three-body reduced density matrices and 1- and 2-electron integrals, valid for any multireference wave function. The resulting gradient implementation exhibits a memory scaling of 𝒪(N 6 ), with N spin orbitals in the combined active space of all fragments. The variational quantum eigensolver is used to optimize the selected cluster excitations on a quantum simulator. Furthermore, by plotting the energy error, defined as the difference between the LAS-USCCSD and corresponding CASCI energies, against the inverse cluster amplitude selection threshold (ϵ –1 ) for polyene chains containing 2 to 5 π-bond units, we establish a relationship between the energy error and the threshold. To further validate the accuracy of LAS-USCCSD, we computed the cis–trans isomerization energy of stilbene (a 20-qubit system) and the magnetic coupling constant of the tris-hydroxo-bridged chromium dimer [Cr 2 (OH) 3 (NH 3 ) 6 ] 3+ (evaluated as both 12- and 20-qubit systems) using the Qiskit-Qulacs simulator. Assessing such examples is important to determine the practical feasibility of quantum simulations for chemically realistic systems. Toward this goal, with the LAS-USCCSD algorithm we estimated the quantum resources required for simulating an active space of (30e,22o) in [Cr 2 (OH) 3 (NH 3 ) 6 ] 3+ , a size that remains beyond the reach of current quantum simulators for accurate treatment.

Algorithms↗

Efficient antisymmetrization algorithm for the partially correlated wave functions in the free complement-local Schrödinger equation method

We propose here fast antisymmetrization procedures for the partially correlated wave functions that appear in the free complement-local Schrödinger equation (FC-LSE) method. Pre-analysis of the correlation diagram, referred to as dot analysis, combined with the determinant update technique based on the Laplace expansion, drastically reduces the orders of the antisymmetrization computations. When the complement functions include only up to single-correlated terms, the order of computations is O(N{sup 3}), which is the same as the non-correlated case. Similar acceleration is obtained for general correlated functions as a result of dot analysis. This algorithm has been successfully used in our laboratory in actual FC-LSE calculations for accurately solving the many-electron Schrödinger equations of atoms and molecules. The proposed method is general and applicable to the sampling-type methodology of other partially correlated wave functions like those in the quantum Monte Carlo and modern Hylleraas-type methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Gaussian Mean Field Lattice Gas

We study rigorously a lattice gas version of the Sherrington–Kirckpatrick spin glass model. In discrete optimization literature this problem is known as unconstrained binary quadratic programming and it belongs to the class NP-hard. We prove that the fluctuations of the ground state energy tend to vanish in the thermodynamic limit, and we give a lower bound of such ground state energy. Then we present a heuristic algorithm, based on a probabilistic cellular automaton, which seems to be able to find configurations with energy very close to the minimum, even for quite large instances.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗