The finite element method is used to approximately solve boundary value problems for
differential equations. The method discretizes the parameter space and finds an …

We describe a general method to obtain quantum speedups of classical algorithms which
are based on the technique of backtracking, a standard approach for solving constraint …

Most quantum algorithms offering speedups over classical algorithms are based on the
three techniques of phase estimation, amplitude estimation and Hamiltonian simulation. In …

A major advantage in using Szegedy's formalism over discrete-time and continuous-time
quantum walks lies in its ability to define a unitary quantum walk by quantizing a Markov …

Span programs are a model of computation that have been used to design quantum
algorithms, mainly in the query model. It is known that for any decision problem, there exists …

We present a novel application of the HHL (Harrow-Hassidim-Lloyd) algorithm--a quantum
algorithm solving systems of linear equations--in solving an open problem about quantum …

Quantum walks with memory (QWM) are types of modified quantum walks that record the
walker's latest path. The general model of coined QWM is presented in Li et al.(Phys Rev A …

This report details the findings of the DOE ASCR Workshop on Quantum Computing for
Science that was organized to assess the viability of quantum computing technologies to …

For twenty years, quantum computing has been catnip to science journalists. Not only would
a quantum computer harness the notorious weirdness of quantum mechanics, but it would …

Quantum computers have provided exponentially faster solutions to several physical and
engineering problems over existing classical solutions. In this paper we present two …