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

arXiv:2609.37103

Riemannian optimization on low-rank tensor train manifolds for the Gross-Pitaevskii equation

Ivan Bioli, Carlo Marcati, Maxim Rakhuba

Published Sep 29, 2026• 0 citations
arXivHTMLPDF

Abstract

This work is concerned with the numerical computation of Gross-Pitaevskii ground states using the tensor train (TT) format. We regard the problem as the minimization of the Gross-Pitaevskii energy functional under a unit mass constraint, and propose a first-order Riemannian optimization scheme that preserves both the mass constraint and the low-rank representation throughout the optimization, by operating on the manifold of unit-norm functions of fixed TT-rank. On this manifold, we derive the energy-adaptive Riemannian gradient and show how to compute it efficiently in the TT format. Spatial discretization is performed using a spectral method with numerical integration, which allows the required computations to be carried out efficiently while preserving the low-rank format. The method is shown to substantially reduce computational time compared to full-rank computations, while maintaining accuracy for both single- and multicomponent Gross-Pitaevskii equations.

DOI
10.48550/arxiv.2609.37103

Related papers

Quantics Tensor Train for solving Gross-Pitaevskii equation

Aleix Bou-Comas, Marcin Płodzień, Luca Tagliacozzo +1 more

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.

arXiv:2507.03134•Jul 3, 2025•14 citations

Normalized tensor train decomposition

Renfeng Peng, Chengkai Zhu, Bin Gao +2 more

Tensors with unit Frobenius norm are fundamental objects in many fields, including scientific computing and quantum physics, which are able to represent normalized eigenvectors and pure quantum states. While the tensor train decomposition provides a powerful low-rank format for tackling high-dimensional problems, it does not intrinsically enforce the unit-norm constraint. To address this, we introduce the normalized tensor train (NTT) decomposition, which aims to approximate a tensor by unit-norm tensors in tensor train format. The low-rank structure of NTT decomposition not only saves storage and computational cost but also preserves the underlying unit-norm structure. We prove that the set of fixed-rank NTT tensors forms a smooth manifold, and the corresponding Riemannian geometry is derived, paving the way for geometric methods. We propose NTT-based methods for low-rank tensor recovery, high-dimensional eigenvalue problem, estimation of stabilizer rank, and calculation of the minimum output Rényi 2-entropy of quantum channels. Numerical experiments demonstrate the superior efficiency and scalability of the proposed NTT-based methods.

math.NACross-listedarXiv:2511.04369•Nov 7, 2025•3 citations

Qualitative and Quantitative Analysis of Riemannian Optimization Methods for Ground States of Rotating Multicomponent Bose-Einstein Condensates

Hermann, Martin, Tatjana Stykel, Mahima Yadav

We develop and analyze Riemannian optimization methods for computing ground states of rotating multicomponent Bose-Einstein condensates, defined as minimizers of the Gross-Pitaevskii energy functional. To resolve the non-uniqueness of ground states induced by phase invariance, we work on a quotient manifold endowed with a general Riemannian metric. By introducing an auxiliary phase-aligned iteration and employing fixed-point convergence theory, we establish a unified local convergence framework for Riemannian gradient descent methods and derive explicit convergence rates. Specializing this framework to two metrics tailored to the energy landscape, we study the energy-adaptive and Lagrangian-based Riemannian gradient descent methods. While monotone energy decay and global convergence are established only for the former, a quantified local convergence analysis is provided for both methods. Numerical experiments confirm the theoretical results and demonstrate that the Lagrangian-based method, which incorporates second-order information on the energy functional and mass constraints, achieves faster local convergence than the energy-adaptive scheme.

arXiv:2512.05939•Dec 5, 2025•3 citations

A Preconditioned Riemannian Conjugate Gradient Method to Compute Ground States of Spin-1 Bose–Einstein Condensates

Wen Tao Huang, Zilin Yang, Qinglin Tang

