Results 11 
15 of
15
Numerical Analysis on a Quantum Computer
"... We give a short introduction to quantum computing and its relation to numerical analysis. We survey recent research on quantum algorithms and quantum complexity theory for two basic numerical problems – high dimensional integration and approximation. Having matching upper and lower complexity bound ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We give a short introduction to quantum computing and its relation to numerical analysis. We survey recent research on quantum algorithms and quantum complexity theory for two basic numerical problems – high dimensional integration and approximation. Having matching upper and lower complexity bounds for the quantum setting, we are in a position to compare them with those for the classical deterministic and randomized setting, previously obtained in informationbased complexity theory. This enables us to assess the possible speedups quantum computation could provide over classical deterministic or randomized algorithms for these numerical problems.
and
, 2001
"... We consider the computation of the mean of sequences in the quantum model of computation. We determine the query complexity in the case of sequences which satisfy a psummability condition for 1 ≤ p < 2. This settles a problem left open in Heinrich (2001). 1 ..."
Abstract
 Add to MetaCart
We consider the computation of the mean of sequences in the quantum model of computation. We determine the query complexity in the case of sequences which satisfy a psummability condition for 1 ≤ p < 2. This settles a problem left open in Heinrich (2001). 1
Contents
, 2002
"... Abstract. In this paper, we use the methods found in [12] to create a continuous variable analogue of Shor’s quantum factoring algorithm. By this we mean a quantum hidden subgroup algorithm that finds the period P of a function Φ: R − → C from the reals R to the complex numbers C, where Φ belongs to ..."
Abstract
 Add to MetaCart
Abstract. In this paper, we use the methods found in [12] to create a continuous variable analogue of Shor’s quantum factoring algorithm. By this we mean a quantum hidden subgroup algorithm that finds the period P of a function Φ: R − → C from the reals R to the complex numbers C, where Φ belongs to a very general class of functions, called the class of admissible functions. This algorithm gives some insight into the inner workings of Shor’s quantum factoring algorithm.