Snapshot-QAOA: Extending QAOA to Quantum Hamiltonian Simulation | 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 Research Article Snapshot-QAOA: Extending QAOA to Quantum Hamiltonian Simulation Reuben Tate, Quinn Langfitt, Elijah Pelofske, Ammar Kirmani, Andreas Bärtschi, and 2 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-9171925/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 We present Snapshot-QAOA, a variation of the Quantum Approximate Optimization Algorithm (QAOA) that finds approximate minimum energy eigenstates of a large set of quantum Hamiltonians. Traditionally, QAOA targets the task of approximately solving combinatorial optimization problems. Snapshot-QAOA enables a significant expansion of the use case space for QAOA to more general quantum Hamiltonians, where the goal is to approximate the ground-state. Snapshot-QAOA retains the desirable variational-algorithm qualities of QAOA such as a small parameter count and relatively shallow circuit depth. Snapshot-QAOA is thus a better trainable alternative to the (Near Intermediate-Scale Quantum) NISQ-era Variational Quantum Eigensolver (VQE) algorithm, while retaining a significant circuit-depth advantage over the (Quantum Error Corrected) QEC-era Quantum Phase Estimation (QPE) algorithm. Our fundamental approach is inspired by the idea of Trotterization of a continuous-time linear adiabatic anneal schedule. Snapshot-QAOA restricts the QAOA evolution to not phasing out the mixing Hamiltonian completely at the end of the evolution, instead evolving only a partial typical linear QAOA schedule, thus creating a type of snapshot of the typical QAOA evolution. In this way, the cost of the quantum Hamiltonian is encoded by the phase separator to address the diagonal terms in the problem Hamiltonian and by the mixer to address the non-diagonal terms in the problem Hamiltonian. We focus on QAOA with the transverse field mixer, and thus simulations of quantum Hamiltonians that contain single-site Pauli-X terms. By measuring the expectation value of the system in both X and Z-basis, we can estimate the ground-state energy of transverse field quantum Hamiltonians. The accuracy of ground-state energy finding with snapshot-QAOA is evaluated using extensive numerical simulations on a 16 qubit J1-J2 frustrated transverse field Ising model. QAOA Ground State Estimation Snapshot-QAOA Quantum Computing Quantum Algorithms Quantum Approximate Optimization Algorithm Quantum Simulation Full Text Additional Declarations The authors declare no competing interests. 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-9171925","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":609050165,"identity":"1cb6f93d-c248-4d40-9dc0-4ca89a6ea958","order_by":0,"name":"Reuben Tate","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAArklEQVRIiWNgGAWjYNCCCgsGBnaiVbMxMDYwnJFgYGAmSQtjGylazOc3P3/wcZ6EvDkzA/OLj21EaJE5xmbYOHObhOHOZgY2y5nEaJFgYzBs5t0mwbjhMAObMc8ZorSwf2z+O0fCnhQtPIbNjA0SiUAtzI95KojSklM4s+eYRPKGw4xtjDOI0sJ8fMOHHzU2thuONx/+8MGACC1IABw7JALmDyRrGQWjYBSMghEBAOfdMMuRtJrhAAAAAElFTkSuQmCC","orcid":"","institution":"Los Alamos National Laboratory","correspondingAuthor":true,"prefix":"","firstName":"Reuben","middleName":"","lastName":"Tate","suffix":""},{"id":609050166,"identity":"4e393da4-051e-4cfc-a7dc-3882c51e64fb","order_by":1,"name":"Quinn Langfitt","email":"","orcid":"","institution":"Northwestern University","correspondingAuthor":false,"prefix":"","firstName":"Quinn","middleName":"","lastName":"Langfitt","suffix":""},{"id":609050167,"identity":"7fcc25b5-e06a-4c76-941f-508e0e697848","order_by":2,"name":"Elijah Pelofske","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA2ElEQVRIie3QMQrCMBTG8ScdXCJdU3qJJ4KLxV4lQXAq2NFJKoF2dK3Uw6QE6tIDVHSwNyi4CC7GVaGtm2D+W4YfHy8AJtNvNpDgAcJQRABhTyNhqQnJNcGvCOU9ie0KKRu2mdhOvb2FCPMdZe3EORQsT5maOhkXboqw2KcdBKsA1eguPTzzyCWaYCnbiV+tGkXYxvNPuXj0IkgD0MSaIh3Er5U5HqN2Qi8Fvm6Z0JLHM4KUOUkHsTNRX/WPjXeJUmey9nzbahd65u3JOzY+CfidwmQymf6uJ08HRKj7YClpAAAAAElFTkSuQmCC","orcid":"","institution":"Los Alamos National Laboratory","correspondingAuthor":true,"prefix":"","firstName":"Elijah","middleName":"","lastName":"Pelofske","suffix":""},{"id":609050168,"identity":"783348f9-dede-4d0e-97c1-80f0564987d7","order_by":3,"name":"Ammar Kirmani","email":"","orcid":"","institution":"Los Alamos National Laboratory","correspondingAuthor":false,"prefix":"","firstName":"Ammar","middleName":"","lastName":"Kirmani","suffix":""},{"id":609050169,"identity":"21bedfc8-3e31-4b21-a8c0-a7e871e02429","order_by":4,"name":"Andreas Bärtschi","email":"","orcid":"","institution":"Los Alamos National Laboratory","correspondingAuthor":false,"prefix":"","firstName":"Andreas","middleName":"","lastName":"Bärtschi","suffix":""},{"id":609050170,"identity":"c8761548-e4e3-4aa1-a189-25cd0760eac1","order_by":5,"name":"John Golden","email":"","orcid":"","institution":"Los Alamos National Laboratory","correspondingAuthor":false,"prefix":"","firstName":"John","middleName":"","lastName":"Golden","suffix":""},{"id":609050171,"identity":"5744da97-6d42-43d6-85ad-6a3f7d980ee7","order_by":6,"name":"Stephan Eidenbenz","email":"","orcid":"","institution":"Los Alamos National Laboratory","correspondingAuthor":false,"prefix":"","firstName":"Stephan","middleName":"","lastName":"Eidenbenz","suffix":""}],"badges":[],"createdAt":"2026-03-19 17:12:06","currentVersionCode":1,"declarations":{"humanSubjects":false,"vertebrateSubjects":false,"conflictsOfInterestStatement":false,"humanSubjectEthicalGuidelines":false,"humanSubjectConsent":false,"humanSubjectClinicalTrial":false,"humanSubjectCaseReport":false,"vertebrateSubjectEthicalGuidelines":false},"doi":"10.21203/rs.3.rs-9171925/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-9171925/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":105563661,"identity":"940ff5d7-2282-49d1-9d7c-60b0d2e13d86","added_by":"auto","created_at":"2026-03-27 12:47:23","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":870215,"visible":true,"origin":"","legend":"","description":"","filename":"manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-9171925/v1_covered_d6a6a7f6-cf3b-4079-ad11-d993f1ec7c51.pdf"}],"financialInterests":"The authors declare no competing interests.","formattedTitle":"\u003cp\u003eSnapshot-QAOA: Extending QAOA to Quantum Hamiltonian Simulation\u003c/p\u003e","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":true,"highlight":"","institution":"Los Alamos National Laboratory","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":"QAOA, Ground State Estimation, Snapshot-QAOA, Quantum Computing, Quantum Algorithms, Quantum Approximate Optimization Algorithm, Quantum Simulation","lastPublishedDoi":"10.21203/rs.3.rs-9171925/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-9171925/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eWe present Snapshot-QAOA, a variation of the Quantum Approximate Optimization Algorithm (QAOA) that finds approximate minimum energy eigenstates of a large set of quantum Hamiltonians. Traditionally, QAOA targets the task of approximately solving combinatorial optimization problems. Snapshot-QAOA enables a significant expansion of the use case space for QAOA to more general quantum Hamiltonians, where the goal is to approximate the ground-state. Snapshot-QAOA retains the desirable variational-algorithm qualities of QAOA such as a small parameter count and relatively shallow circuit depth. Snapshot-QAOA is thus a better trainable alternative to the (Near Intermediate-Scale Quantum) NISQ-era Variational Quantum Eigensolver (VQE) algorithm, while retaining a significant circuit-depth advantage over the (Quantum Error Corrected) QEC-era Quantum Phase Estimation (QPE) algorithm. Our fundamental approach is inspired by the idea of Trotterization of a continuous-time linear adiabatic anneal schedule. Snapshot-QAOA restricts the QAOA evolution to not phasing out the mixing Hamiltonian completely at the end of the evolution, instead evolving only a partial typical linear QAOA schedule, thus creating a type of snapshot of the typical QAOA evolution. In this way, the cost of the quantum Hamiltonian is encoded by the phase separator to address the diagonal terms in the problem Hamiltonian and by the mixer to address the non-diagonal terms in the problem Hamiltonian. We focus on QAOA with the transverse field mixer, and thus simulations of quantum Hamiltonians that contain single-site Pauli-X terms. By measuring the expectation value of the system in both X and Z-basis, we can estimate the ground-state energy of transverse field quantum Hamiltonians. The accuracy of ground-state energy finding with snapshot-QAOA is evaluated using extensive numerical simulations on a 16 qubit J1-J2 frustrated transverse field Ising model.\u0026nbsp;\u003c/p\u003e","manuscriptTitle":"Snapshot-QAOA: Extending QAOA to Quantum Hamiltonian Simulation","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-03-22 12:04:45","doi":"10.21203/rs.3.rs-9171925/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":"f1ed120f-4202-42d5-b3e8-81673c93ed15","owner":[],"postedDate":"March 22nd, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2026-03-22T12:04:45+00:00","versionOfRecord":[],"versionCreatedAt":"2026-03-22 12:04:45","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-9171925","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-9171925","identity":"rs-9171925","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}
Text is read by the "Ask this paper" AI Q&A widget below.
Extraction quality varies by source — PMC NXML preserves structure
cleanly, OA-HTML may include some navigation residue, and OA-PDF can
have broken hyphenation. The publisher copy
(via DOI)
is the canonical version.