Arbitrary High Order Low-rank Completely Positive and Trace Preserving (CPTP) Schemes for Lindblad Equations with Time-dependent Hamiltonian
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911266728050688 |
|---|---|
| author | Hu, Jiuhua Appelo, Daniel Cheng, Yingda |
| author_facet | Hu, Jiuhua Appelo, Daniel Cheng, Yingda |
| contents | In this paper, we develop a framework for designing arbitrary high order low-rank schemes for the Lindblad equation with time-dependent Hamiltonians. Our approach is based on nested Picard iterative integrators (NPI) and results in schemes in Kraus form that are completely positive and trace preserving (CPTP). The schemes are amenable to low rank formulations, making them suitable for problems where the matrix rank of the density matrix is small. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_12012 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Arbitrary High Order Low-rank Completely Positive and Trace Preserving (CPTP) Schemes for Lindblad Equations with Time-dependent Hamiltonian Hu, Jiuhua Appelo, Daniel Cheng, Yingda Numerical Analysis Quantum Physics In this paper, we develop a framework for designing arbitrary high order low-rank schemes for the Lindblad equation with time-dependent Hamiltonians. Our approach is based on nested Picard iterative integrators (NPI) and results in schemes in Kraus form that are completely positive and trace preserving (CPTP). The schemes are amenable to low rank formulations, making them suitable for problems where the matrix rank of the density matrix is small. |
| title | Arbitrary High Order Low-rank Completely Positive and Trace Preserving (CPTP) Schemes for Lindblad Equations with Time-dependent Hamiltonian |
| topic | Numerical Analysis Quantum Physics |
| url | https://arxiv.org/abs/2511.12012 |