Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

20

APPROX
2005
Springer

favoriteEmaildiscussreport

104views Algorithms» more APPROX 2005»

Bounds for Error Reduction with Few Quantum Queries

14 years 1 months ago

Bounds for Error Reduction with Few Quantum Queries

Download people.cs.uchicago.edu

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

Real-time Traffic

Algorithms | APPROX 2005 | Quantum Database Search |

claim paper

Related Content

» Inverting a permutation is as hard as unordered search

» Quantum Integration Error on Some Classes of Multivariate Functions

» Quantum Search on BoundedError Inputs

» Lower Bounds for Quantum Search and Derandomization

» On the Efficiency of Classical and Quantum Oblivious Transfer Reductions

» Quantum Query Complexity of Multilinear Identity Testing

» Spatiotemporal data reduction with deterministic error bounds

» Quantum Query Complexity of Some Graph Problems

» Quantum lower bound for the collision problem

Post Info
More Details (n/a)

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

Comments (0)