Hidden shift problem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

The Hidden shift problem states: Given an oracle that encodes two functions and , there is an n-bit string for which for all . Find .[1] Many functions, such as the Legendre symbol and Bent functions, satisfy these constraints.[2] With a quantum algorithm that's defined as "" where is the Hadamard gate and is the Fourier transform of , this problem can be solved in a polynomial number of queries to while taking exponential queries with a classical algorithm. The difference between the Hidden subgroup problem and the Hidden shift problem is that the former focuses on the underlying group while the latter focuses on the underlying ring or field.[1]

References[edit]

  1. ^ a b Dam, Wim van; Hallgren, Sean; Ip, Lawrence (2002). "Quantum Algorithms for some Hidden Shift Problems". SIAM Journal on Computing. 36 (3): 763–778. arXiv:quant-ph/0211140. doi:10.1137/S009753970343141X. S2CID 11122780.
  2. ^ Rötteler, Martin (2008). "Quantum algorithms for highly non-linear Boolean functions". Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Vol. 402. Society for Industrial and Applied Mathematics. pp. 448–457. arXiv:0811.3208. doi:10.1137/1.9781611973075.37. ISBN 978-0-89871-701-3. S2CID 9615826.