Bounds for Error Reduction with Few Quantum Queries

14 years 5 months ago

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

Algorithms | APPROX 2005 | Quantum Database Search |

claim paper

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	APPROX
Authors	Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan

Comments (0)