Quantum automated learning with provable and explainable trainability

Quantum automated learning with provable and explainable trainability | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Physical Sciences - Article Quantum automated learning with provable and explainable trainability Dong-Ling Deng, Qi Ye, Shuangyue Geng, Zizhao Han, Weikang Li, and 1 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6167014/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted You are reading this latest preprint version Abstract Machine learning is widely believed to be one of the most promising practical applications of quantum computing. Existing quantum machine learning schemes typically employ a quantum-classical hybrid approach that relies crucially on gradients of model parameters. Such an approach lacks provable convergence to global minima and will become infeasible as quantum learning models scale up. Here, we introduce quantum automated learning, where no variational parameter is involved and the training process is converted to quantum state preparation. In particular, we encode training data into unitary operations and iteratively evolve a random initial state under these unitaries and their inverses, with a target-oriented perturbation towards higher prediction accuracy sandwiched in between. Under reasonable assumptions, we rigorously prove that the evolution converges exponentially to the desired state corresponding to the global minimum of the loss function. We show that such a training process can be understood from the perspective of preparing quantum states by imaginary time evolution, where the data-encoded unitaries together with target-oriented perturbations would train the quantum learning model in an automated fashion. We further prove that the introduced quantum automated learning paradigm features universal representation power and good generalization ability with the generalization error upper bounded by the ratio between a logarithmic function of the Hilbert space dimension and the number of training samples. In addition, we carry out extensive numerical simulations on real-life images and quantum data to demonstrate the effectiveness of our approach and validate the assumptions. Our results establish an unconventional quantum learning strategy that is gradient-free with provable and explainable trainability, which would be crucial for large-scale practical applications of quantum computing in machine learning scenarios. Physical sciences/Physics/Quantum physics/Quantum information Physical sciences/Mathematics and computing/Computer science Full Text Additional Declarations Yes there is potential Competing Interest. L.-M.D. hold shares with HYQ Co. Supplementary Files supp.pdf Supplementary Information for Quantum automated learning with provable and explainable trainability Cite Share Download PDF Status: Under Review Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-6167014","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Physical Sciences - Article","associatedPublications":[],"authors":[{"id":427824477,"identity":"b75f8be0-f84d-4aa1-82f6-fe23734ff27f","order_by":0,"name":"Dong-Ling Deng","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA8klEQVRIiWNgGAWjYDCC4wwGQNKGgYEZjEAggYCWw2AtaRIkazksAWITp4XvMPPGxwW/ztfJt/Mefl3YZsfAz55jwPBzB24tkofZio1n9t2WMDjMl2Y9sy2ZQbLnjQFj7xncWgwO85hJ8/YAtTDzmBnztjEzGNzIMWBmbMOrxfw3b885CflmsJZ6BnsitJgx8/w4IMFwmMf4MW8bMDQkCGgB+UWatyFZcgNY77njPBJnnhUc7MWjhe9488bPPH/s+OX7zxh/5imrluNvT9744CceLWAAdQYbKHJ4QKwDBDQAwR8wyfyBsMpRMApGwSgYiQAAP2xKF4Lm3J8AAAAASUVORK5CYII=","orcid":"https://orcid.org/0000-0002-1042-4646","institution":"Tsinghua University","correspondingAuthor":true,"prefix":"","firstName":"Dong-Ling","middleName":"","lastName":"Deng","suffix":""},{"id":427824478,"identity":"743884ab-6a3e-44a3-94d7-6ce48d769e62","order_by":1,"name":"Qi Ye","email":"","orcid":"","institution":"Tsinghua University","correspondingAuthor":false,"prefix":"","firstName":"Qi","middleName":"","lastName":"Ye","suffix":""},{"id":427824479,"identity":"e083c947-9df9-4979-8c72-6a498866fc48","order_by":2,"name":"Shuangyue Geng","email":"","orcid":"","institution":"Tsinghua University","correspondingAuthor":false,"prefix":"","firstName":"Shuangyue","middleName":"","lastName":"Geng","suffix":""},{"id":427824480,"identity":"116c2ecb-dd05-4b9a-acae-99268097b4a4","order_by":3,"name":"Zizhao Han","email":"","orcid":"","institution":"Tsinghua University","correspondingAuthor":false,"prefix":"","firstName":"Zizhao","middleName":"","lastName":"Han","suffix":""},{"id":427824481,"identity":"b03a9804-9ec5-460e-9428-9226f7c4781e","order_by":4,"name":"Weikang Li","email":"","orcid":"https://orcid.org/0000-0002-7137-5390","institution":"","correspondingAuthor":false,"prefix":"","firstName":"Weikang","middleName":"","lastName":"Li","suffix":""},{"id":427824482,"identity":"2ee7ee6e-2deb-4592-9d05-387ead53c525","order_by":5,"name":"Luming Duan","email":"","orcid":"https://orcid.org/0000-0002-5539-2721","institution":"Tsinghua University","correspondingAuthor":false,"prefix":"","firstName":"Luming","middleName":"","lastName":"Duan","suffix":""}],"badges":[],"createdAt":"2025-03-06 05:00:08","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6167014/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6167014/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":79643485,"identity":"d39455fc-ac83-4748-aea1-f11c19d9f9d2","added_by":"auto","created_at":"2025-04-01 06:33:56","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":876503,"visible":true,"origin":"","legend":"Article File","description":"","filename":"main.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6167014/v1_covered_2552ac57-8df5-4900-9bf3-d03f5021545d.pdf"},{"id":79642853,"identity":"c77d49ab-b54b-43ec-b959-022d649350e2","added_by":"auto","created_at":"2025-04-01 06:25:49","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"supplement","size":405317,"visible":true,"origin":"","legend":"Supplementary Information for Quantum automated learning with provable and explainable trainability","description":"","filename":"supp.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6167014/v1/458afd07e61161905e524e71.pdf"}],"financialInterests":"\u003cb\u003eYes\u003c/b\u003e there is potential Competing Interest.\nL.-M.D. hold shares with HYQ Co.","formattedTitle":"Quantum automated learning with provable and explainable trainability","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"nature-portfolio","isNatureJournal":true,"hasQc":false,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"","title":"Nature Portfolio","twitterHandle":"","acdcEnabled":false,"dfaEnabled":false,"editorialSystem":"ejp","reportingPortfolio":"","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"","lastPublishedDoi":"10.21203/rs.3.rs-6167014/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6167014/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Machine learning is widely believed to be one of the most promising practical applications of quantum computing. Existing quantum machine learning schemes typically employ a quantum-classical hybrid approach that relies crucially on gradients of model parameters. Such an approach lacks provable convergence to global minima and will become infeasible as quantum learning models scale up. Here, we introduce quantum automated learning, where no variational parameter is involved and the training process is converted to quantum state preparation. In particular, we encode training data into unitary operations and iteratively evolve a random initial state under these unitaries and their inverses, with a target-oriented perturbation towards higher prediction accuracy sandwiched in between. Under reasonable assumptions, we rigorously prove that the evolution converges exponentially to the desired state corresponding to the global minimum of the loss function. We show that such a training process can be understood from the perspective of preparing quantum states by imaginary time evolution, where the data-encoded unitaries together with target-oriented perturbations would train the quantum learning model in an automated fashion. We further prove that the introduced quantum automated learning paradigm features universal representation power and good generalization ability with the generalization error upper bounded by the ratio between a logarithmic function of the Hilbert space dimension and the number of training samples. In addition, we carry out extensive numerical simulations on real-life images and quantum data to demonstrate the effectiveness of our approach and validate the assumptions. Our results establish an unconventional quantum learning strategy that is gradient-free with provable and explainable trainability, which would be crucial for large-scale practical applications of quantum computing in machine learning scenarios.","manuscriptTitle":"Quantum automated learning with provable and explainable trainability","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-04-01 06:25:45","doi":"10.21203/rs.3.rs-6167014/v1","editorialEvents":[],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"nature-physics","isNatureJournal":true,"hasQc":false,"allowDirectSubmit":false,"externalIdentity":"nphys","sideBox":"Learn more about [Nature Physics](http://www.nature.com/nphys/)","snPcode":"","submissionUrl":"","title":"Nature Physics","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"ejp","reportingPortfolio":"Nature Research","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"ecae3f78-e40c-44e5-b03a-e0c97a56db51","owner":[],"postedDate":"April 1st, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[{"id":45581490,"name":"Physical sciences/Physics/Quantum physics/Quantum information"},{"id":45581491,"name":"Physical sciences/Mathematics and computing/Computer science"}],"tags":[],"updatedAt":"2025-04-01T06:25:45+00:00","versionOfRecord":[],"versionCreatedAt":"2025-04-01 06:25:45","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6167014","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6167014","identity":"rs-6167014","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}