Quantum lower bounds for the Goldreich-Levin problem

13 years 4 months ago

Download www.cs.uwaterloo.ca

At the heart of the Goldreich-Levin Theorem is the problem of determining an n-bit string a by making queries to two oracles, referred to as IP (inner product) and EQ (equivalence). The IP oracle, on input x, returns a bit that is biased towards a

Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H

Real-time Traffic

Goldreich-Levin Theorem | Inner Product | IPL 2006 | Oracle |

claim paper

» A Quantum TimeSpace Lower Bound for the Counting Hierarchy

» Lower bounds for local search by quantum arguments

» Quantum lower bound for the collision problem

» Quantum Lower Bounds by Polynomials

» Adversary lower bounds for nonadaptive quantum algorithms

» A New Quantum Lower Bound Method with an Application to a Strong Direct Product Theorem fo...

» A lower bound for the SturmLiouville eigenvalue problem on a quantum computer

» New upper and lower bounds for randomized and quantum local search

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	IPL
Authors	Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H. Putra, Shigeru Yamashita

Comments (0)

Sciweavers

Quantum lower bounds for the Goldreich-Levin problem

Goldreich-Levin Theorem | Inner Product | IPL 2006 | Oracle |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers