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

Low-Rank Approximability and Entropy Area Laws for PDEs

Mazen Ali

Published Apr 6, 2019• 0 citations
OpenAlex

Abstract

We show how local interactions in a partial differential equation (PDE) model lead to eigenfunctions with favorable low-rank properties. To this end, we utilize ideas from quantum entanglement of multi-particle spin systems. We begin by analyzing the connection between entropy area laws and low-rank approximability. The characterization for 1D chains such as Matrix Product States (MPS) / Tensor Trains (TT) is rather extensive though incomplete. We then show that a Nearest Neighbor Interaction (NNI) PDE operator has eigenfunctions that are approximately separable in a certain sense. Under a further assumption on the approximand, we show that this implies a constant entropy bound. To the best of our knowledge, the presented approach is the first systematic treatment of low-rank approximability for general PDEs. The assumptions are general enough to include a large class of models (in, e.g., quantum mechanics) and have a physical interpretation. The weak points are the aforementioned assumption on the approximand and that the validity is limited to MPS/TT formats.

Related papers

Low-Rank Approximability and Entropy Area Laws for Ground States of Unbounded Hamiltonians

Mazen Ali

We show how local bounded interactions in an unbounded Hamiltonian lead to eigenfunctions with favorable low-rank properties. To this end, we utilize ideas from quantum entanglement of multi-particle spin systems. We begin by analyzing the connection between entropy area laws and low-rank approximability. The characterization for 1D chains such as Matrix Product States (MPS) / Tensor Trains (TT) is rather extensive though incomplete. We then show that a Nearest Neighbor Interaction (NNI) Hamiltonian has eigenfunctions that are approximately separable in a certain sense. Under a further assumption on the approximand, we show that this implies a constant entropy bound. To the best of our knowledge, this work is the first analysis of low-rank approximability for unbounded Hamiltonians. Moreover, it extends previous results on entanglement entropy area laws to unbounded operators. The assumptions include a variety of self-adjoint operators and have a physical interpretation. The weak points are the aforementioned assumption on the approximand and that the validity is limited to MPS/TT formats.

arXiv:1904.03507•Apr 6, 2019•2 citations

On low-rank tensor train approximability for linear nearest neighbor systems

Patrick Gelß, Sebastian Matera, Reinhold Schneider +1 more

Low-rank tensor methods are an important tool in the numerical treatment of equations with a high-dimensional state space. Nearest neighbor interaction systems like the Ising model or more general Markov jump processes, as well as 1D finite-state quantum systems are examples of such problems. While low-rank tensor train/matrix product state models have been shown to be highly efficient for the simulation of such systems, providing theoretical justification for this remains a challenging task. One approach for obtaining estimates on required ranks for certain accuracies is to investigate the rank increase in Krylov subspace methods for solving the problem at hand. In the context of area laws for ground states of 1D spin systems, nontrivial results on rank-increasing properties of nearest neighbor operator polynomials have been obtained in work of Arad et al. [arXiv:1301.1162] by studying the partial commutativity of local operators. In the present work, this technique is applied to polynomial methods for definite linear equations and dissipative linear ODEs with nearest neighbor structure. This allows to derive corresponding low-rank approximability statements for solutions of such problems which are independent of the system size. Numerical simulations of high-dimensional nearest neighbor systems illustrate the theoretical findings.

arXiv:2607.06453•Jul 7, 2026•0 citations

An area law for one-dimensional quantum systems

M. B. Hastings

We prove an area law for the entanglement entropy in gapped one-dimensional quantum systems. The bound on the entropy grows surprisingly rapidly with the correlation length; we discuss this in terms of properties of quantum expanders and present a conjecture on matrix product states which may provide an alternate way of arriving at an area law. We also show that, for gapped, local systems, the bound on Von Neumann entropy implies a bound on Rényi entropy for sufficiently large α<1 and implies the ability to approximate the ground state by a matrix product state.

arXiv:0705.2024•Journal of Statistical Mechanics Theory and Experiment•Aug 20, 2007•1,263 citations

Entanglement Properties of Quantum Superpositions of Smooth, Differentiable Functions

Adam A. Holmes, A. Y. Matsuura

