Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum algorithms & computation”

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,261 records · Page 70
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Quantum computation for early universe cosmology

With the emergence of quantum computing we can, in theory, run complex simulations with many variables. For the field of cosmology, this could lend itself to applications in modeling the early universe as a quantum system to better understand large scale properties of the universe today. Here we utilize the hybrid variational quantum eigensolver (VQE) algorithm applied to an anharmonic oscillator system using QISKit to examine it's effectiveness for these cosmological questions. We then analyze a 1+1 dimensional ring of scalar bosons acting on a lattice as a naive model of the early universe. We chose to focus on rings of 3 and 5 massive scalars in 1+1 dimensions for our study to test the effectiveness of our approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Extracting the diffusion tensor from molecular dynamics simulation with Milestoning

We propose an algorithm to extract the diffusion tensor from Molecular Dynamics simulations with Milestoning. A Kramers-Moyal expansion of a discrete master equation, which is the Markovian limit of the Milestoning theory, determines the diffusion tensor. To test the algorithm, we analyze overdamped Langevin trajectories and recover a multidimensional Fokker-Planck equation. The recovery process determines the flux through a mesh and estimates local kinetic parameters. Rate coefficients are converted to the derivatives of the potential of mean force and to coordinate dependent diffusion tensor. We illustrate the computation on simple models and on an atomically detailed system—the diffusion along the backbone torsions of a solvated alanine dipeptide.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

A Communication-Optimal Framework for Contracting Distributed Tensors

Tensor contractions are extremely compute intensive generalized matrix multiplication operations encountered in many computational science fields, such as quantum chemistry and nuclear physics. Unlike distributed matrix multiplication, which has been extensively studied, limited work has been done in understanding distributed tensor contractions. In this paper, we characterize distributed tensor contraction algorithms on torus networks. We develop a framework with three fundamental communication operators to generate communication-efficient contraction algorithms for arbitrary tensor contractions. We show that for a given amount of memory per processor, our framework is communication optimal for all tensor contractions. We demonstrate performance and scalability of our framework on up to 262,144 cores of BG/Q supercomputer using five tensor contraction examples.

communication efficiency↗
DOE OSTI2021

Stabilizer Rank Strong Simulation v.0.1

This software improves upon the Clifford gate+T gate magic state strong simulation algorithm by Brayvi and Gosset. It provides a better stabilizer state decomposition that scales as 2^{0.463t}, an improvement over 2^{0.468t}, for t T gate magic states. This code enables simulations of universal quantum computing with that asymptotic scaling cost. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525 SAND2020-14293 O

SciDAC↗
NASA NTRS1995

High Performance Parallel Computational Nanotechnology

At a recent press conference, NASA Administrator Dan Goldin encouraged NASA Ames Research Center to take a lead role in promoting research and development of advanced, high-performance computer technology, including nanotechnology. Manufacturers of leading-edge microprocessors currently perform large-scale simulations in the design and verification of semiconductor devices and microprocessors. Recently, the need for this intensive simulation and modeling analysis has greatly increased, due in part to the ever-increasing complexity of these devices, as well as the lessons of experiences such as the Pentium fiasco. Simulation, modeling, testing, and validation will be even more important for designing molecular computers because of the complex specification of millions of atoms, thousands of assembly steps, as well as the simulation and modeling needed to ensure reliable, robust and efficient fabrication of the molecular devices. The software for this capacity does not exist today, but it can be extrapolated from the software currently used in molecular modeling for other applications: semi-empirical methods, ab initio methods, self-consistent field methods, Hartree-Fock methods, molecular mechanics; and simulation methods for diamondoid structures. In as much as it seems clear that the application of such methods in nanotechnology will require powerful, highly powerful systems, this talk will discuss techniques and issues for performing these types of computations on parallel systems. We will describe system design issues (memory, I/O, mass storage, operating system requirements, special user interface issues, interconnects, bandwidths, and programming languages) involved in parallel methods for scalable classical, semiclassical, quantum, molecular mechanics, and continuum models; molecular nanotechnology computer-aided designs (NanoCAD) techniques; visualization using virtual reality techniques of structural models and assembly sequences; software required to control mini robotic manipulators for positional control; scalable numerical algorithms for reliability, verifications and testability. There appears no fundamental obstacle to simulating molecular compilers and molecular computers on high performance parallel computers, just as the Boeing 777 was simulated on a computer before manufacturing it.

