{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T15:39:48Z","timestamp":1756309188921,"version":"3.37.3"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s11128-021-03225-7","type":"journal-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T07:04:12Z","timestamp":1630479852000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Learning bounds for quantum circuits in the agnostic setting"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9131-2752","authenticated-orcid":false,"given":"Claudiu Marius","family":"Popescu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,1]]},"reference":[{"key":"3225_CR1","first-page":"3089","volume":"463","author":"S Aaronson","year":"2007","unstructured":"Aaronson, S.: The learnability of quantum states. Proc. R. Soc. A Math. Phys. Eng. Sci. A 463, 3089\u20133114 (2007)","journal-title":"Proc. R. Soc. A Math. Phys. Eng. Sci. A"},{"key":"3225_CR2","unstructured":"Aaronson, S., Chen, X., Hazan, E., Kale, S.: Online learning of quantum states. In: Proceedings of the 32nd international conference on Neural Information Processing Systems (NIPS\u201918), pp. 8976\u20138986 (2018)"},{"key":"3225_CR3","doi-asserted-by":"crossref","unstructured":"Aaronson, S.: Shadow tomography of quantum states. SIAM J. Comput. 49(5), STOC18-368\u2013STOC18-394 (2020)","DOI":"10.1137\/18M120275X"},{"key":"3225_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-016-0028-x","volume":"7","author":"U Alvarez-Rodriguez","year":"2017","unstructured":"Alvarez-Rodriguez, U., Lamata, L., Escandell-Montero, P., Mart\u00edn-Guerrero, J.D., Solano, E.: Supervised Quantum Learning without Measurements. Sci. Rep. 7, 1\u20139 (2017)","journal-title":"Sci. Rep."},{"issue":"1","key":"3225_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2006.12.013","volume":"378","author":"A Ambainis","year":"2007","unstructured":"Ambainis, A., Iwama, K., Kawachi, A., Raymond, R., Yamashita, S.: Improved algorithms for quantum identification of Boolean oracles. Theor. Comput. Sci. 378(1), 41\u201353 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"3225_CR6","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s00037-016-0139-6","volume":"25","author":"A Ambainis","year":"2016","unstructured":"Ambainis, A., Iwama, K., Nakanishi, M., Nishimura, H., Raymond, R., Tani, S., Yamashita, S.: Quantum query complexity of almost all functions with fixed on-set size. Comput. Complex. 25, 723\u2013735 (2016)","journal-title":"Comput. Complex."},{"key":"3225_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624216","volume-title":"Learning in Neural Networks: Theoretical Foundations","author":"MM Anthony","year":"1999","unstructured":"Anthony, M.M., Bartlett, P.: Learning in Neural Networks: Theoretical Foundations. Cambridge University Press, USA (1999)"},{"key":"3225_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/3106700.3106710","volume":"48","author":"S Arunachalam","year":"2017","unstructured":"Arunachalam, S., de Wolf, R., Column, G.: A survey of quantum learning theory. ACM SIGACT News 48, 41\u201344 (2017)","journal-title":"ACM SIGACT News"},{"key":"3225_CR9","first-page":"1","volume":"19","author":"S Arunachalam","year":"2018","unstructured":"Arunachalam, S., de Wolf, R.: optimal quantum sample complexity of learning algorithms. J. Mach. Learn. Res. 19, 1\u201336 (2018)","journal-title":"J. Mach. Learn. Res."},{"key":"3225_CR10","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s11128-005-0001-2","volume":"4","author":"A Atici","year":"2005","unstructured":"Atici, A., Servedio, R.A.: Improved bounds on quantum learning algorithms. Quantum Inf. Process. 4, 355\u2013386 (2005)","journal-title":"Quantum Inf. Process."},{"key":"3225_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s11128-007-0061-6","volume":"6","author":"A Atici","year":"2007","unstructured":"Atici, A., Servedio, R.A.: Quantum algorithms for learning and testing juntas. Quantum Inf. Process. 6, 323\u2013348 (2007)","journal-title":"Quantum Inf. Process."},{"key":"3225_CR12","unstructured":"Babbush, R., Love, P., Aspuru-Guzik, A.: Adiabatic quantum simulation of quantum chemistry. Sci. Rep. 4, 6603 (2014). https:\/\/urldefense.proofpoint.com\/v2\/url?u=https-3A__doi.org_10.1038_srep06603&d=DwIDaQ&c=vh6FgFnduejNhPPD0fl_yRaSfZy8CWbWnIf4XJhSqx8&r=eIE3I0XpWWrhwtq0qhyjYYVSdRw0yjTwnJuvumozR6g&m=ktVzayvb14pbX9VNfqgr9cr1m-Nc4-BjWGbh_tcuitA&s=sa8a5Wizs1VC2m9HxRnErTrwBW-zikobBlVES52sTgU&e="},{"key":"3225_CR13","doi-asserted-by":"crossref","unstructured":"Banchi, L., Pereira, J., Pirandola, S.: Generalization in quantum machine learning: a quantum information perspective, arXiv preprint, arXiv:2102.08991 (2021)","DOI":"10.1103\/PRXQuantum.2.040321"},{"issue":"2","key":"3225_CR14","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/jcss.1997.1557","volume":"56","author":"PL Bartlett","year":"1998","unstructured":"Bartlett, P.L., Long, P.M.: Prediction, learning, uniform convergence, and scale-sensitive dimensions. J. Comput. Syst. Sci. 56(2), 174\u2013190 (1998)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"3225_CR15","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1017\/S0963548300004247","volume":"9","author":"M Anthony","year":"2000","unstructured":"Anthony, M., Bartlett, P.L.: Function learning from interpolation. Comb. Probab. Comput. 9(3), 213\u2013225 (2000)","journal-title":"Comb. Probab. Comput."},{"key":"3225_CR16","first-page":"463","volume":"3","author":"PL Bartlett","year":"2002","unstructured":"Bartlett, P.L., Mendelson, S.: Rademacher and Gaussian complexities: risk bounds and structural results. J. Mach. Learn. Res. 3, 463\u2013482 (2002)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"3225_CR17","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00037-015-0099-2","volume":"24","author":"A Belovs","year":"2015","unstructured":"Belovs, A.: Quantum algorithms for learning symmetric juntas via adversary bound. Comput. Complex. 24(2), 255\u2013293 (2015)","journal-title":"Comput. Complex."},{"key":"3225_CR18","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1038\/nature23474","volume":"549","author":"J Biamonte","year":"2017","unstructured":"Biamonte, J., et al.: Quantum machine learning. Nature 549, 195\u2013202 (2017)","journal-title":"Nature"},{"key":"3225_CR19","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1137\/S0097539795293123","volume":"28","author":"NH Bshouty","year":"1999","unstructured":"Bshouty, N.H., Jackson, J.C.: Learning DNF over the uniform distribution using a quantum example oracle. SIAM J. Comput. 28, 1136\u20131153 (1999)","journal-title":"SIAM J. Comput."},{"key":"3225_CR20","doi-asserted-by":"crossref","unstructured":"Bu, K., Koh, D.E., Li, L., Luo, Q., Zhang, Y.: On the statistical complexity of quantum circuits, \u201d arXiv preprint, arXiv:2101.06154 (2021)","DOI":"10.1103\/PhysRevA.105.062431"},{"key":"3225_CR21","doi-asserted-by":"crossref","unstructured":"Bu, K., Koh, D.E., Li, L., Luo, Q., Zhang, Y.: Effects of quantum resources on the statistical complexity of quantum circuits, \u201d arXiv preprint, arXiv:2102.03282 (2021)","DOI":"10.1103\/PhysRevA.105.062431"},{"key":"3225_CR22","doi-asserted-by":"crossref","unstructured":"Bu, K., Koh, D.E., Li, L., Luo, Q., Zhang, Y.: Rademacher complexity of noisy quantum circuits, \u201d arXiv preprint, arXiv:2103.03139 (2021)","DOI":"10.1103\/PhysRevA.105.062431"},{"key":"3225_CR23","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1051\/ps:2005018","volume":"9","author":"S Boucheron","year":"2005","unstructured":"Boucheron, S., Bousquet, O., Lugosi, G.: Theory of classification: a survey of some recent advances. ESAIM Probab. Stat. 9, 323\u2013375 (2005)","journal-title":"ESAIM Probab. Stat."},{"key":"3225_CR24","doi-asserted-by":"publisher","first-page":"6:1","DOI":"10.1147\/JRD.2018.2888987","volume":"62","author":"Y Cao","year":"2018","unstructured":"Cao, Y., Romero, J., Aspuru-Guzik, A.: Potential of quantum computing for drug discovery. IBM J. Res. Dev. 62, 6:1-6:20 (2018)","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"3225_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s42484-020-00027-5","volume":"2","author":"MC Caro","year":"2020","unstructured":"Caro, M.C., Datta, I.: Pseudo-dimension of quantum circuits. Quantum Mach. Intell. 2(2), 1\u201314 (2020)","journal-title":"Quantum Mach. Intell."},{"key":"3225_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-018-2112-6","volume":"18","author":"J Chen","year":"2019","unstructured":"Chen, J., Nurdin, H.I.: Learning nonlinear input\u2013output maps with dissipative quantum systems. Quantum Inf. Process. 18, 1\u201336 (2019)","journal-title":"Quantum Inf. Process."},{"issue":"7\u20138","key":"3225_CR27","first-page":"615","volume":"16","author":"H-C Cheng","year":"2016","unstructured":"Cheng, H.-C., Hsieh, M.-H., Yeh, P.-C.: The learnability of unknown quantum measurements. Quantum Inf. Process. 16(7\u20138), 615\u2013656 (2016)","journal-title":"Quantum Inf. Process."},{"key":"3225_CR28","unstructured":"Chung, K.-M., Lin, H.-H., Luo, Q., Zhang, Y.: Sample efficient algorithms for learning quantum channels in PAC model and the approximate state discrimination problem, arXiv preprint, arXiv:1810.10938 (2018)"},{"key":"3225_CR29","first-page":"81","volume":"6","author":"CM Dawson","year":"2005","unstructured":"Dawson, C.M., Nielsen, M.A.: The solovay-kitaev algorithm. Quantum Inf. Comput. 6, 81\u201395 (2005)","journal-title":"Quantum Inf. Comput."},{"key":"3225_CR30","unstructured":"Denil, M, De Freitas.: N. Toward the implementation of a quantum RBM. In: Neural Information Processing Systems (NIPS) Conf. on Deep Learning and Unsupervised Feature Learning Workshop, vol. 5. (2011). https:\/\/urldefense.proofpoint.com\/v2\/url?u=https-3A__ora.ox.ac.uk_objects_uuid-3Aea79d085-2D6f08-2D4341-2D9af1-2D5a3972542bfa&d=DwIDaQ&c=vh6FgFnduejNhPPD0fl_yRaSfZy8CWbWnIf4XJhSqx8&r=eIE3I0XpWWrhwtq0qhyjYYVSdRw0yjTwnJuvumozR6g&m=ktVzayvb14pbX9VNfqgr9cr1m-Nc4-BjWGbh_tcuitA&s=ia3yZdyHbICwhMaxmh6yKZCNsFqMB3jqRSYMnZgVQ7A&e="},{"key":"3225_CR31","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.1214\/aop\/1176991978","volume":"15","author":"RM Dudley","year":"1987","unstructured":"Dudley, R.M.: Universal Donsker classes and metric entropy. Ann Probab 15, 1306\u20131326 (1987)","journal-title":"Ann Probab"},{"key":"3225_CR32","doi-asserted-by":"crossref","unstructured":"Dumoulin, V., Goodfellow, I.J., Courville, A., Bengio, Y.: On the challenges of physical implementations of RBMs, In: Proceedings of the 28th AAAI Conference on Artificial Intelligence (2014)","DOI":"10.1609\/aaai.v28i1.8924"},{"key":"3225_CR33","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0377-0427(02)00519-8","volume":"149","author":"AJ Freeman","year":"2002","unstructured":"Freeman, A.J.: Materials by design and the exciting role of quantum computation\/simulation. J. Comput. Appl. Math. 149, 27\u201356 (2002)","journal-title":"J. Comput. Appl. Math."},{"key":"3225_CR34","unstructured":"Giannozzi, P., et al.: QUANTUM ESPRESSO: a modular and open-source software project for quantum simulations of materials. J. Phys. Condens. Matter 21(39), 395502 (2009). https:\/\/urldefense.proofpoint.com\/v2\/url?u=https-3A__iopscience.iop.org_article_10.1088_0953-2D8984_21_39_395502_meta&d=DwIDaQ&c=vh6FFnduejNhPPD0fl_yRaSfZy8CWbWnIf4XJhSqx8&r=eIE3I0XpWWrhwtq0qhyjYYVSdRw0yjTwnJuvumozR6g&m=ktVzayvb14pbX9VNfqgr9cr1m-Nc4-BjWGbh_tcuitA&s=XrJ91XMEzZcEqAqd4Ejb-05npqK3o13jxooZvSBknqY&e="},{"issue":"2\u20133","key":"3225_CR35","first-page":"131","volume":"18","author":"PW Goldberg","year":"1995","unstructured":"Goldberg, P.W., Jerrum, M.R.: Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers. Mach. Learn. 18(2\u20133), 131\u2013148 (1995)","journal-title":"Mach. Learn."},{"issue":"3","key":"3225_CR36","doi-asserted-by":"publisher","first-page":"032314","DOI":"10.1103\/PhysRevA.99.032314","volume":"99","author":"AB Grilo","year":"2019","unstructured":"Grilo, A.B., Kerenidis, I., Zijlstra, T.: Learning-with-errors problem is easy with quantum samples. Phys. Rev. A 99(3), 032314 (2019)","journal-title":"Phys. Rev. A"},{"key":"3225_CR37","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis, 2nd edn. Cambridge University Press, Cambridge and NewYork (2012). https:\/\/urldefense.proofpoint.com\/v2\/url?u=https-3A__dl.acm.org_doi_book_10.5555_2422911&d=DwIDaQ&c=vh6FgFnduejNhPPD0fl_yRaSfZy8CWbWnIf4XJhSqx8&r=eIE3I0XpWWrhwtq0qhyjYYVSdRw0yjTwnJuvumozR6g&m=ktVzayvb14pbX9VNfqgr9cr1m-Nc4-BjWGbh_tcuitA&s=FpGr4ZCFMqt8zm2P6s-Pcr6B9x1_hZiVCmEWwYJ6IkY&e="},{"key":"3225_CR38","unstructured":"Kiani, B.T., Lloyd, S., Maity, R.: Learning Unitaries by Gradient Descent, arXiv preprint, arXiv:2001.11897 (2020)"},{"key":"3225_CR39","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1070\/RM1997v052n06ABEH002155","volume":"6","author":"AY Kitaev","year":"1997","unstructured":"Kitaev, A.Y.: Quantum computations: algorithms and error correction. Russ. Math. Surv. 6, 1191\u20131249 (1997)","journal-title":"Russ. Math. Surv."},{"key":"3225_CR40","doi-asserted-by":"crossref","unstructured":"Koltchinskii V., Panchenko D.: Rademacher processes and bounding the risk of function learning. In: Gin\u00e9 E., Mason D.M., Wellner J.A. (eds) High Dimensional Probability II. Progress in Probability, vol 47, pp 443\u201345. Birkh\u00e4user, Boston, MA (2000). https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4612-1358-1_29","DOI":"10.1007\/978-1-4612-1358-1_29"},{"issue":"5","key":"3225_CR41","doi-asserted-by":"publisher","first-page":"1902","DOI":"10.1109\/18.930926","volume":"47","author":"V Koltchinskii","year":"2001","unstructured":"Koltchinskii, V., Panchenko, D.: Rademacher penalties and structural risk minimization. IEEE Trans. Inf. Theory 47(5), 1902\u20131914 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3225_CR42","unstructured":"Kothari, R.: An optimal quantum algorithm for the oracle identification problem, In: 31st international Symposium on Theoretical Aspects of Computer Science (STACS 2014), pp. 482\u2013493 (2014)"},{"issue":"1\u20132","key":"3225_CR43","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF02384340","volume":"29","author":"F Lust-Piquard","year":"1991","unstructured":"Lust-Piquard, F., Pisier, G.: Non Commutative Khintchine and Paley inequalities. Arkiv for Matematik 29(1\u20132), 241\u2013260 (1991)","journal-title":"Arkiv for Matematik"},{"issue":"1","key":"3225_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41524-019-0267-z","volume":"6","author":"H Ma","year":"2020","unstructured":"Ma, H., Govoni, M., Galli, G.: Quantum simulations of materials on near-term quantum computers. NPJ Comput. Mater. 6(1), 1\u20138 (2020)","journal-title":"NPJ Comput. Mater."},{"issue":"1","key":"3225_CR45","doi-asserted-by":"publisher","first-page":"015003","DOI":"10.1103\/RevModPhys.92.015003","volume":"92","author":"S McArdle","year":"2020","unstructured":"McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S.C., Yuan, X.: Quantum computational chemistry. Rev. Modern Phys. 92(1), 015003 (2020)","journal-title":"Rev. Modern Phys."},{"key":"3225_CR46","volume-title":"Foundations of Machine Learning","author":"M Mohri","year":"2018","unstructured":"Mohri, M., Rostamizadeh, A., Talwalkar, A.: Foundations of Machine Learning, 2nd edn. MIT Press, Cambridge (2018)","edition":"2"},{"key":"3225_CR47","unstructured":"Neyshabur, B., Tomioka, R., Srebro, N.: Norm-based capacity control in neural networks, In: Proceedings of the 28th conference on learning theory, PMLR, vol. 40, pp. 1376-1401 (2015)"},{"key":"3225_CR48","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M.A., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge and New York (2010)"},{"key":"3225_CR49","volume-title":"Lecture Notes for Physics 229: Quantum Information and Computation","author":"J Preskill","year":"2015","unstructured":"Preskill, J.: Lecture Notes for Physics 229: Quantum Information and Computation. CreateSpace Independent Publishing Platform, Scotts Valley (2015)"},{"key":"3225_CR50","doi-asserted-by":"publisher","first-page":"130503","DOI":"10.1103\/PhysRevLett.113.130503","volume":"113","author":"P Rebentrost","year":"2014","unstructured":"Rebentrost, P., Mohseni, M., Lloyd, S.: Quantum support vector machine for big data classification. Phys. Rev. Lett. 113, 130503 (2014)","journal-title":"Phys. Rev. Lett."},{"key":"3225_CR51","unstructured":"Rocchetto, A.: Stabiliser states are efficiently PAC-learnable. Quant. Info. Comput. 18(7\u20138), 541\u2013552 (2018). https:\/\/urldefense.proofpoint.com\/v2\/url?u=https-3A__dl.acm.org_doi_abs_10.5555_3370256.3370257&d=DwIDaQ&c=vh6FgFnduejNhPPD0fl_yRaSfZy8CWbWnIf4XJhSqx8&r=eIE3I0XpWWrhwtq0qhyjYYVSdRw0yjTwnJuvumozR6g&m=ktVzyvb14pbX9VNfqgr9cr1m-Nc4-BjWGbh_tcuitA&s=KDei-kYroVbDvNr7ZdfCnW9rRU1Ng5cJlKh0JCaeIsg&e="},{"key":"3225_CR52","doi-asserted-by":"crossref","unstructured":"Rocchetto1, A., Aaronson, S., Severini, S., Carvacho, G., Poderini, D., Agresti, I., Bentivegna, M., Sciarrino, F. : Experimental learning of quantum states. Sci. Adv. 5(3), eaau1946 (2019)","DOI":"10.1126\/sciadv.aau1946"},{"issue":"5","key":"3225_CR53","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1137\/S0097539704412910","volume":"33","author":"RA Servedio","year":"2004","unstructured":"Servedio, R.A., Gortler, S.J.: Equivalences and separations between quantum and classical learnability. SIAM J. Comput. 33(5), 1067\u20131092 (2004)","journal-title":"SIAM J. Comput."},{"key":"3225_CR54","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding Machine Learning","author":"S Shalev-Shwartz","year":"2014","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning. Cambridge University Press, Cambridge and New York (2014)"},{"key":"3225_CR55","first-page":"412","volume":"197","author":"VN Sudakov","year":"1971","unstructured":"Sudakov, V.N.: Gaussian random processes and measures of solid angles in Hilbert space. Doklady Akademii Nauk SSSR 197, 412\u2013415 (1971). (Russian)","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"3225_CR56","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1090\/S0002-9947-1968-0226281-1","volume":"133","author":"HE Warren","year":"1968","unstructured":"Warren, H.E.: Lower bounds for approximation by nonlinear manifolds. Trans. Am. Math. Soc. 133, 167\u2013178 (1968)","journal-title":"Trans. Am. Math. Soc."},{"key":"3225_CR57","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.ipl.2010.10.007","volume":"111","author":"C Zhang","year":"2010","unstructured":"Zhang, C.: An improved lower bound on query complexity for quantum PAC learning. Inf. Process. Lett. 111, 40\u201345 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"3225_CR58","doi-asserted-by":"publisher","first-page":"052331","DOI":"10.1103\/PhysRevA.99.052331","volume":"99","author":"Z Zhao","year":"2019","unstructured":"Zhao, Z., Fitzsimons, J.K., Fitzsimons, J.F.: Quantum-assisted Gaussian process regression. Phys. Rev. A 99(5), 052331 (2019)","journal-title":"Phys. Rev. A"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03225-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-021-03225-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03225-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T11:18:48Z","timestamp":1673176728000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-021-03225-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":58,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["3225"],"URL":"https:\/\/doi.org\/10.1007\/s11128-021-03225-7","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"type":"print","value":"1570-0755"},{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2021,9]]},"assertion":[{"value":"29 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"286"}}