We present an entanglement analysis of quantum superpositions corresponding to smooth, differentiable, real-valued (SDR) univariate functions. SDR functions are shown to be scalably approximated by low-rank matrix product states, for large system discretizations. We show that the maximum von-Neumann bipartite entropy of these functions grows logarithmically with the system size. This implies that efficient low-rank approximations to these functions exist in a matrix product state (MPS) for large systems. As a corollary, we show an upper bound on trace-distance approximation accuracy for a rank-2 MPS as $Ω(\log N/N)$, implying that these low-rank approximations can scale accurately for large quantum systems.

arXiv:2009.09096•Sep 18, 2020•6 citations

Entanglement area law in interacting bosons from the Bose-Hubbard model to ϕ4 theory and beyond

Donghoon Kim, Tomotaka Kuwahara

The entanglement area law is a universal principle that characterizes quantum many-body phases and underpins tensor network algorithms. Traditionally, its validity has been limited to systems with short-range interactions and bounded local energy. Achieving a complete generalization that removes both of these constraints has been a longstanding goal in quantum many-body theory, especially for interacting boson systems where unbounded energy presents intrinsic difficulties. In this work, we rigorously prove the area law for one-dimensional interacting boson systems with long-range interactions, covering broad models including the Bose-Hubbard and ϕ4 classes. Furthermore, we establish an efficiency guarantee for Matrix-Product-State approximations of the ground states, offering a practical route to numerical simulation. One of our main technical contributions is a general method for Hilbert space dimension reduction, whose applicability extends to arbitrary spatial dimensions. These results address two major challenges simultaneously and provide important foundations for simulating long-range cold atomic systems. Entanglement area law has been established in systems with short range interactions and bounded local energy. Here the authors extend the proof to 1D bosonic systems with long-range interactions and unbounded local energy and outline implications for matrix product state approximations of the ground states.

arXiv:2411.02157•Nature Communications•May 20, 2026•3 citations

Quantum complexity and generalized area law in fully connected models

Donghoon Kim, Tomotaka Kuwahara

The area law for entanglement entropy captures a fundamental constraint on the complexity of quantum many-body ground states and enables their efficient description. While the area law is rigorously established in one dimension, its status in higher-dimensional local systems remains unresolved, and it does not hold in general for geometrically non-local systems. Here, we establish a generalized area law for gapped ground states of fully connected Hamiltonians. We show that the bipartite entanglement entropy grows at most logarithmically with system size despite the absence of geometric locality. In the ground state, each site is only weakly entangled with the rest, while configurations with extensive local fluctuations are strongly suppressed, effectively restricting the accessible Hilbert space. As a consequence, the ground state admits a matrix product state approximation with polynomial bond dimension with respect to the system size at fixed accuracy. In the permutation-invariant setting, we further prove a constant entanglement bound and demonstrate that the gapped ground state can be computed in time polylogarithmic in the system size. These results show that low entanglement complexity need not rely on geometric locality, broadening the conceptual and computational scope of area laws.