Saini, Subhash↗
DOE OSTI2013

Analytic and algorithmic aspects of generalized harmonic sums and polylogarithms

In recent three-loop calculations of massive Feynman integrals within Quantum Chromodynamics (QCD) and, e.g., in recent combinatorial problems the so-called generalized harmonic sums (in short S-sums) arise. They are characterized by rational (or real) numerator weights also different from ±1. In this article we explore the algorithmic and analytic properties of these sums systematically. We work out the Mellin and inverse Mellin transform which connects the sums under consideration with the associated Poincaré iterated integrals, also called generalized harmonic polylogarithms. In this regard, we obtain explicit analytic continuations by means of asymptotic expansions of the S-sums which started to occur frequently in current QCD calculations. In addition, we derive algebraic and structural relations, like differentiation with respect to the external summation index and different multi-argument relations, for the compactification of S-sum expressions. Finally, we calculate algebraic relations for infinite S-sums, or equivalently for generalized harmonic polylogarithms evaluated at special values. The corresponding algorithms and relations are encoded in the computer algebra package HarmonicSums.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2019

Unitary qubit lattice algorithm for three-dimensional vortex solitons in hyperbolic self-defocusing media

To obtain stable vortex structures in three-dimensional (3D) nonlinear optics, Efremidis et al. (2007) have introduced a generalized Nonlinear Schrodinger equation (NLS) in which the transverse quantum vortex components are stabilized by a longitudinal bright soliton: i.e., the elliptic operator ∇ 2 is replaced by its hyperbolic counterpart ∇ ⊥ 2 - ∂ 2 / ∂ z 2 . A new 3D mesoscopic qubit unitary lattice algorithm is developed for this generalized NLS. One introduces 2 qubits for each lattice site and entangles them with a local unitary collision operator. This entanglement is then spread throughout the lattice by nearest neighbor streaming. These interwined operators lead to an extremely well parallelized code on classical supcomputers while their unitary structure will permit encoding onto a quantum computer. Somewhat unexpectedly, the hyperbolic operator can be realized from variations in the collision operator, without introducing variations in the streaming operator. The initial line vortices are generated by Pade asymptotics. The energy constraint is conserved to 10 digit accuracy.

3D solitons↗
DOE OSTI2014

An improved fast multipole method for electrostatic potential calculations in a class of coarse-grained molecular simulations

This paper presents a novel algorithm to approximate the long-range electrostatic potential field in the Cartesian coordinates applicable to 3D coarse-grained simulations of biopolymers. In such models, coarse-grained clusters are formed via treating groups of atoms as rigid and/or flexible bodies connected together via kinematic joints. Therefore, multibody dynamic techniques are used to form and solve the equations of motion of such coarse-grained systems. In this article, the approximations for the potential fields due to the interaction between a highly negatively/positively charged pseudo-atom and charged particles, as well as the interaction between clusters of charged particles, are presented. These approximations are expressed in terms of physical and geometrical properties of the bodies such as the entire charge, the location of the center of charge, and the pseudo-inertia tensor about the center of charge of the clusters. Further, a novel substructuring scheme is introduced to implement the presented far-field potential evaluations in a binary tree framework as opposed to the existing quadtree and octree strategies of implementing fast multipole method. Using the presented Lagrangian grids, the electrostatic potential is recursively calculated via sweeping two passes: assembly and disassembly. In the assembly pass, adjacent charged bodies are combined together to form new clusters. Then, the potential field of each cluster due to its interaction with faraway resulting clusters is recursively calculated in the disassembly pass. The method is highly compatible with multibody dynamic schemes to model coarse-grained biopolymers. Since the proposed method takes advantage of constant physical and geometrical properties of rigid clusters, improvement in the overall computational cost is observed comparing to the tradition application of fast multipole method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Precision Computations in Strongly Coupled Conformal Field Theories (Final Technical Report)

