Computational regimes in matrix-product-state-based quantum trajectory simulations

Summarize this article with:
Quantum Physics arXiv:2606.13779 (quant-ph) [Submitted on 11 Jun 2026] Title:Computational regimes in matrix-product-state-based quantum trajectory simulations Authors:Aaron Sander, Simon Cichy, Martin Eigel, Jens Eisert, Maximilian Fröhlich, Tom Peham, Robert Wille View a PDF of the paper titled Computational regimes in matrix-product-state-based quantum trajectory simulations, by Aaron Sander and 6 other authors View PDF HTML (experimental) Abstract:Efficient simulation of open quantum systems is central to modeling noisy quantum hardware and many-body dynamics. In trajectory-based tensor network methods, cost is often associated with trajectory-level quantities such as entanglement growth or bond dimension. However, the total cost of a fixed-accuracy simulation also depends on statistical sampling, and the interplay between per-trajectory complexity and sampling effort remains poorly understood. Here we introduce a cost-resolved framework for matrix product state (MPS)-based quantum trajectory simulations that decomposes total cost into memory per trajectory, runtime per trajectory, and sampling effort. We show that physically equivalent stochastic unravelings of the same Lindblad dynamics do not necessarily reduce total cost, but instead redistribute cost between trajectory complexity and statistical convergence. This trade-off is quantified by two dimensionless inflation factors: a bond dimension inflation $\alpha$ and a sampling inflation $\kappa$, which together determine the preferred unraveling under hardware-dependent memory and parallelism constraints. We provide a practical protocol for extracting $(\alpha,\kappa)$ from modest pilot simulations and demonstrate it using benchmarks across multiple noise channels. The resulting decision maps show that the computationally favorable unraveling can change with noise strength, time-step resolution, system size, and available parallelism. These results establish unraveling choice as a hardware-aware simulation design problem rather than an intrinsic optimization of trajectory entanglement alone. Comments: Subjects: Quantum Physics (quant-ph); Computational Physics (physics.comp-ph) Cite as: arXiv:2606.13779 [quant-ph] (or arXiv:2606.13779v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2606.13779 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Aaron Sander [view email] [v1] Thu, 11 Jun 2026 18:00:02 UTC (680 KB) Full-text links: Access Paper: View a PDF of the paper titled Computational regimes in matrix-product-state-based quantum trajectory simulations, by Aaron Sander and 6 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-06 Change to browse by: physics physics.comp-ph 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?)
