Back to News
quantum-computing

Quantum-inspired classical simulation through randomized time evolution

arXiv Quantum Physics
Loading...
4 min read
0 likes
⚡ Quantum Brief
Researchers Hasselgren and Koczor introduced a quantum-inspired classical algorithm called MPS TE-PAI that leverages randomized time evolution to simulate quantum many-body dynamics, addressing the exponential cost barrier in tensor-network methods. The method adapts a quantum algorithm (TE-PAI) for classical systems, enabling massive parallelization by representing randomized shallow circuits as tensor networks, reducing sequential computation bottlenecks. MPS TE-PAI achieves exact time evolution on average with lower variance than quantum hardware, as randomness stems only from circuit sampling—not shot noise—improving estimator reliability. Numerical tests on 1D spin-ring Hamiltonians show up to 1,000x fewer gates per sample versus Trotterized MPS, cutting time-to-solution by orders of magnitude under parallelization. The approach resists bond-dimension truncation better than product formulas, making it promising for simulating strongly correlated systems where truncation is unavoidable.
Quantum-inspired classical simulation through randomized time evolution

Summarize this article with:

Quantum Physics arXiv:2604.13144 (quant-ph) [Submitted on 14 Apr 2026] Title:Quantum-inspired classical simulation through randomized time evolution Authors:Fredrik Hasselgren, Bálint Koczor View a PDF of the paper titled Quantum-inspired classical simulation through randomized time evolution, by Fredrik Hasselgren and B\'alint Koczor View PDF HTML (experimental) Abstract:Tensor-network simulations of quantum many-body dynamics are fundamentally limited by entanglement build-up, which leads to exponentially growing computational costs. Furthermore, these classical simulation algorithms are inherently sequential as typically a tensor network representation of the quantum state is updated incrementally at each time step. We build on recently introduced randomized quantum algorithms for time evolution (TE-PAI), and adapt them to the classical simulation context with the purpose of enabling massive parallelisation. Our MPS TE-PAI approach achieves exact time evolution on average (unbiased estimator) and proceeds by representing an ensemble of randomized shallow Trotter-variant circuits as tensor networks. As each circuit instance yields a deterministic quantum state (or observable expecation value), the only source of randomness is the sampling of circuit variants; the absence of shot noise therefore yields a reduced estimator variance relative to quantum hardware implementations of TE-PAI. We simulate representative disordered one-dimensional spin-ring Hamiltonians, and numerically observe reductions in the per-sample gate-count by a factor of up to $10^3$ relative to Trotterized MPS evolution, yielding orders of magnitude reduction in the time-to-solution under realistic levels of parallelisation. Finally, we numerically observe that MPS TE-PAI is substantially more robust against severe bond-dimension truncation than product formulas, potentially making it useful for the simulation of strongly correlated systems where truncation is necessary in practice. We also demonstrate that the approach can be used naturally in combination with existing time evolution algorithms, effectively extending their time depth via parallelisation. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2604.13144 [quant-ph] (or arXiv:2604.13144v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2604.13144 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Fredrik Hasselgren [view email] [v1] Tue, 14 Apr 2026 15:09:29 UTC (888 KB) Full-text links: Access Paper: View a PDF of the paper titled Quantum-inspired classical simulation through randomized time evolution, by Fredrik Hasselgren and B\'alint KoczorView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-04 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-algorithms
quantum-hardware

Source Information

Source: arXiv Quantum Physics