Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2303.09430 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
Sommario:
- This work presents a comparative study of new and existing optimization and diagonalization methods for solving time-independent partial differential equations (PDEs) using matrix product states (MPS) in the quantized tensor-train formalism (QTT). This study focuses on Hamiltonian equations, for which five algorithms are introduced: explicit imaginary-time evolution methods, steepest gradient descent in conventional and optimized forms, a power method, and an explicitly restarted Arnoldi method. The first five methods are engineered using a framework of limited-precision linear algebra, in which operators -- i.e., the equation itself -- and vectors are represented using matrix product operator (MPO) and matrix product state (MPS) formalisms, and where operator-vector multiplication and vector addition are approximated with limited resources. All methods are benchmarked using an exactly solvable PDE for a quantum harmonic oscillator in one and two dimensions over a regular grid with up to $2^{30}$ points and compared with the density matrix renormalization group (DMRG) method. Our study reveals that all MPS-based techniques exponentially outperform exact diagonalization techniques based on vectors regarding memory usage. Imaginary-time algorithms are shown to underperform any gradient descent in terms of calibration needs and costs. Finally, MPS DMRG and interpolated Arnoldi-like asymptotically outperform all other methods, including state-of-the-art vector-based exact diagonalization, with significant advantages in time and memory use.