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,441 records · Page 80

Scaling behavior of quantum nanosystems: Emergence of quasi-particles, collective modes, and mixed exchange symmetry states

Examples of quantum nanosystems are graphene nanoribbons, molecular wires, and superconducting nanoparticles. The objective of the multiscale theory presented here is to provide a new perspective on the coupling of processes across scales in space and time underlying the dynamics of these systems. The long range objective for this multiscale approach is to serve as an efficient computational algorithm. Long space-time dynamics is derived using a perturbation expansion in the ratio {epsilon} of the nearest-neighbor distance to a nanometer-scale characteristic length and a theorem on the equivalence of long time-averages and expectation values. This dynamics is shown to satisfy a coarse-grained wave equation (CGWE) which takes a Schroedinger-like form with modified masses and interactions. The scaling of space and time is determined by the orders of magnitude of various contributions to the N-body potential. If the spatial scale of the coarse-graining is too large, the CGWE would imply an unbounded growth of gradients; if it is too short, the system's size would display uncontrolled growth inappropriate for the bound states of interest, i.e., collective motion or migration within a stable nanoassembly. The balance of these two extremes removes arbitrariness in the choice of the scaling of space-time. Since the long-scale dynamics of each Fermion involves its interaction with many others, we hypothesize that the solutions of the CGWE have mean-field character to good approximation, i.e., can be factorized into single-particle functions. This leads to a coarse-grained mean-field approximation that is distinct in character from traditional Hartree-Fock theory. A variational principle is used to derive equations for the single-particle functions. This theme is developed and used to derive an equation for low-lying disturbances from the ground state corresponding to long wavelength density disturbances or long-scale migration. An algorithm for the efficient simulation of quantum nanosystems is suggested.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An efficient particle Fokker–Planck algorithm for rarefied gas flows

This paper is devoted to the algorithmic improvement and careful analysis of the Fokker–Planck kinetic model derived by Jenny et al. [1] and Gorji et al. [2]. The motivation behind the Fokker–Planck based particle methods is to gain efficiency in low Knudsen rarefied gas flow simulations, where conventional direct simulation Monte Carlo (DSMC) becomes expensive. This can be achieved due to the fact that the resulting model equations are continuous stochastic differential equations in velocity space. Accordingly, the computational particles evolve along independent stochastic paths and thus no collision needs to be calculated. Therefore the computational cost of the solution algorithm becomes independent of the Knudsen number. In the present study, different computational improvements were persuaded in order to augment the method, including an accurate time integration scheme, local time stepping and noise reduction. For assessment of the performance, gas flow around a cylinder and lid driven cavity flow were studied. Convergence rates, accuracy and computational costs were compared with respect to DSMC for a range of Knudsen numbers (from hydrodynamic regime up to above one). In all the considered cases, the model together with the proposed scheme give rise to very efficient yet accurate solution algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Implementation of Bin Packing Model for Reed Switch Production Planning

This paper presents a form to resolve a real problem of efficient material election in reed switch manufacturing. The carrying out of the consumer demands depends on the stochastic results of the classification process where each lot of switches is distributed into bins according to an electric measure value. Various glass types are employed for the switch manufacturing. The effect caused by the glass type variation on the switch classification results was investigated. Based on real data statistic analysis, the problem is reduced to the lot number minimizing taking into consideration the glass type, and interpreted as a bin packing problem generalization. On difference to the classic bin packing problem, in the considered case, an item represents a set of pieces; a container is divided into a number of bins (sub-containers); the bin capacity is variable; there are the assignment restrictions between bins and sets of pieces; the items are allowed to be fragmented into bins and containers. The problem has a high complexity. A heuristic offline algorithm is proposed to find the quantity, types and packing sequence of containers, the item fragments associated with containers and bins. The bin capacities do not affect the algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical simulation of the dynamics of a liquid crystal in the case of plane strain using GPUs

