Sciweavers

629 search results - page 1 / 126
» The Generalized Quantum Database Search Algorithm
Sort
View
COMPUTING
2004
87views more  COMPUTING 2004»
13 years 10 months ago
The Generalized Quantum Database Search Algorithm
In this paper we present a generalized description of the Grover operator, employed in a quantum database search algorithm. We will discuss the relation between the original and ge...
Sándor Imre, Ferenc Balázs
ISCI
2000
80views more  ISCI 2000»
13 years 10 months ago
Quantum associative memory with distributed queries
This paper discusses a model of quantum associative memory which generalizes the completing associative memory proposed by Ventura and Martinez. Similar to this model, our system ...
A. A. Ezhov, A. V. Nifanova, Dan Ventura
APPROX
2005
Springer
104views Algorithms» more  APPROX 2005»
14 years 4 months ago
Bounds for Error Reduction with Few Quantum Queries
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
Sourav Chakraborty, Jaikumar Radhakrishnan, Nandak...
ICALP
2003
Springer
14 years 4 months ago
Quantum Search on Bounded-Error Inputs
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...
Peter Høyer, Michele Mosca, Ronald de Wolf
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
14 years 2 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson