Quantum Algorithm for the Boolean Hidden Shift Problem

  • Dmitry Gavinsky
  • Martin Roetteler
  • Jérémie Roland
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6842)


The hidden shift problem is a natural place to look for new separations between classical and quantum models of computation. One advantage of this problem is its flexibility, since it can be defined for a whole range of functions and a whole range of underlying groups. In a way, this distinguishes it from the hidden subgroup problem where more stringent requirements about the existence of a periodic subgroup have to be made. And yet, the hidden shift problem proves to be rich enough to capture interesting features of problems of algebraic, geometric, and combinatorial flavor. We present a quantum algorithm to identify the hidden shift for any Boolean function. Using Fourier analysis for Boolean functions we relate the time and query complexity of the algorithm to an intrinsic property of the function, namely its minimum influence. We show that for randomly chosen functions the time complexity of the algorithm is polynomial. Based on this we show an average case exponential separation between classical and quantum time complexity. A perhaps interesting aspect of this work is that, while the extremal case of the Boolean hidden shift problem over so-called bent functions can be reduced to a hidden subgroup problem over an abelian group, the more general case studied here does not seem to allow such a reduction.


Boolean Function Quantum Algorithm Query Complexity Bend Function Bent Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BHMT02]
    Brassard, G., Høyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. In: Lomonaco Jr., S.J., Brandt, H.E. (eds.) Quantum Computation and Quantum Information: A Millennium Volume. Contemporary Mathematics Series, vol. 305, pp. 53–74. American Mathematical Society, Providence (2002)CrossRefGoogle Scholar
  2. [BV97]
    Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM Journal on Computing 26(5), 1411–1473 (1997); Earlier version in Proc. STOC 1993, pp. 11–20MathSciNetCrossRefzbMATHGoogle Scholar
  3. [CM04]
    Curtis, D., Meyer, D.A.: Towards quantum template matching, vol. 5161, pp. 134–141. SPIE, San Jose (2004)Google Scholar
  4. [CSV07]
    Childs, A., Schulman, L.J., Vazirani, U.: Quantum algorithms for hidden nonlinear structures. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), pp. 395–404 (2007)Google Scholar
  5. [CvD07]
    Childs, A., van Dam, W.: Quantum algorithm for a generalized hidden shift problem. In: Proceedings of the 18th Symposium on Discrete Algorithms (SODA 2007), pp. 1225–1232 (2007)Google Scholar
  6. [CW07]
    Childs, A., Wocjan, P.: On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems. Quantum Information and Computation 7(5-6), 504–521 (2007)MathSciNetzbMATHGoogle Scholar
  7. [vD02]
    van Dam, W.: Quantum algorithms for weighing matrices and quadratic residues. Algorithmica 34, 413–428 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  8. [vDHI06]
    van Dam, W., Hallgren, S., Ip, L.: Quantum algorithms for some hidden shift problems. SIAM Journal on Computing 36, 763–778 (2006); Earlier version in Proc. SODA 2003, pp. 489–498MathSciNetCrossRefzbMATHGoogle Scholar
  9. [DMR10]
    Dinh, H., Moore, C., Russell, A.: The McEliece cryptosystem resists quantum Fourier sampling attacks (2010)Google Scholar
  10. [FIM+03]
    Friedl, K., Ivanyos, G., Magniez, F., Santha, M., Sen, P.: Hidden translation and orbit coset in quantum computing. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003), pp. 1–9 (2003)Google Scholar
  11. [GOS+09]
    Gopalan, P., O’Donnell, R., Servedio, R., Shpilka, A., Wimmer, K.: Testing Fourier Dimensionality and Sparsity. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 500–512. Springer, Heidelberg (2009); Long version: Carnegie Mellon University Technical Report (2009), Computer Science Department, Paper 1162CrossRefGoogle Scholar
  12. [Gro96]
    Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC 1996), pp. 212–219. ACM, New York (1996)Google Scholar
  13. [Kup05]
    Kuperberg, G.: A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM Journal on Computing 35(1), 170–188 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  14. [Liu09]
    Liu, Y.-K.: Quantum algorithms using the curvelet transform. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC 2009), pp. 391–400. ACM, New York (2009)CrossRefGoogle Scholar
  15. [MRRS07]
    Moore, C., Rockmore, D., Russell, A., Schulman, L.: The power of strong Fourier sampling: quantum algorithms for affine groups and hidden shifts. SIAM Journal on Computing 37(3), 938–958 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  16. [Reg04]
    Regev, O.: Quantum computation and lattice problems. SIAM Journal on Computing 33(2), 738–760 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  17. [Röt10]
    Rötteler, M.: Quantum algorithms for highly non-linear Boolean functions. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 448–457 (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Dmitry Gavinsky
    • 1
  • Martin Roetteler
    • 1
  • Jérémie Roland
    • 1
  1. 1.NEC Laboratories America, Inc.USA

Personalised recommendations