English

A Quantum Algorithm for Testing Juntas in Boolean Functions

Quantum Physics 2018-01-22 v2

Abstract

Given a Boolean function ff provided as a black-box with nn variables, this paper will propose a quantum algorithm for testing if a certain variable is junta or ϵ\epsilon-far from being junta. The proposed algorithm constructs another black-box using two copies of the provided black-box. The constructed black-box is used with the partial diffusion operator in an amplitude amplification technique to test whether the variable being tested is junta or not, using O(2n)\mathcal{O}(\sqrt{2^n}) queries to the constructed black-box. The proposed algorithm considers a Boolean function of general form, contrary to relevant algorithms proposed by others.

Cite

@article{arxiv.1701.02143,
  title  = {A Quantum Algorithm for Testing Juntas in Boolean Functions},
  author = {Khaled El-Wazan and Ahmed Younes and S. B. Doma},
  journal= {arXiv preprint arXiv:1701.02143},
  year   = {2018}
}