30 search results - page 1 / 6 » Bounds for Error Reduction with Few Quantum Queries |
APPROX
2005
Springer
13 years 10 months ago
2005
Springer
We consider the quantum database search problem, where we are given a function f : [N] → {0, 1}, and are required to return an x ∈ [N] (a
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
ICIC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We study the approximation of the integration of multivariate functions classes in the quantum model of computation. We first obtain a lower bound of the n-th minimal qu...
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
CORR
1998
Springer
13 years 4 months ago
1998
Springer
We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In par...