{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T16:32:51Z","timestamp":1759422771500,"version":"3.37.3"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001871","name":"National Funds through the Portuguese funding agency, FCT - Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UIDB\/50014\/2020"],"award-info":[{"award-number":["UIDB\/50014\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3110652","type":"journal-article","created":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T20:33:18Z","timestamp":1630960398000},"page":"125416-125427","source":"Crossref","is-referenced-by-count":2,"title":["Quantum Tree-Based Planning"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6659-9277","authenticated-orcid":false,"given":"Andre","family":"Sequeira","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4466-1129","authenticated-orcid":false,"given":"Luis Paulo","family":"Santos","sequence":"additional","affiliation":[]},{"given":"Luis Soares","family":"Barbosa","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2017.8122616"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/11766247_37"},{"key":"ref12","article-title":"The problem of dynamic programming on a quantum computer","author":"ronagh","year":"2019","journal-title":"arXiv 1906 02229"},{"key":"ref13","first-page":"51","article-title":"Reinforcement learning using quantum Boltzmann machines","volume":"18","author":"crawford","year":"2018","journal-title":"Quantum Inf Comput"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-14740-y"},{"key":"ref15","first-page":"1","article-title":"Speeding-up the decision making of a learning agent using an ion trap quantum processor","volume":"4","author":"sriarunothai","year":"2019","journal-title":"Quantum Sci Technol"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1038\/srep00400"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-021-03242-7"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-96424-9","author":"schuld","year":"2018","journal-title":"Supervised Learning With Quantum Computers"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.102.032420"},{"key":"ref4","first-page":"1324","article-title":"A sparse sampling algorithm for near-optimal planning in large Markov decision processes","author":"kearns","year":"1999","journal-title":"Proc IJCAI Int Joint Conf Artif Intell"},{"journal-title":"Doing My Oracle Duty","year":"2010","author":"aaronson","key":"ref27"},{"journal-title":"Artificial Intelligence A Modern Approach","year":"2009","author":"russell","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.117.130501"},{"key":"ref5","first-page":"1","article-title":"On the sample complexity of reinforcement learning","author":"kakade","year":"2003","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2018.09.001"},{"key":"ref7","article-title":"Exponential improvements for quantum-accessible reinforcement learning","author":"dunjko","year":"2017","journal-title":"arXiv 1710 11160"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1954-09848-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.90.032311"},{"journal-title":"Reinforcement Learning An Introduction","year":"2018","author":"sutton","key":"ref1"},{"journal-title":"A Quantum Algorithm for finding the Maximum","year":"1999","author":"ahuja","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/305\/05215"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.63.012310"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P"},{"article-title":"Qiskit: An open-source framework for quantum computing","year":"2021","author":"et al zoufal","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2307\/2276774"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09530390.pdf?arnumber=9530390","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T18:43:55Z","timestamp":1673203435000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9530390\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3110652","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}