{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T04:17:24Z","timestamp":1679372244734},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T00:00:00Z","timestamp":1675641600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T00:00:00Z","timestamp":1675641600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-023-03844-2","type":"journal-article","created":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T13:03:44Z","timestamp":1675688624000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantum greedy algorithms for multi-armed bandits"],"prefix":"10.1007","volume":"22","author":[{"given":"Hiroshi","family":"Ohno","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,6]]},"reference":[{"key":"3844_CR1","unstructured":"Ahuja, A., Kapoor, S.: A quantum algorithm for finding the maximum. arXiv Quantum Physics (1999)"},{"key":"3844_CR2","unstructured":"Ambainis, A.: Variable time amplitude amplification and quantum algorithms for linear algebra problems. In: T.W. Christoph\u00a0D\u00fcrr (ed.) STACS\u201912 (29th Symposium on Theoretical Aspects of Computer Science), vol.\u00a014, pp. 636\u2013647. LIPIcs, Paris, France (2012)"},{"key":"3844_CR3","unstructured":"Audibert, J.Y., Bubeck, S.: Best arm identification in multi-armed bandits. In: COLT - 23th Conference on Learning Theory - 2010, p. 13 p. Haifa, Israel (2010)"},{"issue":"2","key":"3844_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2), 235\u2013256 (2002). https:\/\/doi.org\/10.1023\/A:1013689704352","journal-title":"Mach. Learn."},{"issue":"4","key":"3844_CR5","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1137\/040605072","volume":"15","author":"WP Baritompa","year":"2005","unstructured":"Baritompa, W.P., Bulger, D.W., Wood, G.R.: Grover\u2019s quantum algorithm applied to global optimization. SIAM J Opt 15(4), 1170\u20131184 (2005). https:\/\/doi.org\/10.1137\/040605072","journal-title":"SIAM J Opt"},{"key":"3844_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. Contemporary Mathematics 305, 53\u201374 (2002)","journal-title":"Contemporary Mathematics"},{"key":"3844_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s42484-020-00024-8","volume":"2","author":"B Casal\u00e9","year":"2020","unstructured":"Casal\u00e9, B., Di Molfetta, G., Kadri, H., Ralaivola, L.: Quantum bandits. Quantum. Mach. Intell. 2, 1\u20137 (2020). https:\/\/doi.org\/10.1007\/s42484-020-00024-8","journal-title":"Mach. Intell."},{"issue":"5","key":"3844_CR8","doi-asserted-by":"publisher","first-page":"7805","DOI":"10.1007\/s11042-020-09949-5","volume":"80","author":"S Forouzandeh","year":"2021","unstructured":"Forouzandeh, S., Berahmand, K., Rostami, M.: Presentation of a recommender system with ensemble learning and graph embedding: a case on movielens. Multimed. Tools Appl. 80(5), 7805\u20137832 (2021). https:\/\/doi.org\/10.1007\/s11042-020-09949-5","journal-title":"Multimed. Tools Appl."},{"key":"3844_CR9","doi-asserted-by":"publisher","first-page":"428","DOI":"10.22331\/q-2021-04-08-428","volume":"5","author":"A Gilliam","year":"2021","unstructured":"Gilliam, A., Woerner, S., Gonciulea, C.: Grover adaptive search for constrained polynomial binary optimization. Quantum 5, 428 (2021). https:\/\/doi.org\/10.22331\/q-2021-04-08-428","journal-title":"Quantum"},{"key":"3844_CR10","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, NY, USA (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"issue":"20","key":"3844_CR11","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8121\/ab8111","volume":"53","author":"M Gu\u0163\u0103","year":"2020","unstructured":"Gu\u0163\u0103, M., Kahn, J., Kueng, R., Tropp, J.A.: Fast state tomography with optimal error bounds. J. Phys. A: Math. Theoret. 53(20), 204001 (2020). https:\/\/doi.org\/10.1088\/1751-8121\/ab8111","journal-title":"J. Phys. A: Math. Theoret."},{"key":"3844_CR12","doi-asserted-by":"publisher","unstructured":"Harper, F.M., Konstan, J.A.: The movielens datasets: History and context. ACM Transact. Interact. Intell. Syst. 5(4) (2015). https:\/\/doi.org\/10.1145\/2827872","DOI":"10.1145\/2827872"},{"key":"3844_CR13","unstructured":"Krishnamurthy, A.: Lecture 18: Stochastic Bandits (2017)"},{"key":"3844_CR14","unstructured":"Kuleshov, V., Precup, D.: Algorithms for multi-armed bandit problems (2014).https:\/\/doi.org\/10.48550\/ARXIV.1402.6028"},{"key":"3844_CR15","doi-asserted-by":"publisher","first-page":"749","DOI":"10.22331\/q-2022-06-29-749","volume":"6","author":"J Lumbreras","year":"2022","unstructured":"Lumbreras, J., Haapasalo, E., Tomamichel, M.: Multi-armed quantum bandits: Exploration versus exploitation when learning properties of quantum states. Quantum 6, 749 (2022). https:\/\/doi.org\/10.22331\/q-2022-06-29-749","journal-title":"Quantum"},{"key":"3844_CR16","doi-asserted-by":"publisher","unstructured":"Montanaro, A.: Quantum speedup of Monte Carlo methods. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471(2181), 20150301 (2015). https:\/\/doi.org\/10.1098\/rspa.2015.0301","DOI":"10.1098\/rspa.2015.0301"},{"key":"3844_CR17","doi-asserted-by":"publisher","first-page":"467","DOI":"10.26421\/QIC5.6-5","volume":"5","author":"M M\u00f6tt\u00f6nen","year":"2005","unstructured":"M\u00f6tt\u00f6nen, M., Vartiainen, J.J., Bergholm, V., Salomaa, M.M.: Transformation of quantum states using uniformly controlled rotations. Quantum Inform. Comput. 5, 467\u2013473 (2005)","journal-title":"Quantum Inform. Comput."},{"key":"3844_CR18","volume-title":"Quantum Computation and Quantum Information: 10th Anniversary Edition","author":"MA Nielsen","year":"2011","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition, 10th edn. Cambridge University Press, USA (2011)","edition":"10"},{"key":"3844_CR19","doi-asserted-by":"crossref","unstructured":"Russo, D. J., Roy, B. V., Kazerouni, A., Osband, I., Wen, Z.: A tutorial on Thompson sampling. Foundations and Trends in Machine Learning 11(1), 1\u201396 (2018)","DOI":"10.1561\/2200000070"},{"key":"3844_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96424-9","volume-title":"Supervised Learning with Quantum Computers","author":"M Schuld","year":"2018","unstructured":"Schuld, M., Petruccione, F.: Supervised Learning with Quantum Computers, 1st edn. Springer Publishing Company, Incorporated (2018)","edition":"1"},{"issue":"7587","key":"3844_CR21","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver, D., Huang, A., Maddison, C.J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., Dieleman, S., Grewe, D., Nham, J., Kalchbrenner, N., Sutskever, I., Lillicrap, T., Leach, M., Kavukcuoglu, K., Graepel, T., Hassabis, D.: Mastering the game of go with deep neural networks and tree search. Nature 529(7587), 484\u2013489 (2016). https:\/\/doi.org\/10.1038\/nature16961","journal-title":"Nature"},{"issue":"1\u20132","key":"3844_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000068","volume":"12","author":"A Slivkins","year":"2019","unstructured":"Slivkins, A.: Introduction to multi-armed bandits. Found. TrendsR Mach Learn. 12(1\u20132), 1\u2013286 (2019). https:\/\/doi.org\/10.1561\/2200000068","journal-title":"Found. TrendsR Mach Learn."},{"key":"3844_CR23","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction, second edn. The MIT Press (2018)"},{"key":"3844_CR24","doi-asserted-by":"publisher","unstructured":"Vermorel, J., Mohri, M.: Multi-armed bandit algorithms and empirical evaluation. In: Proceedings of the 16th European Conference on Machine Learning, ECML\u201905, pp. 437\u2013448. Springer-Verlag, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564096_42","DOI":"10.1007\/11564096_42"},{"key":"3844_CR25","doi-asserted-by":"publisher","unstructured":"Wan, Z., Zhang, Z., Li, T., Zhang, J., Sun, X.: Quantum multi-armed bandits and stochastic linear bandits enjoy logarithmic regrets (2022). https:\/\/doi.org\/10.48550\/ARXIV.2205.14988","DOI":"10.48550\/ARXIV.2205.14988"},{"key":"3844_CR26","doi-asserted-by":"crossref","unstructured":"Wang, D., You, X., Li, T., Childs, A.M.: Quantum exploration algorithms for multi-armed bandits. In: Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021, pp. 10102\u201310110. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i11.17212"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-03844-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-023-03844-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-03844-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T16:16:22Z","timestamp":1679328982000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-023-03844-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,6]]},"references-count":26,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,2]]}},"alternative-id":["3844"],"URL":"https:\/\/doi.org\/10.1007\/s11128-023-03844-2","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,6]]},"assertion":[{"value":"21 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 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 author declares that there are no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The datasets generated during and\/or analysed during the current study are available from the corresponding author on reasonable request.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data Availability Statement"}}],"article-number":"101"}}