Optimal Symbolic Construction of Matrix Product Operators and Tree Tensor Network Operators
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916823476207616 |
|---|---|
| author | Çakır, Hazar Milbradt, Richard M. Mendl, Christian B. |
| author_facet | Çakır, Hazar Milbradt, Richard M. Mendl, Christian B. |
| contents | This research introduces an improved framework for constructing matrix product operators (MPOs) and tree tensor network operators (TTNOs), crucial tools in quantum simulations. A given (Hamiltonian) operator typically has a known symbolic "sum of operator strings" form that can be translated into a tensor network structure. Combining the existing bipartite-graph-based approach and a newly introduced symbolic Gaussian elimination preprocessing step, our proposed method improves upon earlier algorithms in cases when Hamiltonian terms share the same prefactors. We test the performance of our method against established ones for benchmarking purposes. Finally, we apply our methodology to the model of a cavity filled with molecules in a solvent. This open quantum system is cast into the hierarchical equation of motion (HEOM) setting to obtain an effective Hamiltonian. Construction of the corresponding TTNO demonstrates a sub-linear increase of the maximum bond dimension. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_18630 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Optimal Symbolic Construction of Matrix Product Operators and Tree Tensor Network Operators Çakır, Hazar Milbradt, Richard M. Mendl, Christian B. Quantum Physics Strongly Correlated Electrons Chemical Physics This research introduces an improved framework for constructing matrix product operators (MPOs) and tree tensor network operators (TTNOs), crucial tools in quantum simulations. A given (Hamiltonian) operator typically has a known symbolic "sum of operator strings" form that can be translated into a tensor network structure. Combining the existing bipartite-graph-based approach and a newly introduced symbolic Gaussian elimination preprocessing step, our proposed method improves upon earlier algorithms in cases when Hamiltonian terms share the same prefactors. We test the performance of our method against established ones for benchmarking purposes. Finally, we apply our methodology to the model of a cavity filled with molecules in a solvent. This open quantum system is cast into the hierarchical equation of motion (HEOM) setting to obtain an effective Hamiltonian. Construction of the corresponding TTNO demonstrates a sub-linear increase of the maximum bond dimension. |
| title | Optimal Symbolic Construction of Matrix Product Operators and Tree Tensor Network Operators |
| topic | Quantum Physics Strongly Correlated Electrons Chemical Physics |
| url | https://arxiv.org/abs/2502.18630 |