Abstract. In this paper, we propose a preconditioned Riemannian conjugate gradient method for computing ground states of spin-1 Bose-Einstein condensates, which can be reformulated as an optimization problem with the mass and magnetization constraints. The energy functional and constraints can be discretized using Fourier pseudospectral schemes, thereby transforming the problem into an optimization task on a manifold. We derive vector transports by differentiating three existing retractions and propose an initial step size selection strategy based on the second-order approximation of the energy function for the proposed Riemannian optimization algorithm. In addition, a preconditioner is derived and used. To further accelerate the convergence, we combine the proposed algorithm with a multigrid method. Numerical experiments demonstrate the efficiency and accuracy of the proposed method while confirming the usefulness of our preconditioning technique and the effectiveness of the proposed strategy for initial step size selection.

SIAM Journal on Scientific Computing•Apr 1, 2026•0 citations

Riemannian optimization methods for ground states of multicomponent Bose–Einstein condensates

Robert Altmann, Martin Hermann, Daniel Peterseim +1 more

Abstract This paper addresses the computation of ground states of multicomponent Bose–Einstein condensates, defined as the global minimizer of an energy functional on an infinite-dimensional generalised oblique manifold. We establish the existence of the ground state, prove its uniqueness up to scaling and characterize it as the solution to a coupled nonlinear eigenvector problem. By equipping the manifold with several Riemannian metrics, we introduce a suite of Riemannian gradient descent and Riemannian Newton methods. Metrics that incorporate first- or second-order information about the energy are particularly advantageous, effectively preconditioning the resulting methods. For a Riemannian gradient descent method with an energy-adaptive metric, we provide a qualitative global and quantitative local convergence analysis, confirming its reliability and robustness with respect to the choice of the spatial discretization. Numerical experiments highlight the computational efficiency of both the Riemannian gradient descent and Newton methods.

arXiv:2411.09617•IMA Journal of Numerical Analysis•Apr 17, 2025•6 citations

Solving the Gross-Pitaevskii equation with quantic tensor trains: Ground states and nonlinear dynamics

Qian-Can Chen, I-Kang Liu, Jheng-Wei Li +1 more

We develop a tensor network framework based on the quantic tensor train (QTT) format to efficiently solve the Gross-Pitaevskii equation (GPE), which governs Bose-Einstein condensates under mean-field theory. For sufficiently regular functions, the QTT approach enables exponentially fine grids with computational cost that grows only linearly. By adapting the time-dependent variational principle (TDVP) and gradient descent methods, we accurately handle the GPE’s nonlinearities within the QTT structure. Our approach enables high-resolution simulations with drastically reduced computational cost on highly refined grids. We benchmark the ground states and dynamics of BECs, including vortex lattice formation and breathing modes, demonstrating superior performance over regular-grid-based methods and stable long-time evolution due to saturating bond dimensions. This establishes QTT as a powerful tool for nonlinear quantum simulations.

