• DOI:10.4230/LIPIcs.TQC.2013.50
Corpus ID: 1094359

Easy and hard functions for the Boolean hidden shift problem

@inproceedings{Childs2013EasyAH,
  title={Easy and hard functions for the Boolean hidden shift problem},
  author={Andrew M. Childs and Robin Kothari and M. Ozols and M. Roetteler},
  booktitle={TQC},
  year={2013}
}

Andrew M. Childs, Robin Kothari, +1 author M. Roetteler

Published in TQC 2013

Mathematics, Physics, Computer Science

We study the quantum query complexity of the Boolean hidden shift problem. Given oracle access to f(x+s) for a known Boolean function f, the task is to determine the n-bit string s. The quantum query complexity of this problem depends strongly on f. We demonstrate that the easiest instances of this problem correspond to bent functions, in the sense that an exact one-query algorithm exists if and only if the function is bent. We partially characterize the hardest instances, which include delta… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed