{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:27:36Z","timestamp":1725600456729},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226847"},{"type":"electronic","value":"9783642226854"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22685-4_14","type":"book-chapter","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T08:54:39Z","timestamp":1312966479000},"page":"158-167","source":"Crossref","is-referenced-by-count":3,"title":["Quantum Algorithm for the Boolean Hidden Shift Problem"],"prefix":"10.1007","author":[{"given":"Dmitry","family":"Gavinsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Roetteler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00e9mie","family":"Roland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Contemporary Mathematics Series","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume-title":"Quantum Computation and Quantum Information: A Millennium Volume","author":"G. Brassard","year":"2002","unstructured":"Brassard, G., H\u00f8yer, 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.\u00a0305, pp. 53\u201374. American Mathematical Society, Providence (2002)"},{"issue":"5","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E. Bernstein","year":"1997","unstructured":"Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM Journal on Computing\u00a026(5), 1411\u20131473 (1997); Earlier version in Proc. STOC 1993, pp.\u00a011\u201320","journal-title":"SIAM Journal on Computing"},{"key":"14_CR3","first-page":"134","volume-title":"Towards quantum template matching","author":"D. Curtis","year":"2004","unstructured":"Curtis, D., Meyer, D.A.: Towards quantum template matching, vol.\u00a05161, pp. 134\u2013141. SPIE, San Jose (2004)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013404 (2007)","DOI":"10.1109\/FOCS.2007.18"},{"key":"14_CR5","unstructured":"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\u20131232 (2007)"},{"issue":"5-6","key":"14_CR6","doi-asserted-by":"crossref","first-page":"504","DOI":"10.26421\/QIC7.5-6-6","volume":"7","author":"A. Childs","year":"2007","unstructured":"Childs, A., Wocjan, P.: On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems. Quantum Information and Computation\u00a07(5-6), 504\u2013521 (2007)","journal-title":"Quantum Information and Computation"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s00453-002-0975-4","volume":"34","author":"W. Dam van","year":"2002","unstructured":"van Dam, W.: Quantum algorithms for weighing matrices and quadratic residues. Algorithmica\u00a034, 413\u2013428 (2002)","journal-title":"Algorithmica"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1137\/S009753970343141X","volume":"36","author":"W. Dam van","year":"2006","unstructured":"van Dam, W., Hallgren, S., Ip, L.: Quantum algorithms for some hidden shift problems. SIAM Journal on Computing\u00a036, 763\u2013778 (2006); Earlier version in Proc. SODA 2003, pp. 489\u2013498","journal-title":"SIAM Journal on Computing"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Dinh, H., Moore, C., Russell, A.: The McEliece cryptosystem resists quantum Fourier sampling attacks (2010)","DOI":"10.1007\/978-3-642-22792-9_43"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"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\u20139 (2003)","DOI":"10.1145\/780542.780544"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-642-02927-1_42","volume-title":"Automata, Languages and Programming","author":"P. Gopalan","year":"2009","unstructured":"Gopalan, P., O\u2019Donnell, 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.\u00a05555, pp. 500\u2013512. Springer, Heidelberg (2009); Long version: Carnegie Mellon University Technical Report (2009), Computer Science Department, Paper 1162"},{"key":"14_CR12","first-page":"212","volume-title":"Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC 1996)","author":"L.K. Grover","year":"1996","unstructured":"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\u2013219. ACM, New York (1996)"},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/S0097539703436345","volume":"35","author":"G. Kuperberg","year":"2005","unstructured":"Kuperberg, G.: A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM Journal on Computing\u00a035(1), 170\u2013188 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1145\/1536414.1536469","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC 2009)","author":"Y.-K. Liu","year":"2009","unstructured":"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\u2013400. ACM, New York (2009)"},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1137\/S0097539705447177","volume":"37","author":"C. Moore","year":"2007","unstructured":"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\u00a037(3), 938\u2013958 (2007)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"14_CR16","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539703440678","volume":"33","author":"O. Regev","year":"2004","unstructured":"Regev, O.: Quantum computation and lattice problems. SIAM Journal on Computing\u00a033(2), 738\u2013760 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR17","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/1.9781611973075.37","volume-title":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Martin R\u00f6tteler","year":"2010","unstructured":"R\u00f6tteler, 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\u2013457 (2010)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22685-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T03:48:45Z","timestamp":1638244125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22685-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226847","9783642226854"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22685-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}