Parallel computational algorithm is worked out for numerical implementation of two-dimensional dynamic model of a liquid crystal, which takes into account the mutual influence of three physical effects – transfer of acoustic energy due to translational motion, viscoelastic rotation of the particles under the action of tangential stresses, anisotropic thermal expansion and compression. The algorithm is based on the Godunov gap decay method, the Ivanov scheme with controlled dissipation of energy and the splitting method with respect to spatial variables. The CUDA technology for computer systems with graphic accelerators is used. Results of computations demonstrating the efficiency of proposed method and algorithm are represented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cooperative pulses for pseudo-pure state preparation

Using an extended version of the optimal-control-based gradient ascent pulse engineering algorithm, cooperative (COOP) pulses are designed for multi-scan experiments to prepare pseudo-pure states in quantum computation. COOP pulses can cancel undesired signal contributions, complementing and generalizing phase cycles. They also provide more flexibility and, in particular, eliminate the need to select specific individual target states and achieve the fidelity of theoretical limit by flexibly choosing appropriate number of scans and duration of pulses. The COOP approach is experimentally demonstrated for three-qubit and four-qubit systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modeling the Echelle Spectra Continuum with Alpha Shapes and Local Regression Fitting

Continuum normalization of echelle spectra is an important data analysis step that is difficult to automate. Polynomial fitting requires a reasonably high-order model to follow the steep slope of the blaze function. However, in the presence of deep spectral lines, a high-order polynomial fit can result in ripples in the normalized continuum that increase errors in spectral analysis. Here, we present two algorithms for flattening the spectrum continuum. The Alpha-shape Fitting to Spectrum algorithm is completely data driven, using an alpha shape to obtain an initial estimate of the blaze function. The Alpha-shape and Lab Source Fitting to Spectrum algorithm incorporates a continuum constraint from a laboratory source reference spectrum for the blaze function estimation. These algorithms are tested on a simulated spectrum, where we demonstrate improved normalization compared to polynomial regression for continuum fitting. We show an additional application, using the algorithms for mitigation of spatially correlated quantum efficiency variations and fringing in the charge-coupled device detector of the EXtreme PREcision Spectrometer.

79 ASTRONOMY AND ASTROPHYSICS↗

A quantum eigenvalue solver based on tensor networks

Electronic ground states are of central importance in chemical simulations, but have remained beyond the reach of efficient classical algorithms except in cases of weak electron correlation or one-dimensional spatial geometry. We introduce a hybrid quantum-classical eigenvalue solver that constructs a wavefunction ansatz from a linear combination of matrix product states in rotated orbital bases, enabling the characterization of strongly correlated ground states with arbitrary spatial geometry. The energy is converged via a gradient-free generalized sweep algorithm based on quantum subspace diagonalization, with a potentially exponential speedup in the off-diagonal matrix element contractions upon translation into compact quantum circuits of linear depth in the number of qubits. Chemical accuracy is attained in numerical experiments for both a stretched water molecule and an octahedral arrangement of hydrogen atoms, achieving substantially better correlation energies compared to a unitary coupled-cluster benchmark, with orders of magnitude reductions in quantum resource estimates and a surprisingly high tolerance to shot noise. This proof-of-concept study suggests a promising new avenue for scaling up simulations of strongly correlated chemical systems on near-term quantum hardware.

chemistry↗

Ising model observables and non-backtracking walks

This paper presents an alternative proof of the connection between the partition function of the Ising model on a finite graph G and the set of non-backtracking walks on G. The techniques used also give formulas for spin-spin correlation functions in terms of non-backtracking walks. The main tools used are Viennot's theory of heaps of pieces and turning numbers on surfaces.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The generalized zero-mode supersymmetry scheme and the confluent algorithm

We show the relationship between the mathematical framework used in recent papers by Rosu et al. (2014) [1–3] and the second-order confluent supersymmetric quantum mechanics. In addition, we point out several immediate generalizations of the approach taken in the latter references. Furthermore, it is shown how to apply the generalized scheme to the Dirac and to the Fokker–Planck equation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Novel Relativistic Electronic Structure Theories for Actinide-Containing Compounds

Actinides of importance to basic energy sciences contain electrons moving at speed comparable to the speed of light. Reliable computational simulation of these electrons and hence actinide chemistry requires accurate description of relativistic effects. The present project advances computational actinide chemistry with development of new methodologies, algorithms, and computer programs in relativistic quantum chemistry, as well as applications to actinide chemistry and spectroscopy. A new “electrons-only” exact two-component approach has been developed to provide efficient treatments of relativistic effects, while maintaining chemical accuracy. New computational algorithms developed here extend the applicability of relativistic electron-correlation methods to larger molecules. The method-development work in this project also features the first implementation of analytic gradient technique for relativistic electron-correlation methods, which provides significantly enhanced ability to compute properties for molecules containing actinides. The applicability and usefulness of these new methods and computer programs have been demonstrated in calculations of actinide-containing molecules to facilitate understanding of actinide chemistry and spectroscopy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Force Field Development for Actinyl Ions via Quantum Mechanical Calculations: An Approach to Account for Many Body Solvation Effects

Advances in computational algorithms and methodologies make it possible to use highly accurate quantum mechanical calculations to develop force fields (pair-wise additive intermolecular potentials) for condensed phase simulations. Despite these advances, this approach faces numerous hurdles for the case of actinyl ions, AcO2n+ (high-oxidation-state actinide dioxo cations), mainly due to the complex electronic structure resulting from an interplay of s, p, d, and f valence orbitals. Traditional methods use a pair of molecules (“dimer”) to generate a potential energy surface (PES) for force field parametrization based on the assumption that many body polarization effects are negligible. We show that this is a poor approximation for aqueous phase uranyl ions and present an alternative approach for the development of actinyl ion force fields that includes important many body solvation effects. Force fields are developed for the UO22+ ion with the SPC/Fw, TIP3P, TIP4P, and TIP5P water models and are validated by carrying out detailed molecular simulations on the uranyl aqua ion, one of the most characterized actinide systems. It is shown that the force fields faithfully reproduce available experimental structural data and hydration free energies. Failure to account for solvation effects when generating PES leads to overbinding between UO22+ and water, resulting in incorrect hydration free energies and coordination numbers. A detailed analysis of arrangement of water molecules in the first and second solvation shell of UO22+ is presented. The use of a simple functional form involving the sum of Lennard-Jones + Coulomb potentials makes the new force field compatible with a large number of available molecular simulation engines and common force fields.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Antiferromagnetic character of the quantum phase transition in the Hubbard model on the honeycomb lattice

In this work we provide a unified, comprehensive treatment of all operators that contribute to the antiferromagnetic, ferromagnetic, and charge-density-wave structure factors and order parameters of the hexagonal Hubbard Model. We use the Hybrid Monte Carlo algorithm to perform a systematic, carefully controlled analysis in the temporal Trotter error and of the thermodynamic limit. We expect our findings to improve the consistency of Monte Carlo determinations of critical exponents. We perform a data collapse analysis and determine the critical exponent β = 0.898 (37) for the semimetal-Mott insulator transition in the hexagonal Hubbard Model. Our methods are applicable to a wide range of lattice theories of strongly correlated electrons.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Stochastic quasi-steady state approximations for asymptotic solutions of the chemical master equation

