Rank-adaptive tensor decompositions enable memory-efficient dynamical simulations of Schrödinger's equation by compressing partially entangled quantum states while controlling truncation error via SVD thresholds.
A parallel basis update and Galerkin integrator for tree tensor networks.SIAM Journal on Scientific Computing, 48(1):A27–A48
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Dynamical Simulations of Schr\"odinger's Equation via Rank-Adaptive Tensor Decompositions
Rank-adaptive tensor decompositions enable memory-efficient dynamical simulations of Schrödinger's equation by compressing partially entangled quantum states while controlling truncation error via SVD thresholds.