Conformal Field Theories (CFTs) are quantum field theories that are invariant under the conformal symmetry group (which includes translations and rotations, but also local rescalings of spacetime). They are building blocks of general quantum field theories, and appear in many areas of physics, including statistical physics, condensed matter physics, particle physics, and quantum gravity. Because of their extra symmetries, the mathematical structure of CFTs is tightly constrained, and this leads to the idea of the ``conformal bootstrap," which is to use these mathematical structures to constrain, and in some cases determine, CFT observables. A new numerical implementation of the conformal bootstrap idea appeared in 2008 with the work of Rattazzi, Rychkov, Tonni, and Vichi. Their observation was that certain bootstrap constraints (conformal symmetry and unitarity) could be combined to yield a convex optimization problem that constraints CFT data. By solving this convex optimization problem on a computer, one could obtain bounds on observables like critical exponents and operator product expansion (OPE) coefficients. Over the course of this award, the PI has improved numerical bootstrap techniques by optimizing known algorithms and finding new ones for performing the required convex optimization computations. The PI has applied these techniques to compute high-precision observables in several important strongly-coupled systems. The PI has also explored both analytical and numerical bootstrap methods for constraining the space of low energy effective field theories of quantum gravity, and developed new analytical techniques for CFT and QFT more broadly.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Clifford Circuit-Based Heuristic Optimization of Fermion-To-Qubit Mappings

Simulation of interacting Fermionic Hamiltonians is one of the most promising applications of quantum computers. However, the feasibility of analyzing Fermionic systems with a quantum computer hinges on the efficiency of Fermion-to-qubit mappings that encode nonlocal Fermionic degrees of freedom in local qubit degrees of freedom. While recent studies have highlighted the importance of designing Fermion-to-qubit mappings that are tailored to specific problem Hamiltonians, the methods proposed so far either are restricted to a narrow class of mappings or they use computationally expensive and unscalable brute-force search algorithms. Here, in this work, we address this challenge by designing a heuristic numerical optimization framework for Fermion-to-qubit mappings. To this end, we first translate the Fermion-to-qubit mapping problem to a Clifford circuit optimization problem and then use simulated annealing to optimize the average Pauli weight of the problem Hamiltonian. For all Fermionic Hamiltonians we have considered, the numerically optimized mappings outperform their conventional counterparts, including ternary-tree-based mappings that are known to be optimal for single creation and annihilation operators. We find that our optimized mappings yield between 15% and 40% improvements on the average Pauli weight when the simulation Hamiltonian has an intermediate level of complexity. Most remarkably, the optimized mappings improve the average Pauli weight for 6 × 6 nearest-neighbor hopping and Hubbard models by more than 40% and 20%, respectively. Surprisingly, we also find specific interaction Hamiltonians for which the optimized mapping outperforms any ternary-tree-based mapping. Our results establish heuristic numerical optimization as an effective method for obtaining mappings tailored for specific Fermionic Hamiltonian.

Hamiltonians↗
DOE OSTI2025

Lanczos Algorithm, the Transfer Matrix, and the Signal-to-Noise Problem

This Letter introduces a method for determining the energy spectrum of lattice quantum chromodynamics by applying the Lanczos algorithm to the transfer matrix and using a bootstrap generalization of the Cullum-Willoughby method to filter out spurious eigenvalues. Proof-of-principle analyses of the simple harmonic oscillator and the lattice quantum chromodynamics proton mass demonstrate that this method provides faster ground-state convergence than the “effective mass,” which is related to the power-iteration algorithm. Lanczos provides more accurate energy estimates than multistate fits to correlation functions with small imaginary times while achieving comparable statistical precision. Two-sided error bounds are computed for Lanczos results and guarantee that excited-state effects cannot shift Lanczos results far outside their statistical uncertainties.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Indexed improvements for real-time trotter evolution of a (1 + 1) field theory using NISQ quantum computers