arXiv:2507.04279•SciPost Physics•Aug 10, 2026•14 citations
This work is concerned with the numerical computation of Gross-Pitaevskii ground states using the tensor train (TT) format. We regard the problem as the minimization of the Gross-Pitaevskii energy functional under a unit mass constraint, and propose a first-order Riemannian optimization scheme that preserves both the mass constraint and the low-rank representation throughout the optimization, by operating on the manifold of unit-norm functions of fixed TT-rank. On this manifold, we derive the energy-adaptive Riemannian gradient and show how to compute it efficiently in the TT format. Spatial discretization is performed using a spectral method with numerical integration, which allows the required computations to be carried out efficiently while preserving the low-rank format. The method is shown to substantially reduce computational time compared to full-rank computations, while maintaining accuracy for both single- and multicomponent Gross-Pitaevskii equations.
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.
Tensors with unit Frobenius norm are fundamental objects in many fields, including scientific computing and quantum physics, which are able to represent normalized eigenvectors and pure quantum states. While the tensor train decomposition provides a powerful low-rank format for tackling high-dimensional problems, it does not intrinsically enforce the unit-norm constraint. To address this, we introduce the normalized tensor train (NTT) decomposition, which aims to approximate a tensor by unit-norm tensors in tensor train format. The low-rank structure of NTT decomposition not only saves storage and computational cost but also preserves the underlying unit-norm structure. We prove that the set of fixed-rank NTT tensors forms a smooth manifold, and the corresponding Riemannian geometry is derived, paving the way for geometric methods. We propose NTT-based methods for low-rank tensor recovery, high-dimensional eigenvalue problem, estimation of stabilizer rank, and calculation of the minimum output Rényi 2-entropy of quantum channels. Numerical experiments demonstrate the superior efficiency and scalability of the proposed NTT-based methods.
We develop and analyze Riemannian optimization methods for computing ground states of rotating multicomponent Bose-Einstein condensates, defined as minimizers of the Gross-Pitaevskii energy functional. To resolve the non-uniqueness of ground states induced by phase invariance, we work on a quotient manifold endowed with a general Riemannian metric. By introducing an auxiliary phase-aligned iteration and employing fixed-point convergence theory, we establish a unified local convergence framework for Riemannian gradient descent methods and derive explicit convergence rates. Specializing this framework to two metrics tailored to the energy landscape, we study the energy-adaptive and Lagrangian-based Riemannian gradient descent methods. While monotone energy decay and global convergence are established only for the former, a quantified local convergence analysis is provided for both methods. Numerical experiments confirm the theoretical results and demonstrate that the Lagrangian-based method, which incorporates second-order information on the energy functional and mass constraints, achieves faster local convergence than the energy-adaptive scheme.
Abstract. In this paper, we propose a preconditioned Riemannian conjugate gradient method for computing ground states of spin-1 Bose-Einstein condensates, which can be reformulated as an optimization problem with the mass and magnetization constraints. The energy functional and constraints can be discretized using Fourier pseudospectral schemes, thereby transforming the problem into an optimization task on a manifold. We derive vector transports by differentiating three existing retractions and propose an initial step size selection strategy based on the second-order approximation of the energy function for the proposed Riemannian optimization algorithm. In addition, a preconditioner is derived and used. To further accelerate the convergence, we combine the proposed algorithm with a multigrid method. Numerical experiments demonstrate the efficiency and accuracy of the proposed method while confirming the usefulness of our preconditioning technique and the effectiveness of the proposed strategy for initial step size selection.
Abstract This paper addresses the computation of ground states of multicomponent Bose–Einstein condensates, defined as the global minimizer of an energy functional on an infinite-dimensional generalised oblique manifold. We establish the existence of the ground state, prove its uniqueness up to scaling and characterize it as the solution to a coupled nonlinear eigenvector problem. By equipping the manifold with several Riemannian metrics, we introduce a suite of Riemannian gradient descent and Riemannian Newton methods. Metrics that incorporate first- or second-order information about the energy are particularly advantageous, effectively preconditioning the resulting methods. For a Riemannian gradient descent method with an energy-adaptive metric, we provide a qualitative global and quantitative local convergence analysis, confirming its reliability and robustness with respect to the choice of the spatial discretization. Numerical experiments highlight the computational efficiency of both the Riemannian gradient descent and Newton methods.
We develop a tensor network framework based on the quantic tensor train (QTT) format to efficiently solve the Gross-Pitaevskii equation (GPE), which governs Bose-Einstein condensates under mean-field theory. For sufficiently regular functions, the QTT approach enables exponentially fine grids with computational cost that grows only linearly. By adapting the time-dependent variational principle (TDVP) and gradient descent methods, we accurately handle the GPE’s nonlinearities within the QTT structure. Our approach enables high-resolution simulations with drastically reduced computational cost on highly refined grids. We benchmark the ground states and dynamics of BECs, including vortex lattice formation and breathing modes, demonstrating superior performance over regular-grid-based methods and stable long-time evolution due to saturating bond dimensions. This establishes QTT as a powerful tool for nonlinear quantum simulations.