Results 1  10
of
15
Quantum summation with an application to integration
, 2001
"... We study summation of sequences and integration in the quantum model of computation. We develop quantum algorithms for computing the mean of sequences which satisfy a psummability ( condition and for d integration of functions from Lebesgue spaces Lp [0, 1] ) and analyze their convergence rates. We ..."
Abstract

Cited by 39 (11 self)
 Add to MetaCart
We study summation of sequences and integration in the quantum model of computation. We develop quantum algorithms for computing the mean of sequences which satisfy a psummability ( condition and for d integration of functions from Lebesgue spaces Lp [0, 1] ) and analyze their convergence rates. We also prove lower bounds which show that the proposed algorithms are, in many cases, optimal within the setting of quantum computing. This extends recent results of Brassard, Høyer, Mosca, and Tapp (2000) on computing the mean for bounded sequences and complements results of Novak (2001) on integration of functions from Hölder classes.
Information and Computation: Classical and Quantum Aspects
 REVIEWS OF MODERN PHYSICS
, 2001
"... Quantum theory has found a new field of applications in the realm of information and computation during the recent years. This paper reviews how quantum physics allows information coding in classically unexpected and subtle nonlocal ways, as well as information processing with an efficiency largely ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
Quantum theory has found a new field of applications in the realm of information and computation during the recent years. This paper reviews how quantum physics allows information coding in classically unexpected and subtle nonlocal ways, as well as information processing with an efficiency largely surpassing that of the present and foreseeable classical computers. Some outstanding aspects of classical and quantum information theory will be addressed here. Quantum teleportation, dense coding, and quantum cryptography are discussed as a few samples of the impact of quanta in the transmission of information. Quantum logic gates and quantum algorithms are also discussed as instances of the improvement in information processing by a quantum computer. We provide finally some examples of current experimental
A Rosetta stone for quantum mechanics with an introduction to quantum computation
, 2002
"... Abstract. The purpose of these lecture notes is to provide readers, who have some mathematical background but little or no exposure to quantum mechanics and quantum computation, with enough material to begin reading ..."
Abstract

Cited by 21 (9 self)
 Add to MetaCart
Abstract. The purpose of these lecture notes is to provide readers, who have some mathematical background but little or no exposure to quantum mechanics and quantum computation, with enough material to begin reading
Tractability of approximation for weighted Korobov spaces on classical and quantum computers
 Found. of Comput. Math
"... We study the approximation problem (or problem of optimal recovery in the L2norm) for weighted Korobov spaces with smoothness parameter α. The weights γj of the Korobov spaces moderate the behavior of periodic functions with respect to successive variables. The nonnegative smoothness parameter α me ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We study the approximation problem (or problem of optimal recovery in the L2norm) for weighted Korobov spaces with smoothness parameter α. The weights γj of the Korobov spaces moderate the behavior of periodic functions with respect to successive variables. The nonnegative smoothness parameter α measures the decay of Fourier coefficients. For α = 0, the Korobov space is the L2 space, whereas for positive α, the Korobov space is a space of periodic functions with some smoothness and the approximation problem corresponds to a compact operator. The periodic functions are defined on [0,1] d and our main interest is when the dimension d varies and may be large. We consider algorithms using two different classes of information. The first class Λ all consists of arbitrary linear functionals. The second class Λ std consists of only function values and this class is more realistic in practical computations. We want to know when the approximation problem is tractable. Tractability means that there exists an algorithm whose error is at most ε and whose information cost is bounded by a polynomial in the dimension d and in ε −1. Strong tractability means that
From Monte Carlo to Quantum Computation
 PROCEEDINGS OF THE 3RD IMACS SEMINAR ON MONTE CARLO METHODS MCM2001, SALZBURG, SPECIAL ISSUE OF MATHEMATICS AND COMPUTERS IN SIMULATION