arXiv:2411.02140•Nov 4, 2024•5 citations
We show how local interactions in a partial differential equation (PDE) model lead to eigenfunctions with favorable low-rank properties. To this end, we utilize ideas from quantum entanglement of multi-particle spin systems. We begin by analyzing the connection between entropy area laws and low-rank approximability. The characterization for 1D chains such as Matrix Product States (MPS) / Tensor Trains (TT) is rather extensive though incomplete. We then show that a Nearest Neighbor Interaction (NNI) PDE operator has eigenfunctions that are approximately separable in a certain sense. Under a further assumption on the approximand, we show that this implies a constant entropy bound. To the best of our knowledge, the presented approach is the first systematic treatment of low-rank approximability for general PDEs. The assumptions are general enough to include a large class of models (in, e.g., quantum mechanics) and have a physical interpretation. The weak points are the aforementioned assumption on the approximand and that the validity is limited to MPS/TT formats.
We show how local bounded interactions in an unbounded Hamiltonian lead to eigenfunctions with favorable low-rank properties. To this end, we utilize ideas from quantum entanglement of multi-particle spin systems. We begin by analyzing the connection between entropy area laws and low-rank approximability. The characterization for 1D chains such as Matrix Product States (MPS) / Tensor Trains (TT) is rather extensive though incomplete. We then show that a Nearest Neighbor Interaction (NNI) Hamiltonian has eigenfunctions that are approximately separable in a certain sense. Under a further assumption on the approximand, we show that this implies a constant entropy bound. To the best of our knowledge, this work is the first analysis of low-rank approximability for unbounded Hamiltonians. Moreover, it extends previous results on entanglement entropy area laws to unbounded operators. The assumptions include a variety of self-adjoint operators and have a physical interpretation. The weak points are the aforementioned assumption on the approximand and that the validity is limited to MPS/TT formats.
Low-rank tensor methods are an important tool in the numerical treatment of equations with a high-dimensional state space. Nearest neighbor interaction systems like the Ising model or more general Markov jump processes, as well as 1D finite-state quantum systems are examples of such problems. While low-rank tensor train/matrix product state models have been shown to be highly efficient for the simulation of such systems, providing theoretical justification for this remains a challenging task. One approach for obtaining estimates on required ranks for certain accuracies is to investigate the rank increase in Krylov subspace methods for solving the problem at hand. In the context of area laws for ground states of 1D spin systems, nontrivial results on rank-increasing properties of nearest neighbor operator polynomials have been obtained in work of Arad et al. [arXiv:1301.1162] by studying the partial commutativity of local operators. In the present work, this technique is applied to polynomial methods for definite linear equations and dissipative linear ODEs with nearest neighbor structure. This allows to derive corresponding low-rank approximability statements for solutions of such problems which are independent of the system size. Numerical simulations of high-dimensional nearest neighbor systems illustrate the theoretical findings.
We prove an area law for the entanglement entropy in gapped one-dimensional quantum systems. The bound on the entropy grows surprisingly rapidly with the correlation length; we discuss this in terms of properties of quantum expanders and present a conjecture on matrix product states which may provide an alternate way of arriving at an area law. We also show that, for gapped, local systems, the bound on Von Neumann entropy implies a bound on Rényi entropy for sufficiently large α<1 and implies the ability to approximate the ground state by a matrix product state.
We present an entanglement analysis of quantum superpositions corresponding to smooth, differentiable, real-valued (SDR) univariate functions. SDR functions are shown to be scalably approximated by low-rank matrix product states, for large system discretizations. We show that the maximum von-Neumann bipartite entropy of these functions grows logarithmically with the system size. This implies that efficient low-rank approximations to these functions exist in a matrix product state (MPS) for large systems. As a corollary, we show an upper bound on trace-distance approximation accuracy for a rank-2 MPS as Ω(log⁡N/N)Ω(\log N/N)Ω(logN/N), implying that these low-rank approximations can scale accurately for large quantum systems.
The entanglement area law is a universal principle that characterizes quantum many-body phases and underpins tensor network algorithms. Traditionally, its validity has been limited to systems with short-range interactions and bounded local energy. Achieving a complete generalization that removes both of these constraints has been a longstanding goal in quantum many-body theory, especially for interacting boson systems where unbounded energy presents intrinsic difficulties. In this work, we rigorously prove the area law for one-dimensional interacting boson systems with long-range interactions, covering broad models including the Bose-Hubbard and ϕ4 classes. Furthermore, we establish an efficiency guarantee for Matrix-Product-State approximations of the ground states, offering a practical route to numerical simulation. One of our main technical contributions is a general method for Hilbert space dimension reduction, whose applicability extends to arbitrary spatial dimensions. These results address two major challenges simultaneously and provide important foundations for simulating long-range cold atomic systems. Entanglement area law has been established in systems with short range interactions and bounded local energy. Here the authors extend the proof to 1D bosonic systems with long-range interactions and unbounded local energy and outline implications for matrix product state approximations of the ground states.
The area law for entanglement entropy captures a fundamental constraint on the complexity of quantum many-body ground states and enables their efficient description. While the area law is rigorously established in one dimension, its status in higher-dimensional local systems remains unresolved, and it does not hold in general for geometrically non-local systems. Here, we establish a generalized area law for gapped ground states of fully connected Hamiltonians. We show that the bipartite entanglement entropy grows at most logarithmically with system size despite the absence of geometric locality. In the ground state, each site is only weakly entangled with the rest, while configurations with extensive local fluctuations are strongly suppressed, effectively restricting the accessible Hilbert space. As a consequence, the ground state admits a matrix product state approximation with polynomial bond dimension with respect to the system size at fixed accuracy. In the permutation-invariant setting, we further prove a constant entanglement bound and demonstrate that the gapped ground state can be computed in time polylogarithmic in the system size. These results show that low entanglement complexity need not rely on geometric locality, broadening the conceptual and computational scope of area laws.