Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 154 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 36 tok/s Pro
GPT-5 High 33 tok/s Pro
GPT-4o 70 tok/s Pro
Kimi K2 184 tok/s Pro
GPT OSS 120B 437 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Low-complexity approximations with least-squares formulation of the time-dependent Schr{ö}dinger equation (2509.13005v1)

Published 16 Sep 2025 in math.AP

Abstract: We propose new methods designed to numerically approximate the solution to the time dependent Schr{\"o}dinger equation, based on two types of ansatz: tensors, and approximation by a linear combination of gaussian wave packets. In both cases, the method can be seen as a restricted optimization problem, which can be solved by adapting either the Alternating Least Square algorithm in the tensor case, or some greedy algorithm in the gaussian wavepacket case. We also discuss the efficiency of both approaches.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.