Quantum lower bounds for the Goldreich-Levin problem

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

• Type: Journal
• Year: 2006
• Where: IPL
• Authors: Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H. Putra, Shigeru Yamashita
• Keywords: Goldreich-Levin Theorem, Inner Product, IPL 2006, Oracle