Today's quantum computers offer the possibility of performing real-time calculations for quantum field theory scattering processes motivated by high energy physics. In order to follow the successful roadmap which has been established for the calculation of static properties at Euclidean time, it is crucial to develop new algorithmic methods to deal with the limitations of current noisy intermediate-scale quantum (NISQ) devices and to establish quantitative measures of the progress made with different devices. In this paper, we report recent progress in these directions. We show that nonlinear aspects of the trotter errors allow us to take much larger step then suggested by low-order analysis. This is crucial to reach physically relevant time scales with today's NISQ technology. We propose to use an index averaging absolute values of the difference between the accurately calculated trotter evolution of site occupations and their actual measurements on NISQ machines (G index) as a measure to compare results that have been obtained from different hardware platforms. Using the transverse Ising model in one spatial dimension with four sites we apply this metric across several hardware platforms. We study the results including readout mitigation and Richardson extrapolations and show that the mitigated measurements are very effective based on the analysis of the trotter step size modifications. Furthermore, we discuss how this advance in the trotter step size procedures can improve quantum computing physics scattering results and how this technical advance can be applied to other machines and noise mitigation methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

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↗
DOE OSTI2020

PySpawn: Software for Nonadiabatic Quantum Molecular Dynamics

The ab initio multiple spawning (AIMS) method enables nonadiabatic quantum molecular dynamics simulations in an arbitrary number of dimensions, with potential energy surfaces provided by electronic structure calculations performed on-the-fly. However, the intricacy of the AIMS algorithm complicates software development, deployment on modern shared computer resources, and post-simulation data analysis. PySpawn is a nonadiabatic molecular dynamics software package that addresses these issues. Here, the program is designed to be easily interfaced with electronic structure software, and an interface to the TeraChem software package is described here. PySpawn introduces a task-based reorganization of the AIMS algorithm, allowing fine-grained restart capability and setting the stage for efficient parallelization in a future release. PySpawn includes a user-friendly and interactive Python analysis module that will enable novice users to painlessly adopt AIMS. As a demonstration of PySpawn’s simulation capability and analysis module, we report complete active space self-consistent field–based AIMS simulations of the 1,2- dithienyl-1,2-dicyanoethene molecule, a promising molecular photoswitch.

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

Energy–Geometry Dependency of Molecular Structures: A Multistep Machine Learning Approach

There is growing interest in estimating quantum observables while circumventing expensive computational overhead for facile in silico materials screening. Machine learning (ML) methods are implemented to perform such calculations in shorter times. In this paper, we introduce a multistep method based on machine learning algorithms to estimate total energy on the basis of spatial coordinates and charges for various chemical structures, including organic molecules, inorganic molecules, and ions. This method quickly calculates total energy with 0.76 au in root-mean-square error (RMSE) and 1.5% in mean absolute percent error (MAPE) when tested on a database of optimized and unoptimized structures. Using similar molecular representations, experimental thermochemical properties were estimated, with MAPE as low as 6% and RMSE of 8 cal/mol·K for heat capacity in a 10-fold cross-validation.

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

Quantum simulation of dissipative processes without reservoir engineering

We present a quantum algorithm to simulate general finite dimensional Lindblad master equations without the requirement of engineering the system-environment interactions. The proposed method is able to simulate both Markovian and non-Markovian quantum dynamics. It consists in the quantum computation of the dissipative corrections to the unitary evolution of the system of interest, via the reconstruction of the response functions associated with the Lindblad operators. Our approach is equally applicable to dynamics generated by effectively non-Hermitian Hamiltonians. We confirm the quality of our method providing specific error bounds that quantify its accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Quantum pixel representations and compression for N-dimensional images

Abstract We introduce a novel and uniform framework for quantum pixel representations that overarches many of the most popular representations proposed in the recent literature, such as (I)FRQI, (I)NEQR, MCRQI, and (I)NCQI. The proposed QPIXL framework results in more efficient circuit implementations and significantly reduces the gate complexity for all considered quantum pixel representations. Our method scales linearly in the number of pixels and does not use ancilla qubits. Furthermore, the circuits only consist of $$R_y$$ R y gates and $$\text {CNOT}$$ CNOT gates making them practical in the NISQ era. Additionally, we propose a circuit and image compression algorithm that is shown to be highly effective, being able to reduce the necessary gates to prepare an FRQI state for example scientific images by up to 90% without sacrificing image quality. Our algorithms are made publicly available as part of , a Quantum Image Pixel Library.

97 MATHEMATICS AND COMPUTING↗