Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Is the time-dependent variational principle really adapted for independent moving Gaussians?

Loïc Joubert-Doriol

Published Apr 13, 2021• 0 citations
OpenAlex

Related papers

Time dependent variational principle description of the motion of a gaussian wave packet

Marcus A. M. de Aguiar, Coraci Pereira Malta

•Jan 1, 1985•0 citations

Gaussian Time-Dependent Variational Principle for Bosons

Arthur K. Kerman, Paolo Tommasini

arXiv:cond-mat/9707315•Annals of Physics•Nov 1, 1997•11 citations

A variational approach for linearly dependent moving basis in quantum dynamics: application to Gaussian functions

Loïc Joubert-Doriol

•Jul 11, 2022•0 citations

A comment on time-dependent variational-principles

P.‐G. Reinhard

The European Physical Journal A•Sep 1, 1977•8 citations

Dynamical Simulations of Schrödinger's Equation via Rank-Adaptive Tensor Decompositions

N. Anders Petersson, Chase Hodges-Heilmann, Stefanie Günther

We study low-rank tensor methods for the numerical solution of Schrödinger's equation with time-independent and explicitly time-dependent Hamiltonians, motivated by large-scale simulations of many-body quantum systems and quantum computing devices subject to time-dependent control pulses. We outline the recent application of the "basis update and Galerkin" (BUG) method for tensor trains, and describe the established TDVP and TDVP-2 algorithms based on the time-dependent variational principle. For comparison, we also consider the BUG method in the Tucker format. All these approaches enable memory efficient representations of partially entangled quantum states and thereby mitigate the exponential cost of conventional state-vector formulations. The rank-adaptivity relies on the truncated singular value decomposition, in which the rank of a matrix is reduced by setting its smallest singular values to zero, based on a threshold parameter that controls the truncation error. Numerical experiments on representative time-independent and time-dependent Hamiltonian models quantify the tradeoff between accuracy and compression across methods, with particular attention to the interplay between the time-step and the truncation threshold, and how the computational effort scales with the number of sub-systems in the quantum system.

quant-pharXiv:2603.13990•Mar 17, 2026•2 citations

Time-dependent variational principle with constraints

Katsuhisa Ohta

Chemical Physics Letters•Oct 1, 2000•13 citations
We study low-rank tensor methods for the numerical solution of Schrödinger's equation with time-independent and explicitly time-dependent Hamiltonians, motivated by large-scale simulations of many-body quantum systems and quantum computing devices subject to time-dependent control pulses. We outline the recent application of the "basis update and Galerkin" (BUG) method for tensor trains, and describe the established TDVP and TDVP-2 algorithms based on the time-dependent variational principle. For comparison, we also consider the BUG method in the Tucker format. All these approaches enable memory efficient representations of partially entangled quantum states and thereby mitigate the exponential cost of conventional state-vector formulations. The rank-adaptivity relies on the truncated singular value decomposition, in which the rank of a matrix is reduced by setting its smallest singular values to zero, based on a threshold parameter that controls the truncation error. Numerical experiments on representative time-independent and time-dependent Hamiltonian models quantify the tradeoff between accuracy and compression across methods, with particular attention to the interplay between the time-step and the truncation threshold, and how the computational effort scales with the number of sub-systems in the quantum system.