Multi-target quantum compilation algorithm

Multi-target quantum compilation algorithm | 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 Article Multi-target quantum compilation algorithm Le Binho, Vu Tuan Hai, Nguyen Tan Viet, Jesus Urbaneja, Nguyen Vu Linh, and 1 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4678149/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract In quantum computing, quantum compilation transforms a target unitary into a trainable unitary represented by a quantum circuit. Traditional quantum compilation optimizes circuits for a single target. However, many quantum systems require simultaneous optimization of multiple targets. To address this, we developed a multi-target quantum compilation algorithm to enhance the performance and flexibility of simulating multiple quantum systems. Our benchmarks and case studies demonstrate the algorithm’s effectiveness, highlighting the significance of multi-target optimization in advancing quantum computing. This work establishes the foundation for further development and evaluation of multi-target quantum compilation algorithms. Physical sciences/Physics/Quantum physics/Qubits Physical sciences/Physics/Quantum physics/Quantum simulation Physical sciences/Physics/Quantum physics/Quantum mechanics Full Text Additional Declarations There is NO Competing Interest. Cite Share Download PDF Status: Posted 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-4678149","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":326415068,"identity":"4b958fbf-9978-4901-8bc6-ad5f1f8f4649","order_by":0,"name":"Le Binho","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA+klEQVRIiWNgGAWjYBACA2YGNgaGCjkQycDA2MBgABHnIaTljDGIZGwgTgsDUDFjmzHEDoQWPMCcnffYg4/zDPL5+A+wP/i4w8bY4ADzww8MMndwarFs5ks3nLnNwLJNIoGxceaZNDODA2zGEgw8z3A77DCPmTTvtj8GbBIMjM28bYdtDA4wmAH9cpiAljkGBmz8B2Ba2L8RoaUBqIUhAawF6DAe/LZYNvOYSc44BtQikdg4c2ZbmrHkYZ5iiQQ8fjHnP2Mm8aHGwEC+//CBDx/bbAz7jrdv/PCxB3eIIQFgpIABMxAn9hwgRgsK+EG6llEwCkbBKBi2AAA4MEutX3H1VAAAAABJRU5ErkJggg==","orcid":"https://orcid.org/0000-0002-8816-4450","institution":"Tohoku University","correspondingAuthor":true,"prefix":"","firstName":"Le","middleName":"","lastName":"Binho","suffix":""},{"id":326415069,"identity":"426df985-a586-4637-b4d1-98a8876e3d72","order_by":1,"name":"Vu Tuan Hai","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"Vu","middleName":"Tuan","lastName":"Hai","suffix":""},{"id":326415070,"identity":"7f12f7ac-8ebe-4ae6-95be-126991b791eb","order_by":2,"name":"Nguyen Tan Viet","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"Nguyen","middleName":"Tan","lastName":"Viet","suffix":""},{"id":326415071,"identity":"0a8dd694-ad79-4daf-874d-cd50a0a2bebf","order_by":3,"name":"Jesus Urbaneja","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"Jesus","middleName":"","lastName":"Urbaneja","suffix":""},{"id":326415072,"identity":"1e9d3b19-df22-4f57-86d0-4969221df96b","order_by":4,"name":"Nguyen Vu Linh","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"Nguyen","middleName":"Vu","lastName":"Linh","suffix":""},{"id":326415073,"identity":"3c6e7a14-ede9-4003-b00d-225f9e0c8545","order_by":5,"name":"Tran Nguyen Lan","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"Tran","middleName":"Nguyen","lastName":"Lan","suffix":""}],"badges":[],"createdAt":"2024-07-03 06:45:13","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4678149/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4678149/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":64773575,"identity":"fa844f04-b824-41b0-a0d6-61770e99eb90","added_by":"auto","created_at":"2024-09-18 15:18:48","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1678433,"visible":true,"origin":"","legend":"","description":"","filename":"main.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4678149/v1_covered_cb8fd387-7930-4cce-a0e8-c1e7dfa6c9ad.pdf"}],"financialInterests":"There is \u003cb\u003eNO\u003c/b\u003e Competing Interest.","formattedTitle":"Multi-target quantum compilation algorithm","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"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":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"","lastPublishedDoi":"10.21203/rs.3.rs-4678149/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4678149/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"In quantum computing, quantum compilation transforms a target unitary into a trainable unitary represented by a quantum circuit. Traditional quantum compilation optimizes circuits for a single target. However, many quantum systems require simultaneous optimization of multiple targets. To address this, we developed a multi-target quantum compilation algorithm to enhance the performance and flexibility of simulating multiple quantum systems. Our benchmarks and case studies demonstrate the algorithm’s effectiveness, highlighting the significance of multi-target optimization in advancing quantum computing. This work establishes the foundation for further development and evaluation of multi-target quantum compilation algorithms.","manuscriptTitle":"Multi-target quantum compilation algorithm","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-08-06 04:38:54","doi":"10.21203/rs.3.rs-4678149/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"03c95e9d-d5a9-4d36-ba35-00ae635daede","owner":[],"postedDate":"August 6th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":34541284,"name":"Physical sciences/Physics/Quantum physics/Qubits"},{"id":34541285,"name":"Physical sciences/Physics/Quantum physics/Quantum simulation"},{"id":34541286,"name":"Physical sciences/Physics/Quantum physics/Quantum mechanics"}],"tags":[],"updatedAt":"2024-09-18T15:10:40+00:00","versionOfRecord":[],"versionCreatedAt":"2024-08-06 04:38:54","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4678149","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4678149","identity":"rs-4678149","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}