{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:27:46Z","timestamp":1740137266685,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T00:00:00Z","timestamp":1693008000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T00:00:00Z","timestamp":1693008000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"dst-serb","award":["EMR\/2016\/007221"],"award-info":[{"award-number":["EMR\/2016\/007221"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-023-04079-x","type":"journal-article","created":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T18:01:45Z","timestamp":1693072905000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A family of unitaries for the quantum period finding algorithm"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0712-8691","authenticated-orcid":false,"given":"John George","family":"Francis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil","family":"Shaji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,26]]},"reference":[{"key":"4079_CR1","doi-asserted-by":"crossref","unstructured":"Feynman, R.P.: Simulating physics with computers. Int. J. Theor. Phys. 21(6\/7) (1982)","DOI":"10.1007\/BF02650179"},{"key":"4079_CR2","first-page":"553","volume":"439","author":"D Deutsch","year":"1992","unstructured":"Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. Ser. Math. Phys. Sci. 439, 553\u2013558 (1992)","journal-title":"Proc. R. Soc. Lond. Ser. Math. Phys. Sci."},{"issue":"5","key":"4079_CR3","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"DR Simon","year":"1997","unstructured":"Simon, D.R.: On the power of quantum computation. SIAM J. Comput. 26(5), 1474\u20131483 (1997). https:\/\/doi.org\/10.1137\/S0097539796298637","journal-title":"SIAM J. Comput."},{"issue":"153","key":"4079_CR4","first-page":"1","volume":"18","author":"AG Baydin","year":"2018","unstructured":"Baydin, A.G., Pearlmutter, B.A., Radul, A.A., Siskind, J.M.: Automatic differentiation in machine learning: a survey. J. Mach. Learn. Res. 18(153), 1\u201343 (2018)","journal-title":"J. Mach. Learn. Res."},{"issue":"8","key":"4079_CR5","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/355586.364791","volume":"7","author":"RE Wengert","year":"1964","unstructured":"Wengert, R.E.: A simple automatic derivative evaluation program. Commun. ACM 7(8), 463\u2013464 (1964). https:\/\/doi.org\/10.1145\/355586.364791","journal-title":"Commun. ACM"},{"issue":"2","key":"4079_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10710-009-9080-7","volume":"10","author":"A Gepp","year":"2009","unstructured":"Gepp, A., Stocks, P.: A review of procedures to evolve quantum algorithms. Genet. Program Evolvable Mach. 10(2), 181\u2013228 (2009). https:\/\/doi.org\/10.1007\/s10710-009-9080-7","journal-title":"Genet. Program Evolvable Mach."},{"issue":"11","key":"4079_CR7","doi-asserted-by":"publisher","first-page":"113022","DOI":"10.1088\/1367-2630\/aae94a","volume":"20","author":"L Cincio","year":"2018","unstructured":"Cincio, L., Suba\u015f\u0131, Y., Sornborger, A.T., Coles, P.J.: Learning the quantum algorithm for state overlap. New J. Phys. 20(11), 113022 (2018). https:\/\/doi.org\/10.1088\/1367-2630\/aae94a","journal-title":"New J. Phys."},{"issue":"7","key":"4079_CR8","doi-asserted-by":"publisher","first-page":"073017","DOI":"10.1088\/1367-2630\/16\/7\/073017","volume":"16","author":"J Bang","year":"2014","unstructured":"Bang, J., Ryu, J., Yoo, S., Paw\u0142owski, M., Lee, J.: A strategy for quantum algorithm design assisted by machine learning. New J. Phys. 16(7), 073017 (2014). https:\/\/doi.org\/10.1088\/1367-2630\/16\/7\/073017","journal-title":"New J. Phys."},{"key":"4079_CR9","unstructured":"Wan, K.H., Liu, F., Dahlsten, O., Kim, M.S.: Learning Simon\u2019s Quantum Algorithm (2018)"},{"key":"4079_CR10","doi-asserted-by":"publisher","first-page":"062333","DOI":"10.1103\/PhysRevA.98.062333","volume":"98","author":"MES Morales","year":"2018","unstructured":"Morales, M.E.S., Tlyachev, T., Biamonte, J.: Variational learning of Grover\u2019s quantum search algorithm. Phys. Rev. A 98, 062333 (2018). https:\/\/doi.org\/10.1103\/PhysRevA.98.062333","journal-title":"Phys. Rev. A"},{"key":"4079_CR11","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. STOC \u201996, pp. 212\u2013219. Association for Computing Machinery, New York (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"issue":"3","key":"4079_CR12","doi-asserted-by":"publisher","first-page":"033017","DOI":"10.1088\/1367-2630\/11\/3\/033017","volume":"11","author":"S Gammelmark","year":"2009","unstructured":"Gammelmark, S., M\u00f8lmer, K.: Quantum learning by measurement and feedback. New J. Phys. 11(3), 033017 (2009). https:\/\/doi.org\/10.1088\/1367-2630\/11\/3\/033017","journal-title":"New J. Phys."},{"key":"4079_CR13","unstructured":"Lomont, C.: The hidden subgroup problem-review and open problems. https:\/\/arxiv.org\/abs\/quant-ph\/0411037 (2004)"},{"key":"4079_CR14","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. In: Bengio, Y., LeCun, Y. (eds.) 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, 7\u20139 May, 2015, Conference Track Proceedings (2015). arXiv:1412.6980"},{"key":"4079_CR15","unstructured":"Ruder, S.: An overview of gradient descent optimization algorithms. arXiv preprint arXiv:1609.04747 (2016)"},{"key":"4079_CR16","unstructured":"Abadi, M., Agarwal, A., Barham, P., Brevdo, E., Chen, Z., Citro, C., Corrado, G.S., Davis, A., Dean, J., Devin, M., Ghemawat, S., Goodfellow, I., Harp, A., Irving, G., Isard, M., Jia, Y., Jozefowicz, R., Kaiser, L., Kudlur, M., Levenberg, J., Man\u00e9, D., Monga, R., Moore, S., Murray, D., Olah, C., Schuster, M., Shlens, J., Steiner, B., Sutskever, I., Talwar, K., Tucker, P., Vanhoucke, V., Vasudevan, V., Vi\u00e9gas, F., Vinyals, O., Warden, P., Wattenberg, M., Wicke, M., Yu, Y., Zheng, X.: TensorFlow: Large-Scale Machine Learning on Heterogeneous Systems. Software available from tensorflow.org (2015). https:\/\/www.tensorflow.org\/"},{"key":"4079_CR17","doi-asserted-by":"publisher","first-page":"2490","DOI":"10.1103\/PhysRevLett.86.2490","volume":"86","author":"RA Jalabert","year":"2001","unstructured":"Jalabert, R.A., Pastawski, H.M.: Environment-independent decoherence rate in classically chaotic systems. Phys. Rev. Lett. 86, 2490\u20132493 (2001). https:\/\/doi.org\/10.1103\/PhysRevLett.86.2490","journal-title":"Phys. Rev. Lett."},{"issue":"5","key":"4079_CR18","doi-asserted-by":"publisher","first-page":"926","DOI":"10.2514\/3.25422","volume":"13","author":"SE Dreyfus","year":"1990","unstructured":"Dreyfus, S.E.: Artificial neural networks, back propagation, and the Kelley-Bryson gradient procedure. J. Guid. Control. Dyn. 13(5), 926\u2013928 (1990). https:\/\/doi.org\/10.2514\/3.25422","journal-title":"J. Guid. Control. Dyn."},{"issue":"6","key":"4079_CR19","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1016\/S0893-6080(05)80131-5","volume":"6","author":"M Leshno","year":"1993","unstructured":"Leshno, M., Lin, V.Y., Pinkus, A., Schocken, S.: Multilayer feedforward networks with a nonpolynomial activation function can approximate any function. Neural Netw. 6(6), 861\u2013867 (1993). https:\/\/doi.org\/10.1016\/S0893-6080(05)80131-5","journal-title":"Neural Netw."},{"key":"4079_CR20","unstructured":"Nair, V., Hinton, G.E.: Rectified linear units improve restricted Boltzmann machines. In: Proceedings of the 27th International Conference on International Conference on Machine Learning. ICML\u201910, pp. 807\u2013814. Omnipress, Madison (2010)"},{"key":"4079_CR21","unstructured":"Goodfellow, I.J., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. In: Proceedings of the 27th International Conference on Neural Information Processing Systems\u2014Volume 2. NIPS\u201914, pp. 2672\u20132680. MIT Press, Cambridge (2014)"},{"key":"4079_CR22","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1017\/CBO9780511813870","volume-title":"Period Finding and Continued Fractions. Quantum Computer Science, An Introduction","author":"ND Mermin","year":"2007","unstructured":"Mermin, N.D.: Period Finding and Continued Fractions. Quantum Computer Science, An Introduction, pp. 197\u2013200. Cambridge University Press, Cambridge (2007)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-04079-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-023-04079-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-04079-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T16:20:04Z","timestamp":1694103604000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-023-04079-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,26]]},"references-count":22,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2023,8]]}},"alternative-id":["4079"],"URL":"https:\/\/doi.org\/10.1007\/s11128-023-04079-x","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2023,8,26]]},"assertion":[{"value":"30 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing and conflict of interest to declare with regard to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"326"}}