Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematics and Computing, Computer science”

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 199 records · Page 11

Numerically Solving the Heat Equation

This lecture was presented at the 2017 LANL Parallel Computing Summer Research lecture and it describes the heat equation.

97 MATHEMATICS AND COMPUTING↗

The cost of embedding

This report describes the cost of embedding and its implication for quantum computing.

97 MATHEMATICS AND COMPUTING↗

Ising Processing Units: Potential and Challenges for Discrete Optimization

The recent emergence of novel computational devices, such as adiabatic quantum computers, CMOS annealers, and optical parametric oscillators, presents new opportunities for hybrid-optimization algorithms that leverage these kinds of specialized hardware. In this work, we propose the idea of an Ising processing unit as a computational abstraction for these emerging tools. Challenges involved in using and bench- marking these devices are presented, and open-source software tools are proposed to address some of these challenges. The proposed benchmarking tools and methodology are demonstrated by conducting a baseline study of established solution methods to a D-Wave 2X adiabatic quantum computer, one example of a commercially available Ising processing unit.

97 MATHEMATICS AND COMPUTING↗

Convex Relaxations in Power System Optimization, A Brief Introduction

Convex relaxations of the AC power ow equations have attracted signi cant interest in the power systems research community in recent years. The following collection of video lectures provides a brief introduction to the mathematics of AC power systems, continuous nonlinear optimization, and relaxations of the power ow equations. The aim of the videos is to provide the high level ideas of convex relaxations and their applications in power system optimization, and could be used as a starting point for researchers who want to study, use or develop new convex relaxations for use in their own research. The videos do not aim to provide an in-depth tutorial about speci c convex relaxations, but rather focus on ideas that are common to all convex relaxations of the AC optimal power ow problem. The videos assume minimal prerequisite knowledge and are designed to be accessible to a variety of disciplines (e.g. power system engineers, industrial engineers and computer scientists). They are designed to be modular, such that interested listeners can either watch the series as a whole, or choose only the subset that matches their interest. The following sections provide a brief overview of the topics and references covered in each video.

97 MATHEMATICS AND COMPUTING↗

Beyond Moore’s Law: Exploring the Future of Computation

Conclusions: Emerging computational hardware may fundamentally change optimization algorithm development; Ising Coprocessors are like ALUs or GPUs for optimization!; Based on initial benchmarking efforts D-Wave hardware is not outperforming state-of-the-art alternatives, but seems competitive

97 MATHEMATICS AND COMPUTING↗

The Potential of Quantum Annealing for Rapid Solution Structure Identification [Slides]

This presentation covers a framework for categorizing heuristics including neighborhood size, iterated local search, and performance metrics. The question, "How does Quantum Annealing stack up?" is addressed through Random with Fields (RANF-1), Biased Ferromagnet (BFM), and Corrupted Biased Ferromagnet (CBFM). Concluding thoughts are then given.

97 MATHEMATICS AND COMPUTING↗

Hamiltonian Simulation [Slides]

Given a (qubit) quantum system modeled by a Hamiltonian H, use a quantum computer to obtain time-evolved properties of the system. One way of solving this problem is by actually preparing the evolved quantum state (in some encoded fashion). The goal is to provide a sequence of elementary 1 and 2-qubit gates that would prepare such a state.

97 MATHEMATICS AND COMPUTING↗

Remapping of Data Between One-Dimensional Meshes

In this report we present two approaches to data remapping between one-dimensional meshes implemented with the c++ programming language. Our goal was to test the performance of two search algorithms, linear and binary, and verify the accuracy of our implementations of the two methods. We first introduce the concept of data remap and meshing components, as well as their various uses. We then delve into the differences between point-wise and conservative remap, the algorithms used in the implementations, and lastly confirm the implementations work as intended when given various inputs. We expect that, after profiling, the binary search algorithm will be more efficient than the linear algorithm for sorted sets of data, the point-wise remap implementation to accurately approximate the data transfer between two meshes, and the conservative remap implementation to conserve the area underneath the curve of two distinct meshes.

97 MATHEMATICS AND COMPUTING↗

Data Remapping Between One-Dimensional Meshes [Slides]

Two different remapping algorithms were implemented: point wise (node-to-node date remapping) and conservative (conserves the area under the curve. The performance of both linear and binary searches were studied and it was found that the binary search was more efficient.

97 MATHEMATICS AND COMPUTING↗

An Adaptive Optimizer for Measurement-Frugal Variational Algorithms

Variational hybrid quantum-classical algorithms (VHQCAs) have the potential to be useful in the era of near-term quantum computing. However, recently there has been concern regarding the number of measurements needed for convergence of VHQCAs. Here, we address this concern by investigating the classical optimizer in VHQCAs. We introduce a novel optimizer called individual Coupled Adaptive Number of Shots (iCANS). This adaptive optimizer frugally selects the number of measurements (i.e., number of shots) both for a given iteration and for a given partial derivative in a stochastic gradient descent. We numerically simulate the performance of iCANS for the variational quantum eigensolver and for variational quantum compiling, with and without noise. In all cases, and especially in the noisy case, iCANS tends to out-perform state-of-the-art optimizers for VHQCAs. We therefore believe this adaptive optimizer will be useful for realistic VHQCA implementations, where the number of measurements is limited.

97 MATHEMATICS AND COMPUTING↗