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:2507.04262 · Physical Review Research

Solving the Gross-Pitaevskii equation on multiple different scales using the quantics tensor train representation

Marcel Niedermeier, Adrien Moulinas, Thibaud Louvet, José Luis Lado, Xavier Waintal

Published Feb 14, 2026• 14 citations
arXivHTMLPDF

Abstract

Solving partial differential equations across multiple length scales represents a formidable challenge where reaching high precision can require a prohibitive amount of computer memory or computing time. However, the solutions to physics problems typically have structures operating on different length scales, and as a result exhibit a high degree of compressibility. Here, we use the quantics tensor train representation to build a tensor network solver for the time-dependent Gross-Pitaevskii equation. We demonstrate that the quantics approach generalizes well to the presence of the nonlinear term in the equation. We show that we can resolve phenomena across length scales separated by seven orders of magnitude in one dimension within one hour on a single core in a laptop, greatly surpassing the capabilities of more naive methods. We illustrate our methodology with various modulated optical trap potentials presenting features at vastly different length scales, including solutions to the Gross-Pitaevskii equation on two-dimensional grids above a trillion points ( 2 20 × 2 20 ). This quantum-inspired methodology can be readily extended to other partial differential equations combining spatial and temporal evolutions, providing a powerful method to solve highly featured differential equations at unprecedented length scales.

DOI
10.1103/zwn1-f981

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

Fast and Flexible Quantum-Inspired Differential Equation Solvers with Data Integration

Lucas Silva Arenstein, Mikkelsen Martin, Michael J. Kastoryano

Accurately solving high-dimensional partial differential equations (PDEs) remains a central challenge in computational mathematics. Traditional numerical methods, while effective in low-dimensional settings or on coarse grids, often struggle to deliver the precision required in practical applications. Recent machine learning-based approaches offer flexibility but frequently fall short in terms of accuracy and reliability, particularly in industrial contexts. In this work, we explore a quantum-inspired method based on quantized tensor trains (QTT), enabling efficient and accurate solutions to PDEs in a variety of challenging scenarios. Through several representative examples, we show that the QTT approach can achieve logarithmic scaling in memory and computational cost for linear PDEs when the relevant QTT ranks remain moderate. We also develop QTT space-time formulations that treat time as an additional dimension, allowing the full temporal evolution to be represented and solved globally rather than through sequential time stepping. For the nonlinear Burgers equation, we study both time-stepping and a frozen-coefficient space-time Picard scheme in QTT form, and report empirical convergence behavior on smooth one-dimensional viscous test problems. Additionally, we present a proof-of-concept data-driven workflow within the quantum-inspired framework, in which sampled source data are interpolated into QTT form and then incorporated directly into the structured PDE solver.

arXiv:2505.17046•Mathematics•Jun 10, 2026•13 citations

Tailoring tensor network techniques to the quantics representation for highly inhomogeneous problems and few body problems

Jheng-Wei Li, Nicolas Jolly, Xavier Waintal

Tensor network techniques are becoming increasingly popular tools to solve partial differential equations within the so-called quantics representation. Their popularity stems from the fact that their spatial resolution depends only logarithmically on the number of grid points, making them very tempting approaches in situations where two or more characteristic length scales are vastly different. A first generation of technique used ``out-of-the-box'' algorithms of the tensor network toolkit (e.g. the celebrated Density Matrix Product State (DMRG) algorithm) to solve these problems. These techniques were designed for situations (e.g. quantum magnetism) where the different degrees of freedom (e.g. spins) play equivalent roles. In the quantics representation, however, the different degrees of freedom correspond to the physics at different scales and therefore play inequivalent role. Here we show that by tailoring the tensor network algorithms to this particular case, in the spirit of the multigrid approach, we obtain faster and more robust convergence of the algorithms. We showcase the approach on linear (Poisson equation) and eigenvalue (Schrödinger equation) problems in two, three and four dimensions. Our simulations involve up to $2^{80}$ grid points and would represent, we argue, a very strong challenge for conventional approaches.

quant-pharXiv:2604.09337•Apr 13, 2026•1 citation

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

© Q.-C. Chen et al. 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.

•Aug 10, 2026•0 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

Multiscale Space-Time Ansatz for Correlation Functions of Quantum Systems Based on Quantics Tensor Trains

Hiroshi Shinaoka, Markus Wallerberger, Yuta Murakami +4 more

