{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T00:41:17Z","timestamp":1775781677087,"version":"3.50.1"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031199066","type":"print"},{"value":"9783031199073","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-19907-3_37","type":"book-chapter","created":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T06:07:32Z","timestamp":1673590052000},"page":"384-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["QKSA: Quantum Knowledge Seeking Agent"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3026-6892","authenticated-orcid":false,"given":"Aritra","family":"Sarkar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7670-8572","authenticated-orcid":false,"given":"Zaid","family":"Al-Ars","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9310-4885","authenticated-orcid":false,"given":"Koen","family":"Bertels","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,14]]},"reference":[{"issue":"5","key":"37_CR1","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1017\/S0960129511000521","volume":"22","author":"J Baez","year":"2012","unstructured":"Baez, J., Stay, M.: Algorithmic thermodynamics. Math. Struct. Comput. Sci. 22(5), 771\u2013787 (2012)","journal-title":"Math. Struct. Comput. Sci."},{"key":"37_CR2","unstructured":"Bennett, C.H.: Logical depth and physical complexity. Citeseer (1988)"},{"issue":"4","key":"37_CR3","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/0218053","volume":"18","author":"CH Bennett","year":"1989","unstructured":"Bennett, C.H.: Time\/space trade-offs for reversible computation. SIAM J. Comput. 18(4), 766\u2013776 (1989)","journal-title":"SIAM J. Comput."},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Briegel, H.J., De las Cuevas, G.: Projective simulation for artificial intelligence. Sci. Rep. 2(1), 1\u201316 (2012)","DOI":"10.1038\/srep00400"},{"key":"37_CR5","unstructured":"Catt, E., Hutter, M.: A gentle introduction to quantum computing algorithms with applications to universal prediction. arXiv preprint arXiv:2005.03137 (2020)"},{"issue":"11\u201312","key":"37_CR6","doi-asserted-by":"publisher","first-page":"2455","DOI":"10.1080\/09500349708231894","volume":"44","author":"IL Chuang","year":"1997","unstructured":"Chuang, I.L., Nielsen, M.A.: Prescription for experimental determination of the dynamics of a quantum black box. J. Mod. Opt. 44(11\u201312), 2455\u20132467 (1997)","journal-title":"J. Mod. Opt."},{"key":"37_CR7","unstructured":"Domingos, P.: The master algorithm: How the quest for the ultimate learning machine will remake our world. In: Basic Books (2015)"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Dunjko, V., Taylor, J.M., Briegel, H.J.: Advances in quantum reinforcement learning. In: 2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 282\u2013287 (2017)","DOI":"10.1109\/SMC.2017.8122616"},{"issue":"1","key":"37_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2478\/jagi-2014-0001","volume":"5","author":"B Goertzel","year":"2014","unstructured":"Goertzel, B.: Artificial general intelligence: concept, state of the art, and future prospects. J. Artif. Gen. Intell. 5(1), 1 (2014)","journal-title":"J. Artif. Gen. Intell."},{"key":"37_CR10","unstructured":"Halpern, N.Y., Kothakonda, N.B., Haferkamp, J., Munson, A., Eisert, J., Faist, P.: Resource theory of quantum uncomplexity. arXiv preprint arXiv:2110.11371 (2021)"},{"key":"37_CR11","series-title":"Texts in Theoretical Computer Science An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/b138233","volume-title":"Universal Artificial Intellegence","author":"M Hutter","year":"2005","unstructured":"Hutter, M.: Universal Artificial Intellegence. TTCSAES, Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/b138233"},{"key":"37_CR12","doi-asserted-by":"publisher","unstructured":"Hutter, M.: Universal algorithmic intelligence: a mathematical top $$\\rightarrow $$ down approach. In: Artificial General Intelligence, pp. 227\u2013290. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-68677-4_8","DOI":"10.1007\/978-3-540-68677-4_8"},{"issue":"4","key":"37_CR13","doi-asserted-by":"publisher","first-page":"329","DOI":"10.3390\/a3040329","volume":"3","author":"M Hutter","year":"2010","unstructured":"Hutter, M.: A complete theory of everything (will be subjective). Algorithms 3(4), 329\u2013350 (2010)","journal-title":"Algorithms"},{"issue":"1","key":"37_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2478\/jagi-2019-0001","volume":"10","author":"S Katayama","year":"2019","unstructured":"Katayama, S.: Computable variants of aixi which are more powerful than aixitl. J. Artif. Gen. Intell. 10(1), 1\u201323 (2019)","journal-title":"J. Artif. Gen. Intell."},{"key":"37_CR15","unstructured":"Kleene, S.C.: Introduction to metamathematics. North-Holland Publishing Co. (1952)"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Kolchinsky, A., Wolpert, D.H.: Thermodynamic costs of turing machines. Phys. Rev. Res. 2(3), 033312 (2020)","DOI":"10.1103\/PhysRevResearch.2.033312"},{"issue":"1\u20134","key":"37_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/00207166808803030","volume":"2","author":"AN Kolmogorov","year":"1968","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Int. J. Comput. Math. 2(1\u20134), 157\u2013168 (1968)","journal-title":"Int. J. Comput. Math."},{"key":"37_CR18","unstructured":"Koza, J.R., Koza, J.R.: Genetic programming: on the programming of computers by means of natural selection, vol. 1. MIT press (1992)"},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"Krenn, M., Malik, M., Fickler, R., Lapkiewicz, R., Zeilinger, A.: Automated search for new quantum experiments. Phys. Rev. Lett. 116(9), 090405 (2016)","DOI":"10.1103\/PhysRevLett.116.090405"},{"key":"37_CR20","unstructured":"Leike, J., Hutter, M.: Bad universal priors and notions of optimality. In: Conference on Learning Theory, pp. 1244\u20131259. PMLR (2015)"},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"Leike, J., Lattimore, T., Orseau, L., Hutter, M.: Thompson sampling is asymptotically optimal in general environments. arXiv preprint arXiv:1602.07905 (2016)","DOI":"10.24963\/ijcai.2017\/688"},{"issue":"3","key":"37_CR22","first-page":"115","volume":"9","author":"LA Levin","year":"1973","unstructured":"Levin, L.A.: Universal sequential search problems. Probl. Peredachi Informatsii 9(3), 115\u2013116 (1973)","journal-title":"Probl. Peredachi Informatsii"},{"key":"37_CR23","unstructured":"Levy, R., Luo, D., Clark, B.K.: Classical shadows for quantum process tomography on near-term quantum computers. arXiv preprint arXiv:2110.02965 (2021)"},{"key":"37_CR24","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M Li","year":"2008","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. TCS, Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-49820-1"},{"issue":"104","key":"37_CR25","doi-asserted-by":"publisher","first-page":"20141226","DOI":"10.1098\/rsif.2014.1226","volume":"12","author":"C Marletto","year":"2015","unstructured":"Marletto, C.: Constructor theory of life. J. R. Soc. Interface 12(104), 20141226 (2015)","journal-title":"J. R. Soc. Interface"},{"key":"37_CR26","doi-asserted-by":"publisher","first-page":"301","DOI":"10.22331\/q-2020-07-20-301","volume":"4","author":"MP Mueller","year":"2020","unstructured":"Mueller, M.P.: Law without law: from observer states to physics via algorithmic information theory. Quantum 4, 301 (2020)","journal-title":"Quantum"},{"key":"37_CR27","doi-asserted-by":"crossref","unstructured":"Nielsen, M.A., Chuang, I.: Quantum computation and quantum information (2002)","DOI":"10.1119\/1.1463744"},{"key":"37_CR28","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.tcs.2013.09.025","volume":"519","author":"L Orseau","year":"2014","unstructured":"Orseau, L.: Universal knowledge-seeking agents. Theor. Comput. Sci. 519, 127\u2013139 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"37_CR29","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-40935-6_12","volume-title":"Algorithmic Learning Theory","author":"L Orseau","year":"2013","unstructured":"Orseau, L., Lattimore, T., Hutter, M.: Universal knowledge-seeking agents for stochastic environments. In: Jain, S., Munos, R., Stephan, F., Zeugmann, T. (eds.) ALT 2013. LNCS (LNAI), vol. 8139, pp. 158\u2013172. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40935-6_12"},{"key":"37_CR30","unstructured":"Poland, K., Beer, K., Osborne, T.J.: No free lunch for quantum machine learning. arXiv preprint arXiv:2003.14103 (2020)"},{"key":"37_CR31","unstructured":"Rivera-Dean, J., Huembeli, P., Ac\u00edn, A., Bowles, J.: Avoiding local minima in variational quantum algorithms with neural networks. arXiv preprint arXiv:2104.02955 (2021)"},{"key":"37_CR32","unstructured":"Sarkar, A.: Applications of Quantum Computation and Algorithmic Information: for Causal Modeling in Genomics and Reinforcement Learning. Ph. D. thesis, Delft University of Technology (2022)"},{"issue":"6","key":"37_CR33","doi-asserted-by":"publisher","first-page":"2696","DOI":"10.3390\/app11062696","volume":"11","author":"A Sarkar","year":"2021","unstructured":"Sarkar, A., Al-Ars, Z., Bertels, K.: Estimating algorithmic information using quantum computing for genomics applications. Appl. Sci. 11(6), 2696 (2021)","journal-title":"Appl. Sci."},{"key":"37_CR34","unstructured":"Sarkar, A., Al-Ars, Z., Gandhi, H., Bertels, K.: Qksa: quantum knowledge seeking agent-resource-optimized reinforcement learning using quantum process tomography. arXiv preprint arXiv:2112.03643 (2021)"},{"key":"37_CR35","unstructured":"Schmidhuber, J.: On learning how to learn learning strategies. Fakult\u00e4t f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, Technical report (1995)"},{"key":"37_CR36","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-45435-7_15","volume-title":"Computational Learning Theory","author":"J Schmidhuber","year":"2002","unstructured":"Schmidhuber, J.: The speed prior: a new simplicity measure yielding near-optimal computable predictions. In: Kivinen, J., Sloan, R.H. (eds.) COLT 2002. LNCS (LNAI), vol. 2375, pp. 216\u2013228. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45435-7_15"},{"key":"37_CR37","doi-asserted-by":"crossref","unstructured":"Silver, D., Singh, S., Precup, D., Sutton, R.S.: Reward is enough. Artif. Intell. 299, 103535 (2021)","DOI":"10.1016\/j.artint.2021.103535"},{"key":"37_CR38","doi-asserted-by":"crossref","unstructured":"Soler-Toscano, F., Zenil, H., Delahaye, J.P., Gauvrit, N.: Calculating kolmogorov complexity from the output frequency distributions of small turing machines. PloS One 9(5) (2014)","DOI":"10.1371\/journal.pone.0096223"},{"issue":"1","key":"37_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"RJ Solomonoff","year":"1964","unstructured":"Solomonoff, R.J.: A formal theory of inductive inference. Part i. Inf. Control 7(1), 1\u201322 (1964)","journal-title":"Inf. Control"},{"key":"37_CR40","unstructured":"Stranneg\u00e5rd, C., Svang\u00e5rd, N., Lindstr\u00f6m, D., Bach, J., Steunebrink, B.: The animat path to artificial general intelligence. In: Proceedings of IJCAI-17 Workshop on Architectures for Generality & Autonomy (2017)"},{"issue":"5","key":"37_CR41","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1038\/s41567-018-0048-5","volume":"14","author":"G Torlai","year":"2018","unstructured":"Torlai, G., Mazzola, G., Carrasquilla, J., Troyer, M., Melko, R., Carleo, G.: Neural-network quantum state tomography. Nat. Phys. 14(5), 447\u2013450 (2018). https:\/\/doi.org\/10.1038\/s41567-018-0048-5","journal-title":"Nat. Phys."},{"issue":"345\u2013363","key":"37_CR42","first-page":"5","volume":"58","author":"AM Turing","year":"1936","unstructured":"Turing, A.M., et al.: On computable numbers, with an application to the entscheidungsproblem. J. Math. 58(345\u2013363), 5 (1936)","journal-title":"J. Math."},{"key":"37_CR43","doi-asserted-by":"crossref","unstructured":"Wauters, M.M., Panizon, E., Mbeng, G.B., Santoro, G.E.: Reinforcement-learning-assisted quantum optimization. Phys. Rev. Res. 2(3), 033446 (2020)","DOI":"10.1103\/PhysRevResearch.2.033446"},{"key":"37_CR44","unstructured":"Wheeler, J.A.: At home in the universe. American Institute of Physics (1996)"},{"issue":"7","key":"37_CR45","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1162\/neco.1996.8.7.1341","volume":"8","author":"DH Wolpert","year":"1996","unstructured":"Wolpert, D.H.: The lack of a priori distinctions between learning algorithms. Neural Comput. 8(7), 1341\u20131390 (1996)","journal-title":"Neural Comput."}],"container-title":["Lecture Notes in Computer Science","Artificial General Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19907-3_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T07:08:55Z","timestamp":1673593735000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19907-3_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031199066","9783031199073"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19907-3_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"14 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AGI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial General Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seattle, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"agi2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agi-conf.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,54","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13 additional posters were included","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}