Metraipolis › archive › dc_f9cd48eb0227

A deterministic polynomial chaos Galerkin method for non-Markovian quantum state diffusion — arXiv:2610.12070

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.12070
License (as archived)
CC0-1.0
Archived
2026-10-09T06:39:14.146Z
SHA-256 of the archived text
8f53abd6cb959b7c165d109cc73dd93e0003957eadaecb7194c012bfc0111388
Stable URL of this page
https://metraipolis.com/documento/dc_f9cd48eb0227

How to cite

A deterministic polynomial chaos Galerkin method for non-Markovian quantum state diffusion — arXiv:2610.12070 — arXiv (en), https://arxiv.org/abs/2610.12070 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f9cd48eb0227 (Metraipolis archive dc_f9cd48eb0227, sha256 8f53abd6cb959b7c165d109cc73dd93e0003957eadaecb7194c012bfc0111388)
BibTeX
@misc{dcf9cd48eb0227,
  title = {A deterministic polynomial chaos Galerkin method for non-Markovian quantum state diffusion — arXiv:2610.12070},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.12070},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f9cd48eb0227; sha256 8f53abd6cb959b7c165d109cc73dd93e0003957eadaecb7194c012bfc0111388},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.12070. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.12070 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T05:58:46.996Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).