, 2003
"... Quantum computing was so far mainly concerned with discrete problems. Recently, E. Novak and the author studied quantum algorithms for high dimensional integration and dealt with the question, which advantages quantum computing can bring over classical deterministic or randomized methods for this ty ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Quantum computing was so far mainly concerned with discrete problems. Recently, E. Novak and the author studied quantum algorithms for high dimensional integration and dealt with the question, which advantages quantum computing can bring over classical deterministic or randomized methods for this type of problem. In this
Quantum hidden subgroup algorithms on free groups, (in preparation
"... Abstract. One of the most promising and versatile approaches to creating new quantum algorithms is based on the quantum hidden subgroup (QHS) paradigm, originally suggested by Alexei Kitaev. This class of quantum algorithms encompasses the DeutschJozsa, Simon, Shor algorithms, and many more. In thi ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Abstract. One of the most promising and versatile approaches to creating new quantum algorithms is based on the quantum hidden subgroup (QHS) paradigm, originally suggested by Alexei Kitaev. This class of quantum algorithms encompasses the DeutschJozsa, Simon, Shor algorithms, and many more. In this paper, our strategy for finding new quantum algorithms is to decompose Shor’s quantum factoring algorithm into its basic primitives, then to generalize these primitives, and finally to show how to reassemble them into new QHS algorithms. Taking an ”alphabetic building blocks approach, ” we use these primitives to form an ”algorithmic toolkit ” for the creation of new quantum algorithms, such as wandering Shor algorithms, continuous Shor algorithms, the quantum circle algorithm, the dual Shor algorithm, a QHS algorithm for Feynman integrals, free QHS algorithms, and more. Toward the end of this paper, we show how Grover’s algorithm is most surprisingly “almost ” a QHS algorithm, and how this result suggests the possibility of an even more complete ”algorithmic tookit ” beyond the QHS algorithms. Contents
Zeno machines and hypercomputation
 Theoretical Computer Science
"... This paper reviews the ChurchTuring Thesis (or rather, theses) with reference to their origin and application and considers some models of “hypercomputation”, concentrating on perhaps the most straightforward option: Zeno machines (Turing machines with accelerating clock). The halting problem is br ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
This paper reviews the ChurchTuring Thesis (or rather, theses) with reference to their origin and application and considers some models of “hypercomputation”, concentrating on perhaps the most straightforward option: Zeno machines (Turing machines with accelerating clock). The halting problem is briefly discussed in a general context and the suggestion that it is an inevitable companion of any reasonable computational model is emphasised. It is suggested that claims to have “broken the Turing barrier ” could be toned down and that the important and wellfounded rôle of Turing computability in the mathematical sciences stands unchallenged.
Decoherence in discrete quantum walks
 Selected Lectures from DICE 2002. Lecture Notes in Physics, 633:253–267
, 2003
"... Abstract. We present an introduction to coined quantum walks on regular graphs, which have been developed in the past few years as an alternative to quantum Fourier transforms for underpinning algorithms for quantum computation. We then describe our results on the effects of decoherence on these qua ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. We present an introduction to coined quantum walks on regular graphs, which have been developed in the past few years as an alternative to quantum Fourier transforms for underpinning algorithms for quantum computation. We then describe our results on the effects of decoherence on these quantum walks on a line, cycle and hypercube. We find high sensitivity to decoherence, increasing with the number of steps in the walk, as the particle is becoming more delocalised with each step. However, the effect of a small amount of decoherence can be to enhance the properties of the quantum walk that are desirable for the development of quantum algorithms, such as fast mixing times to uniform distributions. 1 Introduction to Quantum Walks Quantum walks are based on a generalisation of classical random walks, which have found many applications in the field of computing. Examples of the power of classical random walks to solve hard problems include algorithms for solving kSAT [1], estimating the volume of a convex body [2], and approximation of
A CONTINUOUS VARIABLE SHOR ALGORITHM
, 2004
"... Abstract. In this paper, we use the methods found in [21] 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 − → R from the reals R to the reals R, where Φ belongs to a very ge ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. In this paper, we use the methods found in [21] 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 − → R from the reals R to the reals R, where Φ belongs to a very general class of functions, called the class of admissible functions. One objective in creating this continuous variable quantum algorithm was to make the structure of Shor’s factoring algorithm more mathematically transparent, and thereby give some insight into the inner workings of Shor’s original algorithm. This continuous quantum algorithm also gives some insight into the inner workings of Hallgren’s Pell’s equation algorithm. Two key questions remain unanswered. Is this quantum algorithm more efficient than its classical continuous variable counterpart? Is this quantum
Continuous Quantum Hidden Subgroup Algorithms
, 2003
"... In this paper we show how to construct two continuous variable and one continuous functional quantum hidden subgroup (QHS) algorithms. These are respectively quantum algorithms on the additive group of reals R, the additive group R/Z of the reals R mod 1, i.e., the circle, and the additive group Pat ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper we show how to construct two continuous variable and one continuous functional quantum hidden subgroup (QHS) algorithms. These are respectively quantum algorithms on the additive group of reals R, the additive group R/Z of the reals R mod 1, i.e., the circle, and the additive group Paths of L 2 paths x: [0, 1] → R n in real nspace R n. Also included is a curious discrete QHS algorithm which is dual to Shor’s algorithm. Contents 1