Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  give a tight lor bound of ( p n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communication complexity protocol of O(logn) qubits for this problem,  obtain an exponential separation of quantum and classical one-way communication complexity for partial functions. A similar result was independently obtained by Gavinsky, Kempe, de Wolf [GKdW06]. Our lor bound is obtained by Fourier analysis, using the Fourier coecients inequality of Kahn Kalai and Linial [KKL88].
['Iordanis Kerenidis', 'Ran Raz']
I am writing a research paper on a idea The one-way communication complexity of the Boolean Hidden Matching Problem
[{"from": "human", "value": "I am writing a research paper on a idea The one-way communication complexity of the Boolean Hidden Matching Problem"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  give a tight lor bound of ( p n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communication complexity protocol of O(logn) qubits for this problem,  obtain an exponential separation of quantum and classical one-way communication complexity for partial functions. A similar result was independently obtained by Gavinsky, Kempe, de Wolf [GKdW06]. Our lor bound is obtained by Fourier analysis, using the Fourier coecients inequality of Kahn Kalai and Linial [KKL88]."}]