In this paper, we propose two methods to carry out the quasi-steady state approximation in stochastic models of enzyme catalytic regulation, based on WKB asymptotics of the chemical master equation or of the corresponding partial differential equation for the generating function. The first of the methods we propose involves the development of multiscale generalisation of a WKB approximation of the solution of the master equation, where the separation of time scales is made explicit which allows us to apply the quasi-steady state approximation in a straightforward manner. To the lowest order, the multi-scale WKB method provides a quasi-steady state, Gaussian approximation of the probability distribution. The second method is based on the Hamilton-Jacobi representation of the stochastic process where, as predicted by large deviation theory, the solution of the partial differential equation for the corresponding characteristic function is given in terms of an effective action functional. The optimal transition paths between two states are then given by those paths that maximise the effective action. Such paths are the solutions of the Hamilton equations for the Hamiltonian associated to the effective action functional. The quasi-steady state approximation is applied to the Hamilton equations thus providing an approximation to the optimal transition paths and the transition time between two states. Using this approximation we predict that, unlike the mean-field quasi-steady approximation result, the rate of enzyme catalysis depends explicitly on the initial number of enzyme molecules. The accuracy and validity of our approximated results as well as that of our predictions regarding the behaviour of the stochastic enzyme catalytic models are verified by direct simulation of the stochastic model using Gillespie stochastic simulation algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Los Alamos National Laboratory Quantum Overview

Los Alamos supports the National Quantum Initiative and the Laboratory's national security mission by tackling quantum science and technology challenges. Los Alamos is a strategic partner of the Quantum Science Center hub and leads the simulations and algorithms thrusts.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Combining dynamical decoupling with optimal control for improved QIP.

Constructing high-fidelity control pulses that are robust to control and system/environment fluctuations is a crucial objective for quantum information processing (QIP). We combine dynamical decoupling (DD) with optimal control (OC) to identify control pulses that achieve this objective numerically. Previous DD work has shown that general errors up to (but not including) third order can be removed from {pi}- and {pi}/2-pulses without concatenation. By systematically integrating DD and OC, we are able to increase pulse fidelity beyond this limit. Our hybrid method of quantum control incorporates a newly-developed algorithm for robust OC, providing a nested DD-OC approach to generate robust controls. Motivated by solid-state QIP, we also incorporate relevant experimental constraints into this DD-OC formalism. To demonstrate the advantage of our approach, the resulting quantum controls are compared to previous DD results in open and uncertain model systems.

99 GENERAL AND MISCELLANEOUS↗

Entanglement spectroscopy with a depth-two quantum circuit

Noisy intermediate-scale quantum (NISQ) computers have gate errors and decoherence, limiting the depth of circuits that can be implemented on them. Here, a strategy for NISQ algorithms is to reduce the circuit depth at the expense of increasing the qubit count.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Using IBM-Q to Study and Visualize the Ground State Properties of the Su-Schrieffer-Heeger Model

Quantum computing takes advantage of quantum mechanical properties such as superposition and entanglement in order to perform calculations that are too intensive for a classical computer. Richard Feynmann came up with the idea of quantum computers in 1982, where it was only theoretically motivated until the creation of Shor’s algorithm. This algorithm involves the factorization of large numbers, which in turn makes it possible to break encryption keys. Quantum computers would be capable of using Shor’s algorithm to crack encryptions at a significantly faster speed than a classical computer, which provided the motivation to start developing quantum computers to run Shor’s algorithm and discover other uses. In the present day, companies such as Google, Microsoft, D-Wave Systems, Rigetti Computing, and IBM are building quantum computers using different techniques and racing to achieve quantum supremacy. The purpose of quantum computing is to perform calculations that are too difficult to be executed on classical computers. But before we are able to use these computers, we must first prove that they are able to use quantum mechanics that will in turn be used to perform the calculations. As a proof of principle we use algorithms that can be done classically and compare those results to that of the quantum computer. In theory, if the quantum computer works for small qubit systems, larger qubit systems can be implemented and run on quantum computers.

97 MATHEMATICS AND COMPUTING↗

A method for data handling numerical results in parallel OpenFOAM simulations

Parallel computational fluid dynamics simulations produce vast amount of numerical result data. This paper introduces a method for reducing the size of the data by replaying the interprocessor traffic. The results are recovered only in certain regions of interest configured by the user. A known test case is used for several mesh partitioning scenarios using the OpenFOAM toolkit{sup ®}[1]. The space savings obtained with classic algorithms remain constant for more than 60 Gb of floating point data. Our method is most efficient on large simulation meshes and is much better suited for compressing large scale simulation results than the regular algorithms.

42 ENGINEERING↗