{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T16:00:30Z","timestamp":1775145630812,"version":"3.50.1"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"crossref","award":["EP\/W032643\/1"],"award-info":[{"award-number":["EP\/W032643\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"crossref","award":["EP\/T032146\/1"],"award-info":[{"award-number":["EP\/T032146\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1109\/tnnls.2025.3552223","type":"journal-article","created":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T17:55:37Z","timestamp":1744221337000},"page":"11355-11368","source":"Crossref","is-referenced-by-count":4,"title":["Universal Approximation Theorem and Error Bounds for Quantum Neural Networks and Quantum Reservoirs"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3367-2455","authenticated-orcid":false,"given":"Lukas","family":"Gonon","sequence":"first","affiliation":[{"name":"School of Computer Science, University of St. Gallen, St. Gallen, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3986-3201","authenticated-orcid":false,"given":"Antoine","family":"Jacquier","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Imperial College London, London, U.K."}]}],"member":"263","reference":[{"issue":"5","key":"ref1","first-page":"953","article-title":"On the representation of continuous functions of many variables by superposition of continuous functions of one variable and addition","volume":"114","author":"Kolmogorov","year":"1957","journal-title":"Doklady Akademii Nauk"},{"key":"ref2","first-page":"679","article-title":"On functions of three variables","volume":"114","author":"Arnold","year":"1957","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02551274"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(91)90009-T"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(89)90020-8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(05)80131-5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9045(03)00078-9"},{"key":"ref8","first-page":"2306","article-title":"Universal approximation with deep narrow networks","volume-title":"Proc. Conf. Learn. Theory","author":"Kidger"},{"key":"ref9","first-page":"69","article-title":"Neural net approximation","volume-title":"Proc. 7th Yale Workshop Adapt. Learn. Syst.","volume":"1","author":"Barron"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.256500"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF00993164"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1996.8.1.164"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/18M118709X"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1142\/S0219530519410021"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2017.07.002"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/9781009025096.004"},{"key":"ref17","article-title":"Quantum computing and the entanglement frontier","author":"Preskill","year":"2012","journal-title":"arXiv:1203.5813"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1098\/rsif.2022.0541"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-07-20-770"},{"key":"ref20","first-page":"1","article-title":"Random features for large-scale kernel machines","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"20","author":"Rahimi"},{"key":"ref21","first-page":"1313","article-title":"Weighted sums of random kitchen sinks: Replacing minimization with randomization in learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"21","author":"Rahimi"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2006.875977"},{"key":"ref23","article-title":"The \u2019echo state\u2019 approach to analysing and training recurrent neural networks-with an erratum note","volume":"148","author":"Jaeger"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2009.03.005"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2019.03.005"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2899649"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2021.01.025"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2018.08.025"},{"issue":"24","key":"ref29","first-page":"1","article-title":"Universal discrete-time reservoir computers with stochastic inputs and linear readouts using non-homogeneous state-affine systems","volume":"19","author":"Grigoryeva","year":"2018","journal-title":"J. Mach. Learn. Res."},{"key":"ref30","first-page":"1","article-title":"Random feature neural networks learn black-scholes type PDEs without curse of dimensionality","volume":"24","author":"Gonon","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1214\/22-aap1806"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevApplied.8.024030"},{"key":"ref33","article-title":"Characterizing the memory capacity of transmon qubit reservoirs","author":"Dasgupta","year":"2020","journal-title":"arXiv:2004.08240"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.107.035306"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.physleta.2023.128713"},{"issue":"1","key":"ref36","article-title":"Natural quantum reservoir computing for temporal information processing","volume-title":"Sci. Rep.","volume":"12","author":"Suzuki","year":"2022"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/qute.202100053"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1002\/qute.202100027"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.22331\/q-2020-02-06-226"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.104.012405"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.103.032430"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-019-2311-9"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevApplied.14.024065"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1038\/s42005-021-00556-w"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.3.L032049"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1140\/epjc\/s10052-024-12558-3"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.132.010602"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.127.090506"},{"key":"ref49","article-title":"Learning in high dimension always amounts to extrapolation","author":"Balestriero","year":"2021","journal-title":"arXiv:2110.09485"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcmds.2021.100021"},{"key":"ref51","article-title":"How neural networks extrapolate: From feedforward to graph neural networks","author":"Xu","year":"2020","journal-title":"arXiv:2009.11848"},{"key":"ref52","article-title":"Generalization error of random features and kernel methods: Hypercontractivity and kernel matrix concentration","author":"Mei","year":"2021","journal-title":"arXiv:2101.10588"},{"key":"ref53","article-title":"Generalization properties of learning with random features","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Rudi"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1515\/9780691213033"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-021-22539-9"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-018-07090-4"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.98.032309"},{"key":"ref58","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4015-8","volume-title":"Foundations of Modern Probability","author":"Kallenberg","year":"2002"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20212-4"},{"key":"ref60","volume-title":"Real & Complex Analysis","author":"Rudin","year":"1987"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.3390\/app12020759"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1142\/S0219749913500159"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/5962385\/11022714\/10959724.pdf?arnumber=10959724","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T17:57:16Z","timestamp":1749059836000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10959724\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":62,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2025.3552223","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6]]}}}