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
    11 Citations

    Figures, Tables, and Topics from this paper

    Quantum Algorithms for Learning Symmetric Juntas via the Adversary Bound
    • A. Belovs
    • Mathematics, Physics
    • 2014 IEEE 29th Conference on Computational Complexity (CCC)
    • 2014
    • 21
    • PDF
    An optimal quantum algorithm for the oracle identification problem
    • 26
    • PDF
    Efficient algorithms in quantum query complexity
    • 22
    Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups
    • 4
    • PDF
    Quasi-random multilinear polynomials
    • PDF
    Experimental comparison of two quantum computing architectures
    • 245
    • PDF
    Quantum Pattern Matching Fast on Average
    • 22
    • PDF
    Problems and solutions from the fourth International Students’ Olympiad in Cryptography (NSUCRYPTO)
    • 2
    • PDF

    References

    SHOWING 1-10 OF 67 REFERENCES
    Quantum algorithm for the Boolean hidden shift problem
    • 15
    • PDF
    Quantum algorithms for highly non-linear Boolean functions
    • 29
    • PDF
    Quantum Algorithms for Weighing Matrices and Quadratic Residues
    • W. Dam
    • Mathematics, Physics
    • Algorithmica
    • 2002
    • 37
    • PDF
    Equivalences and Separations Between Quantum and Classical Learnability
    • 79
    • PDF
    Efficient quantum algorithm for identifying hidden polynomials
    • 12
    • PDF
    Symmetry-Assisted Adversaries for Quantum State Generation
    • 51
    • PDF
    Quantum algorithms for some hidden shift problems
    • 147
    • PDF
    A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
    • 244
    • PDF