Quantics Tensor Train for solving Gross-Pitaevskii equation
read the original abstract
We present a quantum-inspired solver for the one-dimensional Gross-Pitaevskii equation in the Quantics Tensor-Train (QTT) representation. By evolving the system entirely within a low-rank tensor manifold, the method sidesteps the memory and runtime barriers that limit conventional finite-difference and spectral schemes. Two complementary algorithms are developed: an imaginary-time projector that drives the condensate toward its variational ground state and a rank-adapted fourth-order Runge-Kutta integrator for real-time dynamics. The framework captures a broad range of physical scenarios - including barrier-confined condensates, quasi-random potentials, long-range dipolar interactions, and multicomponent spinor dynamics - without leaving the compressed representation. Relative to standard discretizations, the QTT approach achieves an exponential reduction in computational resources while retaining quantitative accuracy, thereby extending the practicable regime of Gross-Pitaevskii simulations on classical hardware. These results position tensor networks as a practical bridge between high-performance classical computing and prospective quantum hardware for the numerical treatment of nonlinear Schrodinger-type partial differential equations.
This paper has not been read by Pith yet.
Forward citations
Cited by 5 Pith papers
-
Fast elementwise operations on tensor trains with alternating cross interpolation
Alternating cross interpolation performs elementwise operations on tensor trains in O(χ³) time with error control, improving on the standard O(χ⁴) scaling when output ranks are controlled.
-
Adaptive Patching for Tensor Train Computations
An adaptive patching method exploits block-sparse QTT structures to reduce computational costs for tensor contractions and enables efficient evaluation of bubble diagrams and Bethe-Salpeter equations.
-
Tensor network approach to momentum-resolved spectroscopy in non-periodic super-moir\'e systems
A tensor network algorithm computes momentum-resolved spectral functions for large non-periodic super-moiré systems by mapping tight-binding problems to solvable quantum many-body simulations using kernel polynomial m...
-
Tailoring tensor network techniques to the quantics representation for highly inhomogeneous problems and few body problems
Tailoring tensor network algorithms to the scale hierarchy in quantics representation produces faster, more robust solvers for high-dimensional linear and eigenvalue PDE problems.
-
Tensor network method for real-space topology in quasicrystal Chern mosaics
Tensor-network representation of the density matrix via Chebyshev algorithm computes real-space topological markers in C8 and C10 quasicrystals and Chern mosaics at scales of hundreds of millions of sites.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.