{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T13:11:00Z","timestamp":1748437860206,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819709885"},{"type":"electronic","value":"9789819709892"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-0989-2_12","type":"book-chapter","created":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T06:02:15Z","timestamp":1710482535000},"page":"150-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Linear Structure of\u00a0Training Samples in\u00a0Quantum Neural Network Applications"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4502-6119","authenticated-orcid":false,"given":"Alexander","family":"Mandl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8397-7973","authenticated-orcid":false,"given":"Johanna","family":"Barzen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7770-7296","authenticated-orcid":false,"given":"Marvin","family":"Bechtold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-2214-9445","authenticated-orcid":false,"given":"Michael","family":"Keckeisen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9123-259X","authenticated-orcid":false,"given":"Frank","family":"Leymann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1528-6430","authenticated-orcid":false,"given":"Patrick K. S.","family":"Vaudrevange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,16]]},"reference":[{"key":"12_CR1","unstructured":"Documentation on torch.optim.Adam. https:\/\/pytorch.org\/docs\/stable\/generated\/torch.optim.Adam.html. Accessed 31 Aug 2023"},{"key":"12_CR2","unstructured":"Qiskit: Summary of quantum operations: Standard rotations. https:\/\/qiskit.org\/documentation\/tutorials\/circuits\/3_summary_of_quantum_operations.html#Standard-Rotations. Accessed 30 Aug 2023"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1038\/s41467-020-14454-2","volume":"11","author":"K Beer","year":"2020","unstructured":"Beer, K., et al.: Training deep quantum neural networks. Nat. Commun. 11(1), 808 (2020)","journal-title":"Nat. Commun."},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1038\/s41534-019-0157-8","volume":"5","author":"M Benedetti","year":"2019","unstructured":"Benedetti, M., Garcia-Pintos, D., Perdomo, O., Leyton-Ortega, V., Nam, Y., Perdomo-Ortiz, A.: A generative modeling approach for benchmarking and training shallow quantum circuits. NPJ Quant. Inf. 5(1), 45 (2019)","journal-title":"NPJ Quant. Inf."},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"043001","DOI":"10.1088\/2058-9565\/ab4eb5","volume":"4","author":"M Benedetti","year":"2019","unstructured":"Benedetti, M., Lloyd, E., Sack, S., Fiorentini, M.: Parameterized quantum circuits as machine learning models. Quant. Sci. Technol. 4(4), 043001 (2019)","journal-title":"Quant. Sci. Technol."},{"issue":"7671","key":"12_CR6","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1038\/nature23474","volume":"549","author":"J Biamonte","year":"2017","unstructured":"Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., Lloyd, S.: Quantum machine learning. Nature 549(7671), 195\u2013202 (2017)","journal-title":"Nature"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"4919","DOI":"10.1038\/s41467-022-32550-3","volume":"13","author":"MC Caro","year":"2022","unstructured":"Caro, M.C., et al.: Generalization in quantum machine learning from few training data. Nat. Commun. 13(1), 4919 (2022)","journal-title":"Nat. Commun."},{"issue":"9","key":"12_CR8","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1038\/s42254-021-00348-9","volume":"3","author":"M Cerezo","year":"2021","unstructured":"Cerezo, M., et al.: Variational quantum algorithms. Nat. Rev. Phys. 3(9), 625\u2013644 (2021)","journal-title":"Nat. Rev. Phys."},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"033125","DOI":"10.1103\/PhysRevResearch.2.033125","volume":"2","author":"Y Du","year":"2020","unstructured":"Du, Y., Hsieh, M.H., Liu, T., Tao, D.: Expressive power of parametrized quantum circuits. Phys. Rev. Res. 2, 033125 (2020)","journal-title":"Phys. Rev. Res."},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"040337","DOI":"10.1103\/PRXQuantum.2.040337","volume":"2","author":"Y Du","year":"2021","unstructured":"Du, Y., Hsieh, M.H., Liu, T., You, S., Tao, D.: Learnability of quantum neural networks. PRX Quant. 2, 040337 (2021)","journal-title":"PRX Quant."},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"044007","DOI":"10.1088\/2058-9565\/abae7d","volume":"5","author":"F Leymann","year":"2020","unstructured":"Leymann, F., Barzen, J.: The bitter truth about gate-based quantum algorithms in the NISQ era. Quant. Sci. Technol. 5(4), 044007 (2020)","journal-title":"Quant. Sci. Technol."},{"key":"12_CR12","unstructured":"Mandl, A., Barzen, J., Leymann, F., Vietz, D.: On reducing the amount of samples required for training of QNNs: constraints on the linear structure of the training data. arXiv:2309.13711 [quant-ph] (2023)"},{"key":"12_CR13","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2010)"},{"key":"12_CR14","unstructured":"Paszke, A., et al.: PyTorch: an imperative style, high-performance deep learning library. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"12_CR15","unstructured":"Poland, K., Beer, K., Osborne, T.J.: No free lunch for quantum machine learning. arXiv:2003.14103 [quant-ph] (2020)"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Schuld, M., Bocharov, A., Svore, K.M., Wiebe, N.: Circuit-centric quantum classifiers. Phys. Rev. A 101(3) (2020)","DOI":"10.1103\/PhysRevA.101.032308"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Schuld, M., Petruccione, F.: Supervised Learning with Quantum Computers. Quantum Science and Technology. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-96424-9","DOI":"10.1007\/978-3-319-96424-9"},{"issue":"7","key":"12_CR18","doi-asserted-by":"publisher","first-page":"070501","DOI":"10.1103\/PhysRevLett.128.070501","volume":"128","author":"K Sharma","year":"2022","unstructured":"Sharma, K., Cerezo, M., Holmes, Z., Cincio, L., Sornborger, A., Coles, P.J.: Reformulation of the no-free-lunch theorem for entangled datasets. Phys. Rev. Lett. 128(7), 070501 (2022)","journal-title":"Phys. Rev. Lett."},{"issue":"4","key":"12_CR19","doi-asserted-by":"publisher","first-page":"043006","DOI":"10.1088\/1367-2630\/ab784c","volume":"22","author":"K Sharma","year":"2020","unstructured":"Sharma, K., Khatri, S., Cerezo, M., Coles, P.J.: Noise resilience of variational quantum compiling. New J. Phys. 22(4), 043006 (2020)","journal-title":"New J. Phys."},{"issue":"12","key":"12_CR20","doi-asserted-by":"publisher","first-page":"1900070","DOI":"10.1002\/qute.201900070","volume":"2","author":"S Sim","year":"2019","unstructured":"Sim, S., Johnson, P.D., Aspuru-Guzik, A.: Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms. Adv. Quant. Technol. 2(12), 1900070 (2019)","journal-title":"Adv. Quant. Technol."},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","volume":"17","author":"P Virtanen","year":"2020","unstructured":"Virtanen, P., et al.: SciPy 1.0: fundamental algorithms for scientific computing in python. Nat. Methods 17, 261\u2013272 (2020)","journal-title":"Nat. Methods"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"040327","DOI":"10.1103\/PRXQuantum.2.040327","volume":"2","author":"T Volkoff","year":"2021","unstructured":"Volkoff, T., Holmes, Z., Sornborger, A.: Universal compiling and (no-)free-lunch theorems for continuous-variable quantum learning. PRX Quant. 2, 040327 (2021)","journal-title":"PRX Quant."},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Wang, X., Du, Y., Tu, Z., Luo, Y., Yuan, X., Tao, D.: Transition role of entangled data in quantum machine learning. arXiv:2306.03481 [quant-ph] (2023)","DOI":"10.1038\/s41467-024-47983-1"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Weder, B., Barzen, J., Leymann, F., Zimmermann, M.: Hybrid quantum applications need two orchestrations in superposition: a software architecture perspective. In: Proceedings of the 18th IEEE International Conference on Web Services (ICWS 2021), pp. 1\u201313. IEEE (2021)","DOI":"10.1109\/ICWS53863.2021.00015"},{"issue":"4","key":"12_CR25","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1049\/qtc2.12032","volume":"2","author":"M Weigold","year":"2021","unstructured":"Weigold, M., Barzen, J., Leymann, F., Salm, M.: Encoding patterns for quantum algorithms. IET Quant. Commun. 2(4), 141\u2013152 (2021)","journal-title":"IET Quant. Commun."}],"container-title":["Lecture Notes in Computer Science","Service-Oriented Computing \u2013 ICSOC 2023 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0989-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T10:14:39Z","timestamp":1731579279000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0989-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819709885","9789819709892"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0989-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSOC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Service-Oriented Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icsoc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icsoc2023.diag.uniroma1.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ConfTool","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"208","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":"35","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":"10","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":"17% - 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":"4","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":"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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"other papers accepted: 3 industry full papers, 3 keynote abstracts (in the front matter)","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)"}}]}}