{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T20:34:40Z","timestamp":1774902880858,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T00:00:00Z","timestamp":1726099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T00:00:00Z","timestamp":1726099200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"National Research Foundation, Singapore and A*STAR under its CQT Bridging Grant"},{"name":"Quantum Engineering Programme grant","award":["NRF2021-QEP2-02-P05"],"award-info":[{"award-number":["NRF2021-QEP2-02-P05"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s42484-024-00189-6","type":"journal-article","created":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T10:16:04Z","timestamp":1726136164000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quantum contextual bandits and recommender systems for quantum data"],"prefix":"10.1007","volume":"6","author":[{"given":"Shrigyan","family":"Brahmachari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-3541-6148","authenticated-orcid":false,"given":"Josep","family":"Lumbreras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5410-3329","authenticated-orcid":false,"given":"Marco","family":"Tomamichel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,12]]},"reference":[{"key":"189_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson S (2018) Shadow tomography of quantum states. In: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, pp 325\u2013338","DOI":"10.1145\/3188745.3188802"},{"key":"189_CR2","unstructured":"Abbasi-Yadkori , P\u00e1l D, Szepesv\u00e1ri Cs (2011) Improved algorithms for linear stochastic bandits. In: Advances in neural information processing systems, Curran Associates, Inc., 24"},{"issue":"4","key":"189_CR3","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00453-003-1038-1","volume":"37","author":"N Abe","year":"2003","unstructured":"Abe N, Biermann AW, Long PM (2003) Reinforcement learning with immediate rewards, linear hypotheses. Algorithmica 37(4):263\u2013293","journal-title":"Algorithmica"},{"key":"189_CR4","unstructured":"Agrawal S, Goyal N (2013) Thompson sampling for contextual bandits with linear payoffs. In: International conference on machine learning, PMLR, pp 127\u2013135"},{"key":"189_CR5","unstructured":"Auer P (2003) Using confidence bounds for exploitation-exploration trade-offs. Journal of Machine Learning Research, 3:397\u2013422. ISSN 1532-4435"},{"key":"189_CR6","doi-asserted-by":"publisher","unstructured":"Auer P, Cesa-Bianchi N, Freund Y, Schapire RE (2003) The nonstochastic multiarmed bandit problem. SIAM J. Comput, 32 (1): 48\u201377. ISSN 0097-5397 https:\/\/doi.org\/10.1137\/S0097539701398375","DOI":"10.1137\/S0097539701398375"},{"key":"189_CR7","doi-asserted-by":"publisher","first-page":"032311","DOI":"10.1103\/PhysRevA.90.032311","volume":"90","author":"J Barry","year":"2014","unstructured":"Barry J, Barry DT, Aaronson S (2014) Quantum partially observable Markov decision processes. Phys Rev A 90:032311. https:\/\/doi.org\/10.1103\/PhysRevA.90.032311","journal-title":"Phys Rev A"},{"key":"189_CR8","doi-asserted-by":"publisher","first-page":"015004","DOI":"10.1103\/RevModPhys.94.015004","volume":"94","author":"K Bharti","year":"2022","unstructured":"Bharti K, Cervera-Lierta A, Kyaw TH, Haug T, Alperin-Lea S, Anand A, Degroote M, Heimonen H, Kottmann JS, Menke T, Mok W, Sim S, Kwek L, Aspuru-Guzik A (2022) Noisy intermediate-scale quantum algorithms. Rev Mod Phys 94:015004. https:\/\/doi.org\/10.1103\/RevModPhys.94.015004","journal-title":"Rev Mod Phys"},{"key":"189_CR9","doi-asserted-by":"crossref","unstructured":"Bouneffouf D, Rish I, Aggarwal C, (2020) Survey on applications of multi-armed and contextual bandits. In: 2020 IEEE Congress on Evolutionary Computation (CEC), IEEE pp 1\u20138","DOI":"10.1109\/CEC48606.2020.9185782"},{"key":"189_CR10","doi-asserted-by":"crossref","unstructured":"Caro MC, Huang H, Cerezo M, Sharma K, Sornborger A, Cincio L, Coles PJ (2022) Generalization in quantum machine learning from few training data. Nat Commun 13(1):4919","DOI":"10.1038\/s41467-022-32550-3"},{"key":"189_CR11","doi-asserted-by":"publisher","unstructured":"Casal\u00e9 B, Di Molfetta G, Kadri H, Ralaivola L (2020) Quantum bandits. Quantum Mach Intell 2. https:\/\/doi.org\/10.1007\/s42484-020-00024-8","DOI":"10.1007\/s42484-020-00024-8"},{"key":"189_CR12","unstructured":"Cho B, Xiao Y, Hui P, Dong D (2022) Quantum bandit with amplitude amplification exploration in an adversarial environment. arXiv:2208.07144"},{"key":"189_CR13","unstructured":"Chu W, Li L, Reyzin L, Schapire RE (2011) Contextual bandits with linear payoff functions. In: AISTATS, pp 208\u2013214"},{"issue":"11","key":"189_CR14","doi-asserted-by":"publisher","first-page":"4921","DOI":"10.1287\/mnsc.2019.3485","volume":"66","author":"M Cohen","year":"2020","unstructured":"Cohen M, Lobel I, Paes Leme R (2020) Feature-based dynamic pricing. Manage Sci 66(11):4921\u20134943. https:\/\/doi.org\/10.1287\/mnsc.2019.3485","journal-title":"Manage Sci"},{"key":"189_CR15","unstructured":"Combes R, Magureanu S, Proutiere A (2017) Minimal exploration in structured stochastic bandits. In: Proceedings of the 31st International conference on neural information processing systems, pp 1761\u20131769"},{"key":"189_CR16","doi-asserted-by":"crossref","unstructured":"Dragone P, Mehrotra R, Lalmas M (2019) Deriving user-and content-specific rewards for contextual bandits. In: The world wide web conference pp 2680\u20132686","DOI":"10.1145\/3308558.3313592"},{"key":"189_CR17","unstructured":"Durand A, Achilleos, C Iacovides D, Strati K, Mitsis GD, Pineau J (2018) Contextual bandits for adapting treatment in a mouse model of de novo carcinogenesis. In: Machine learning for healthcare conference, PMLR pp 67\u201382"},{"issue":"2","key":"189_CR18","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1111\/j.2517-6161.1979.tb01068.x","volume":"41","author":"JC Gittins","year":"1979","unstructured":"Gittins JC (1979) Bandit processes and dynamic allocation indices. J Roy Stat Soc: Ser B (Methodol) 41(2):148\u2013164","journal-title":"J Roy Stat Soc: Ser B (Methodol)"},{"key":"189_CR19","doi-asserted-by":"publisher","DOI":"10.1002\/9780470980033","volume-title":"Multi-armed bandit allocation indices","author":"J Gittins","year":"2011","unstructured":"Gittins J, Glazebrook K, Weber R (2011) Multi-armed bandit allocation indices. John Wiley & Sons"},{"key":"189_CR20","doi-asserted-by":"publisher","unstructured":"Gomez-Uribe CA, Hunt N (2016) The netflix recommender system: algorithms, business value, and innovation. ACM Trans Manage Inf Syst 6(4) ISSN 2158-656X. https:\/\/doi.org\/10.1145\/2843948","DOI":"10.1145\/2843948"},{"key":"189_CR21","doi-asserted-by":"crossref","unstructured":"Huang HY, Kueng R, Torlai G, Albert VV, Preskill J (2021) Provably efficient machine learning for quantum many-body problems. Science, 377. https:\/\/api.semanticscholar.org\/CorpusID:262748752","DOI":"10.1126\/science.abk3333"},{"issue":"10","key":"189_CR22","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1038\/s41567-020-0932-7","volume":"16","author":"H Huang","year":"2020","unstructured":"Huang H, Kueng R, Preskill J (2020) Predicting many properties of a quantum system from very few measurements. Nat Phys 16(10):1050\u20131057","journal-title":"Nat Phys"},{"key":"189_CR23","doi-asserted-by":"crossref","unstructured":"Hu W, Wei, Hu J (2019) Training a quantum neural network to solve the contextual multi-armed bandit problem. Nat Sci 11(01):17","DOI":"10.4236\/ns.2019.111003"},{"key":"189_CR24","unstructured":"Kerenidis I, Prakash A (2016) Quantum recommendation systems. arXiv:1603.08675"},{"issue":"3","key":"189_CR25","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1214\/aos\/1176350495","volume":"15","author":"TL Lai","year":"1987","unstructured":"Lai TL (1987) Adaptive treatment allocation and the multi-armed bandit problem. Ann Stat 15(3):1091\u20131114. https:\/\/doi.org\/10.1214\/aos\/1176350495","journal-title":"Ann Stat"},{"key":"189_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401","volume-title":"Bandit algorithms","author":"T Lattimore","year":"2020","unstructured":"Lattimore T, Szepesv\u00e1ri C (2020) Bandit algorithms. Cambridge University Press"},{"key":"189_CR27","unstructured":"Lattimore T, Munos R (2014) Bounded regret for finite-armed structured bandits. Advances in Neural Information Processing Systems, 27"},{"key":"189_CR28","doi-asserted-by":"publisher","unstructured":"Li L, Chu W, Langford J, Schapire RE (2010) A contextual-bandit approach to personalized news article recommendation. In: Proceedings of the 19th international conference on world wide web, ACM, pp 661\u2013670 ISBN 9781605587998. https:\/\/doi.org\/10.1145\/1772690.1772758","DOI":"10.1145\/1772690.1772758"},{"key":"189_CR29","doi-asserted-by":"publisher","unstructured":"Lumbreras J, Haapasalo E, Tomamichel M (2022) Multi-armed quantum bandits: exploration versus exploitation when learning properties of quantum states. Quantum, 6:749. ISSN 2521-327X https:\/\/doi.org\/10.22331\/q-2022-06-29-749","DOI":"10.22331\/q-2022-06-29-749"},{"key":"189_CR30","unstructured":"Luo H, Wei C, Chen-Yu, Agarwal A, Langford J (2018) Efficient contextual bandits in non-stationary worlds. In: Conference on learning theory, PMLR, pp 1739\u20131776"},{"key":"189_CR31","doi-asserted-by":"crossref","unstructured":"McInerney J, Lacker B, Hansen S, Higley K, Bouchard H, Gruson A, Mehrotra R (2018) Explore, exploit, and explain: personalizing explainable recommendations with bandits. In: Proceedings of the 12th ACM conference on recommender systems pp 31\u201339","DOI":"10.1145\/3240323.3240354"},{"key":"189_CR32","doi-asserted-by":"crossref","unstructured":"Peruzzo A, McClean J, Jarrod Shadbolt P, Yung M, Zhou X, Love PJ, Aspuru-Guzik A, O\u2019brien JL, (2014) A variational eigenvalue solver on a photonic quantum processor. Nat Commun 5(1):1\u20137","DOI":"10.1038\/ncomms5213"},{"issue":"2","key":"189_CR33","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/moor.1100.0446","volume":"35","author":"P Rusmevichientong","year":"2010","unstructured":"Rusmevichientong P, Tsitsiklis JN (2010) Linearly parameterized bandits. Math Oper Res 35(2):395\u2013411. https:\/\/doi.org\/10.1287\/moor.1100.0446","journal-title":"Math Oper Res"},{"key":"189_CR34","unstructured":"Russo D, Van Roy B (2013). Eluder dimension and the sample complexity of optimistic exploration. Advances in Neural Information Processing Systems, 26"},{"key":"189_CR35","doi-asserted-by":"crossref","unstructured":"Tang E (2019) A quantum-inspired classical algorithm for recommendation systems. In: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, pp 217\u2013228","DOI":"10.1145\/3313276.3316310"},{"key":"189_CR36","doi-asserted-by":"publisher","unstructured":"Tang L, Rosales R, Singh A, Agarwal D (2013) Automatic ad format selection via contextual bandits. In: Proceedings of the 22nd ACM international conference on information and knowledge management, Association for Computing Machinery, 1587\u20131594. ISBN 9781450322638 https:\/\/doi.org\/10.1145\/2505515.2514700","DOI":"10.1145\/2505515.2514700"},{"key":"189_CR37","unstructured":"Varsha D, Hayes T, Kakade S (2008) Stochastic linear optimization under bandit feedback. In: Proceedings of the 21st conference on learning theory, pp 355\u2013366"},{"issue":"16","key":"189_CR38","doi-asserted-by":"publisher","first-page":"165124","DOI":"10.1103\/PhysRevB.96.165124","volume":"96","author":"R Verresen","year":"2017","unstructured":"Verresen R, Moessner R, Pollmann F (2017) One-dimensional symmetry protected topological phases and their transitions. Phys Rev B 96(16):165124","journal-title":"Phys Rev B"},{"key":"189_CR39","first-page":"10102","volume":"35","author":"D Wang","year":"2021","unstructured":"Wang D, You X, Li T, Childs A (2021) Quantum exploration algorithms for multi-armed bandits. Proc AAAI Conf Artif Intell 35:10102\u201310110","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"189_CR40","doi-asserted-by":"crossref","unstructured":"Wan Z, Zhang Z, Li T, Zhang J, Sun X (2022) Quantum multi-armed bandits and stochastic linear bandits enjoy logarithmic regrets. arXiv:2205.14988","DOI":"10.1609\/aaai.v37i8.26202"},{"key":"189_CR41","doi-asserted-by":"crossref","unstructured":"Whittle P (1988) Restless bandits: activity allocation in a changing world. Journal of Applied Probability, 25(A):287\u2013298","DOI":"10.2307\/3214163"},{"issue":"3","key":"189_CR42","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s11633-021-1278-z","volume":"18","author":"M Ying","year":"2021","unstructured":"Ying M, Feng Y, Ying S (2021) Optimal policies for quantum Markov decision processes. Int J Autom Comput 18(3):410\u2013421. https:\/\/doi.org\/10.1007\/s11633-021-1278-z","journal-title":"Int J Autom Comput"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-024-00189-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-024-00189-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-024-00189-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T16:08:40Z","timestamp":1734970120000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-024-00189-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,12]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["189"],"URL":"https:\/\/doi.org\/10.1007\/s42484-024-00189-6","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"value":"2524-4906","type":"print"},{"value":"2524-4914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,12]]},"assertion":[{"value":"13 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"58"}}