The correlation functions of quantum systems-central objects in quantum field theories-are defined in high-dimensional space-time domains.Their numerical treatment thus suffers from the curse of dimensionality, which hinders the application of sophisticated many-body theories to interesting problems.Here, we propose a multiscale space-time ansatz for correlation functions of quantum systems based on quantics tensor trains (QTTs), "qubits" describing exponentially different length scales.The ansatz then assumes a separation of length scales by decomposing the resulting high-dimensional tensors into tensor trains (also known as matrix product states).We numerically verify the ansatz for various equilibrium and nonequilibrium systems and demonstrate compression ratios of several orders of magnitude for challenging cases.Essential building blocks of diagrammatic equations, such as convolutions or Fourier transforms, are formulated in the compressed form.We numerically demonstrate the stability and efficiency of the proposed methods for the Dyson and Bethe-Salpeter equations.The QTT representation provides a unified framework for implementing efficient computations of quantum field theories.

arXiv:2210.12984•Physical Review X•Apr 27, 2023•76 citations
Solving partial differential equations across multiple length scales represents a formidable challenge where reaching high precision can require a prohibitive amount of computer memory or computing time. However, the solutions to physics problems typically have structures operating on different length scales, and as a result exhibit a high degree of compressibility. Here, we use the quantics tensor train representation to build a tensor network solver for the time-dependent Gross-Pitaevskii equation. We demonstrate that the quantics approach generalizes well to the presence of the nonlinear term in the equation. We show that we can resolve phenomena across length scales separated by seven orders of magnitude in one dimension within one hour on a single core in a laptop, greatly surpassing the capabilities of more naive methods. We illustrate our methodology with various modulated optical trap potentials presenting features at vastly different length scales, including solutions to the Gross-Pitaevskii equation on two-dimensional grids above a trillion points ( 2 20 × 2 20 ). This quantum-inspired methodology can be readily extended to other partial differential equations combining spatial and temporal evolutions, providing a powerful method to solve highly featured differential equations at unprecedented length scales.
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.
Accurately solving high-dimensional partial differential equations (PDEs) remains a central challenge in computational mathematics. Traditional numerical methods, while effective in low-dimensional settings or on coarse grids, often struggle to deliver the precision required in practical applications. Recent machine learning-based approaches offer flexibility but frequently fall short in terms of accuracy and reliability, particularly in industrial contexts. In this work, we explore a quantum-inspired method based on quantized tensor trains (QTT), enabling efficient and accurate solutions to PDEs in a variety of challenging scenarios. Through several representative examples, we show that the QTT approach can achieve logarithmic scaling in memory and computational cost for linear PDEs when the relevant QTT ranks remain moderate. We also develop QTT space-time formulations that treat time as an additional dimension, allowing the full temporal evolution to be represented and solved globally rather than through sequential time stepping. For the nonlinear Burgers equation, we study both time-stepping and a frozen-coefficient space-time Picard scheme in QTT form, and report empirical convergence behavior on smooth one-dimensional viscous test problems. Additionally, we present a proof-of-concept data-driven workflow within the quantum-inspired framework, in which sampled source data are interpolated into QTT form and then incorporated directly into the structured PDE solver.
Tensor network techniques are becoming increasingly popular tools to solve partial differential equations within the so-called quantics representation. Their popularity stems from the fact that their spatial resolution depends only logarithmically on the number of grid points, making them very tempting approaches in situations where two or more characteristic length scales are vastly different. A first generation of technique used ``out-of-the-box'' algorithms of the tensor network toolkit (e.g. the celebrated Density Matrix Product State (DMRG) algorithm) to solve these problems. These techniques were designed for situations (e.g. quantum magnetism) where the different degrees of freedom (e.g. spins) play equivalent roles. In the quantics representation, however, the different degrees of freedom correspond to the physics at different scales and therefore play inequivalent role. Here we show that by tailoring the tensor network algorithms to this particular case, in the spirit of the multigrid approach, we obtain faster and more robust convergence of the algorithms. We showcase the approach on linear (Poisson equation) and eigenvalue (Schrödinger equation) problems in two, three and four dimensions. Our simulations involve up to 2802^{80}280 grid points and would represent, we argue, a very strong challenge for conventional approaches.
© Q.-C. Chen et al. 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.
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.
The correlation functions of quantum systems-central objects in quantum field theories-are defined in high-dimensional space-time domains.Their numerical treatment thus suffers from the curse of dimensionality, which hinders the application of sophisticated many-body theories to interesting problems.Here, we propose a multiscale space-time ansatz for correlation functions of quantum systems based on quantics tensor trains (QTTs), "qubits" describing exponentially different length scales.The ansatz then assumes a separation of length scales by decomposing the resulting high-dimensional tensors into tensor trains (also known as matrix product states).We numerically verify the ansatz for various equilibrium and nonequilibrium systems and demonstrate compression ratios of several orders of magnitude for challenging cases.Essential building blocks of diagrammatic equations, such as convolutions or Fourier transforms, are formulated in the compressed form.We numerically demonstrate the stability and efficiency of the proposed methods for the Dyson and Bethe-Salpeter equations.The QTT representation provides a unified framework for implementing efficient computations of quantum field theories.