Back to News
quantum-computing

Noisy quantum circuit simulation with the tensor jump method

Maximilian Fr\"ohlich, Aaron Sander, Martin Eigel, Robert Wille, Michael Hinterm\"uller
Loading...
4 min read
0 likes
⚡ Quantum Brief
--> Quantum Physics arXiv:2607.01323 (quant-ph) [Submitted on 1 Jul 2026] Title:Noisy quantum circuit simulation with the tensor jump method Authors:Maximilian Fröhlich, Aaron Sander, Martin Eigel, Robert Wille, Michael Hintermüller View a PDF of the paper titled Noisy quantum circuit simulation with the tensor jump method, by Maximilian Fr\"ohlich and 3 other authors View PDF HTML (experimental) Abstract:Classical simulation of noisy quantum circuits is essential for validating algorithms, benchmarking hardware, and assessing error-mitigation strategies, but remains limited by the exponential cost of density-matrix methods and the high variance of standard trajectory sampling.
AI Audio Summary
0:00 / 0:00
Click to play
Untitled design (24).png
Quantum News · Media Library

Quantum Physics arXiv:2607.01323 (quant-ph) [Submitted on 1 Jul 2026] Title:Noisy quantum circuit simulation with the tensor jump method Authors:Maximilian Fröhlich, Aaron Sander, Martin Eigel, Robert Wille, Michael Hintermüller View a PDF of the paper titled Noisy quantum circuit simulation with the tensor jump method, by Maximilian Fr\"ohlich and 3 other authors View PDF HTML (experimental) Abstract:Classical simulation of noisy quantum circuits is essential for validating algorithms, benchmarking hardware, and assessing error-mitigation strategies, but remains limited by the exponential cost of density-matrix methods and the high variance of standard trajectory sampling. We introduce a variance-aware tensor network framework that combines the tensor jump method with local TDVP gate evolution on matrix product states and sparse Pauli-Lindblad hardware noise models. Gates are applied as short variational evolutions on the MPS manifold, while noise is sampled per circuit window from Pauli-Lindblad jump sets with state-independent hazards and dissipative contractions that reduce to irrelevant global factors after renormalization. The method supports correlated multi-qubit Lindblad noise consistent with hardware connectivity, including long-range operators on non-adjacent qubits, enabling direct simulation of crosstalk and other connectivity-induced errors beyond local noise models. We develop two unbiased variance-aware unravelings. An analog unitary-mixture unraveling matches the Lindblad generator exactly under symmetric Gaussian or two-point angle laws, while a projector-jump unraveling yields state-independent hazards and closed-form variance laws. Both retain the standard 1/sqrt(N) Monte Carlo convergence but with reduced prefactors. Empirically, projector sampling strongly reduces trajectory variance and bond-dimension growth across many circuit architectures, whereas analog sampling is most effective at weak noise. We demonstrate accurate, scalable noisy-circuit simulation on a 25-qubit noisy XY quench and IBM's 127-qubit kicked-Ising benchmark with long-range depolarizing noise, achieving reduced Monte Carlo variance and favorable MPS bond-dimension growth compared with standard Kraus-insertion baselines. Comments: Subjects: Quantum Physics (quant-ph) MSC classes: 81-08, 65C05, 81P68, 15A69 Cite as: arXiv:2607.01323 [quant-ph] (or arXiv:2607.01323v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2607.01323 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Maximilian Froehlich [view email] [v1] Wed, 1 Jul 2026 18:00:01 UTC (2,110 KB) Full-text links: Access Paper: View a PDF of the paper titled Noisy quantum circuit simulation with the tensor jump method, by Maximilian Fr\"ohlich and 3 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-07 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-finance
quantum-algorithms
quantum-hardware

Source Information

Source: arXiv Quantum Physics

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.