aiqbench analysis
This paper introduces a deterministic polynomial chaos Galerkin method to efficiently simulate non-Markovian quantum state diffusion, addressing long-standing challenges in open quantum system modeling. By replacing stochastic trajectory ensembles with a single deterministic solve, the approach significantly reduces computational costs while eliminating sampling errors for complex dynamics like diffraction and interference.
A deterministic polynomial chaos Galerkin method for non-Markovian quantum state diffusion
arXiv:2610.12070v1 Announce Type: new Abstract: Developing general-purpose numerical methods for non-Markovian quantum state diffusion has long been a challenge in the simulation of open quantum systems. This paper proposes a deterministic polynomial chaos Galerkin method, which is easy to implement, accurate, and efficient. By combining a low-rank decomposition of bath correlations with Galerkin projection onto a polynomial chaos basis, the method yields a deterministic formulation compatible with standard numerical solvers for partial differential equations. The reduced density matrix is obtained from a single deterministic solve at a cost comparable to that of computing one stochastic hierarchy trajectory. Replacing an ensemble of $N_{\mathrm{traj}}$ trajectories therefore reduces the computational cost by approximately a factor of $N_{\mathrm{traj}}$ and eliminates statistical sampling error. Benchmark comparisons show that the proposed method achieves smaller errors at lower computational cost than the tested stochastic hierarchy methods. Applications involving nonquadratic potentials, diffraction and interference, and coupled three-dimensional dynamics demonstrate its ability to handle challenging problems.
Abstract:Developing general-purpose numerical methods for non-Markovian quantum state diffusion has long been a challenge in the simulation of open quantum systems. This paper proposes a deterministic polynomial chaos Galerkin method, which is easy to implement, accurate, and efficient. By combining a low-rank decomposition of bath correlations with Galerkin projection onto a polynomial chaos basis, the method yields a deterministic formulation compatible with standard numerical solvers for partial differential equations. The reduced density matrix is obtained from a single deterministic solve at a cost comparable to that of computing one stochastic hierarchy trajectory. Replacing an ensemble of $N_{\mathrm{traj}}$ trajectories therefore reduces the computational cost by approximately a factor of $N_{\mathrm{traj}}$ and eliminates statistical sampling error. Benchmark comparisons show that the proposed method achieves smaller errors at lower computational cost than the tested stochastic hierarchy methods. Applications involving nonquadratic potentials, diffraction and interference, and coupled three-dimensional dynamics demonstrate its ability to handle challenging problems.
arXiv:2610.12070 [quant-ph]
(or arXiv:2610.12070v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.12070 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
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.
Full text under the publisher's open licence · 243 words
Related coverage

Universal Dilation of Linear Itô SDEs: Quantum Trajectories and Lindblad Simulation of Second Moments
Quantum Journal · Oct 1, 2026

Faster Quantum Simulation Of Markovian Open Quantum Systems Via Randomisation
Quantum Journal · Sep 3, 2026

Researchers Steer Quantum States Using Engineered Loss
Quantum Zeitgeist · Aug 24, 2026

Researchers Simulate Systems with Memory Using Quantum Algorithms
Quantum Zeitgeist · Aug 17, 2026