Optimizing a polynomial function on a quantum processor

Optimizing DDA Code on a POWER5 Processor

In this paper we take an existing scientific computation code, DDA, and optimize it to run on an IBM Power5 processor. The DDA code, originally developed by a Ph.D. candidate in physics, suffers from excessive execution time caused by a high number of cache accesses and a low rate of instructions per cycle. Our goal is to improve the code’s performance by making a series of optimizations in a s...

Efficient quantum walk on a quantum processor.

The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to...

Determination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial

Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...

Optimizing Compiler for a CELL Processor

Developed for multimedia and game applications, as well as other numerically intensive workloads, the CELL processor provides support both for highly parallel codes, which have high computation and memory requirements, and for scalar codes, which require fast response time and a full-featured programming environment. This first generation CELL processor implements on a single chip a Power Archi...

Optimizing Compiler for a CELL Processor