phase2: Full-State Vector Simulation of Quantum Time Evolution at Scale

preprint OA: gold CC-BY-4.0
📄 Open PDF Full text JSON View at publisher
AI-generated summary by claude@2026-07, 2026-07-29

This paper introduces a scalable full-state vector simulation algorithm and software for simulating quantum time evolution on large distributed CPU and GPU systems, demonstrating superior performance and applying it to study Trotter error in a 40-qubit quantum chemistry problem.

One-sentence paraphrase of the abstract; not a substitute for reading it. No clinical advice. How this works

Abstract

Abstract Large-scale classical simulation of quantum computers is crucial for benchmarking quantum algorithms, establishing boundaries of quantum advantage and exploring heuristic quantum algorithms. We present a full-state vector simulation algorithm and software implementation designed to perform HPC simulation of layers of rotations around a string of Pauli operators. We demonstrate robust scalability of the simulation method on large distributed CPU and GPU systems. Our distributed computation harnessed up to 16384 CPU cores and 512 NVIDIA H100 GPUs, using 32 TB of memory. The simulator significantly outperforms other high-performance libraries, showing a typical speedup of 10-100 for large-scale multi-GPU workloads. As a first application of our approach, we report a numerical experiment aimed at simulating exactly Hamiltonian dynamics of up to 40 qubits to investigate the Trotter error for a quantum chemistry problem. Bounding the Trotter error is important for evaluating the cost of quantum algorithms for chemistry, and rigorous bounds are often conservative, as our simulations confirm. Our software, specifically designed for quantum time evolution applications, is also well equipped to manage circuits that utilize standard gate sets.
Full text 11,862 characters · extracted from preprint-html · click to expand
phase2: Full-State Vector Simulation of Quantum Time Evolution at Scale | 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 phase2: Full-State Vector Simulation of Quantum Time Evolution at Scale Marek Miller, Jakob Günther, Freek Witteveen, Matthew Teynor, and 4 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6620681/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 Large-scale classical simulation of quantum computers is crucial for benchmarking quantum algorithms, establishing boundaries of quantum advantage and exploring heuristic quantum algorithms. We present a full-state vector simulation algorithm and software implementation designed to perform HPC simulation of layers of rotations around a string of Pauli operators. We demonstrate robust scalability of the simulation method on large distributed CPU and GPU systems. Our distributed computation harnessed up to 16384 CPU cores and 512 NVIDIA H100 GPUs, using 32 TB of memory. The simulator significantly outperforms other high-performance libraries, showing a typical speedup of 10-100 for large-scale multi-GPU workloads. As a first application of our approach, we report a numerical experiment aimed at simulating exactly Hamiltonian dynamics of up to 40 qubits to investigate the Trotter error for a quantum chemistry problem. Bounding the Trotter error is important for evaluating the cost of quantum algorithms for chemistry, and rigorous bounds are often conservative, as our simulations confirm. Our software, specifically designed for quantum time evolution applications, is also well equipped to manage circuits that utilize standard gate sets. Physical sciences/Physics/Quantum physics/Quantum simulation Physical sciences/Mathematics and computing/Software Physical sciences/Mathematics and computing/Computational science Full Text Additional Declarations There is NO Competing Interest. 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-6620681","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":473219471,"identity":"3fec0275-d47d-40d8-9d1d-ff71110fa8fa","order_by":0,"name":"Marek Miller","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAo0lEQVRIiWNgGAWjYDACdgbGB0AqgYEHSPIcIEYLMwOzAQODAWla2CRI06LbzJ1WdaPmTx4DzxkDhjdniNBidph32+2cYwbFDLw9BoxzbhCthc0gsYGfx4CZ5wORWopz/pGqhTm3DagF6DBmHiIdtlk6t884sY3nWMHBOUR5/3jvxs853+QS+3mSNz54c4wILXDABsQHSNEwCkbBKBgFowAPAAANRzVAEd6UuAAAAABJRU5ErkJggg==","orcid":"https://orcid.org/0000-0002-1850-4499","institution":"University of Copenhagen","correspondingAuthor":true,"prefix":"","firstName":"Marek","middleName":"","lastName":"Miller","suffix":""},{"id":473219472,"identity":"e709e819-5d48-4828-b604-e6a20b263761","order_by":1,"name":"Jakob Günther","email":"","orcid":"","institution":"University of Copenhagen","correspondingAuthor":false,"prefix":"","firstName":"Jakob","middleName":"","lastName":"Günther","suffix":""},{"id":473219473,"identity":"4f18059c-5cdc-4209-9103-7bb272d8f032","order_by":2,"name":"Freek Witteveen","email":"","orcid":"","institution":"University of Copenhagen","correspondingAuthor":false,"prefix":"","firstName":"Freek","middleName":"","lastName":"Witteveen","suffix":""},{"id":473219474,"identity":"e447345b-54e9-4a0d-99e4-9cc7dfd2982d","order_by":3,"name":"Matthew Teynor","email":"","orcid":"https://orcid.org/0000-0002-6981-4809","institution":"University of Copenhagen","correspondingAuthor":false,"prefix":"","firstName":"Matthew","middleName":"","lastName":"Teynor","suffix":""},{"id":473219475,"identity":"575cd591-e97d-4a05-8956-84ad16552411","order_by":4,"name":"Mihael Erakovic","email":"","orcid":"","institution":"ETH","correspondingAuthor":false,"prefix":"","firstName":"Mihael","middleName":"","lastName":"Erakovic","suffix":""},{"id":473219476,"identity":"dcc44a35-f3a1-49d9-97b1-ebd860095827","order_by":5,"name":"Markus Reiher","email":"","orcid":"https://orcid.org/0000-0002-9508-1565","institution":"ETH Zurich","correspondingAuthor":false,"prefix":"","firstName":"Markus","middleName":"","lastName":"Reiher","suffix":""},{"id":473219477,"identity":"47d6f047-fc99-40c7-9d33-e3e776f0bb6a","order_by":6,"name":"Gemma Solomon","email":"","orcid":"","institution":"University of Copenhagen","correspondingAuthor":false,"prefix":"","firstName":"Gemma","middleName":"","lastName":"Solomon","suffix":""},{"id":473219478,"identity":"07555e40-ea4e-4333-bc91-d35ca2b01fa9","order_by":7,"name":"Matthias Christandl","email":"","orcid":"","institution":"University of Copenhagen","correspondingAuthor":false,"prefix":"","firstName":"Matthias","middleName":"","lastName":"Christandl","suffix":""}],"badges":[],"createdAt":"2025-05-08 12:30:42","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6620681/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6620681/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":85931749,"identity":"f9289c31-727e-4079-96c2-bd227bc80eeb","added_by":"auto","created_at":"2025-07-03 09:36:54","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1199103,"visible":true,"origin":"","legend":"Article File","description":"","filename":"MillerM.etal.phase2FullStateVectorSimulationofQuantumTimeEvolutionatScale20250506.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6620681/v1_covered_00903761-9907-40a6-a9ea-9bd9fb6c2601.pdf"}],"financialInterests":"There is \u003cb\u003eNO\u003c/b\u003e Competing Interest.","formattedTitle":"phase2: Full-State Vector Simulation of Quantum Time Evolution at Scale","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-6620681/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6620681/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Large-scale classical simulation of quantum computers is crucial for benchmarking quantum algorithms, establishing boundaries of quantum advantage and exploring heuristic quantum algorithms. We present a full-state vector simulation algorithm and software implementation designed to perform HPC simulation of layers of rotations around a string of Pauli operators. We demonstrate robust scalability of the simulation method on large distributed CPU and GPU systems. Our distributed computation harnessed up to 16384 CPU cores and 512 NVIDIA H100 GPUs, using 32 TB of memory. The simulator significantly outperforms other high-performance libraries, showing a typical speedup of 10-100 for large-scale multi-GPU workloads. As a first application of our approach, we report a numerical experiment aimed at simulating exactly Hamiltonian dynamics of up to 40 qubits to investigate the Trotter error for a quantum chemistry problem. Bounding the Trotter error is important for evaluating the cost of quantum algorithms for chemistry, and rigorous bounds are often conservative, as our simulations confirm. Our software, specifically designed for quantum time evolution applications, is also well equipped to manage circuits that utilize standard gate sets.","manuscriptTitle":"phase2: Full-State Vector Simulation of Quantum Time Evolution at Scale","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-07-03 09:28:46","doi":"10.21203/rs.3.rs-6620681/v1","editorialEvents":[],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"nature-communications","isNatureJournal":true,"hasQc":false,"allowDirectSubmit":false,"externalIdentity":"NCOMMS","sideBox":"Learn more about [Nature Communications](http://www.nature.com/ncomms/)","snPcode":"","submissionUrl":"https://mts-ncomms.nature.com/","title":"Nature Communications","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"ejp","reportingPortfolio":"Nature Communications","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"ff146084-9da3-4e13-84a0-d9d812af4b5b","owner":[],"postedDate":"July 3rd, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[{"id":50257245,"name":"Physical sciences/Physics/Quantum physics/Quantum simulation"},{"id":50257246,"name":"Physical sciences/Mathematics and computing/Software"},{"id":50257247,"name":"Physical sciences/Mathematics and computing/Computational science"}],"tags":[],"updatedAt":"2025-07-03T09:28:46+00:00","versionOfRecord":[],"versionCreatedAt":"2025-07-03 09:28:46","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6620681","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6620681","identity":"rs-6620681","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","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.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-21T05:10:58.409756+00:00
License: CC-BY-4.0