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:2105.02239 · Quantum

Hilbert curve vs Hilbert space: exploiting fractal 2D covering to increase tensor network efficiency

Giovanni Cataldi, Ashkan Abedi, Giuseppe Magnifico, Simone Notarnicola, Nicola Dalla Pozza, Vittorio Giovannetti, Simone Montangero

Published Sep 29, 2021• 26 citations
arXivHTMLPDF

Abstract

We present a novel mapping for studying 2D many-body quantum systems by solving an effective, one-dimensional long-range model in place of the original two-dimensional short-range one. In particular, we address the problem of choosing an efficient mapping from the 2D lattice to a 1D chain that optimally preserves the locality of interactions within the TN structure. By using Matrix Product States (MPS) and Tree Tensor Network (TTN) algorithms, we compute the ground state of the 2D quantum Ising model in transverse field with lattice size up to 64×64 , comparing the results obtained from different mappings based on two space-filling curves, the snake curve and the Hilbert curve. We show that the locality-preserving properties of the Hilbert curve leads to a clear improvement of numerical precision, especially for large sizes, and turns out to provide the best performances for the simulation of 2D lattice systems via 1D TN structures.

DOI
10.22331/q-2021-09-29-556

Related papers

Efficient simulation of the 2D Hubbard model via Hilbert space-filling curve mapping

Ashkan Abedi, Vittorio Giovannetti, Dario De Santis

Abstract We investigate tensor network simulations of the two-dimensional (2D) Hubbard model by mapping the lattice onto a one-dimensional chain using space-filling curves. In particular, we focus on the Hilbert curve, whose locality-preserving structure minimizes the range of effective interactions in the mapped model. This enables a more compact matrix product state representation compared to conventional snake mapping. Through systematic benchmarks, we show that the Hilbert curve consistently yields lower ground-state energies at fixed bond dimension, with the advantage increasing for larger system sizes and in physically relevant interaction regimes. Our implementation reaches clusters up to 32 × 32 sites with open and periodic boundary conditions, delivering reliable ground-state energies and correlation functions in agreement with established results, but at significantly reduced computational cost. These findings establish space-filling curve mappings, particularly the Hilbert curve, as a powerful tool for extending tensor-network studies of strongly correlated 2D quantum systems beyond the limits accessible with standard approaches.

New Journal of Physics•Mar 26, 2026•0 citations

Efficient Simulation of the 2D Hubbard Model via Hilbert Space-Filling Curve Mapping

Ashkan Abedi, Vittorio Giovannetti, Dario De Santis

We investigate tensor network simulations of the two-dimensional Hubbard model by mapping the lattice onto a one-dimensional chain using space-filling curves. In particular, we focus on the Hilbert curve, whose locality-preserving structure minimizes the range of effective interactions in the mapped model. This enables a more compact matrix product state (MPS) representation compared to conventional snake mapping. Through systematic benchmarks, we show that the Hilbert curve consistently yields lower ground-state energies at fixed bond dimension, with the advantage increasing for larger system sizes and in physically relevant interaction regimes. Our implementation reaches clusters up to $32\times32$ sites with open and periodic boundary conditions, delivering reliable ground-state energies and correlation functions in agreement with established results, but at significantly reduced computational cost. These findings establish space-filling curve mappings, particularly the Hilbert curve, as a powerful tool for extending tensor-network studies of strongly correlated two-dimensional quantum systems beyond the limits accessible with standard approaches.

quant-pharXiv:2512.02666•Dec 3, 2025•1 citation

Fractal path strategies for efficient two-dimensional density matrix renormalization group simulations

Oliver R. Bellwood, Heitor P. Casagrande, William J. Munro

Numerical simulations of quantum magnetism in two spatial dimensions are often constrained by the area law of entanglement entropy, which heavily limits the accessible system sizes in tensor network methods. In this work, we investigate how the choice of mapping from a two-dimensional lattice to a one-dimensional path affects the accuracy of the two-dimensional density matrix renormalization group algorithm. We systematically evaluate all mappings corresponding to a subset of the Hamiltonian paths of the $N\ifmmode\times\else\texttimes\fi{}N$ grid graphs up to $N=8$ and demonstrate that the fractal space-filling curves generally lead to faster convergence in ground state searches compared to the commonly used ``snake'' path. To explain this performance gain, we analyze various locality metrics and propose a scalable method for constructing high-performing paths on larger lattices by tiling smaller optimal paths. Our results show that such paths consistently improve simulation convergence, with the advantage increasing with system size.

arXiv:2507.11820•Physical review. B./Physical review. B•Dec 5, 2025•0 citations

Tensor network approaches: Ground states and dynamics in quantum many-body systems

Ho N. Phien

The study of interacting quantum many-body systems is one of the central challenges in modern physics. Interestingly, by understanding the physical properties of such systems from a microscopic description, one can explain many complex quantum phenomena such as the high-temperature superconductivity, fractional quantum Hall effect, etc. However, due to high complexity of these systems, theoretical investigations such as analytical and perturbation theories are limited to studying only a small subset of problems. In the past few decades, numerical simulation has emerged as an indispensable method for studying many phenomena, and has led to immense success and progress in recent years. The main obstacle in addressing quantum many-body systems is that the number of parameters required to represent a state of the system scales exponentially with the system size. However, one hardly needs the full Hilbert space but only a small subspace to describe physical properties of the system. From the point of view in quantum information theory, quantum entanglement is one of the main factors that is responsible for the complexity of studying quantum many-body systems. In particular, the amount of quantum entanglement in such system quantifies the correlation between constituents and therefore it determines how big the subspace is required to represent the system. In this thesis, we are interested in using tensor network states, a new emerging numerical technique to study dynamical and ground state properties of the system. The key ingredient is that a tensor network state which consists of a fairly small number of parameters can represent very well the complete wave function of a system. In one spatial dimension, Matrix Product State (MPS) has become a standard tool, combined with related algorithms such as Time Evolving Block Decimation algorithm (TEBD) to study dynamical properties of a locally-perturbed quantum lattice system. In this thesis, we introduce a technique called ``infinite boundary conditions'' that allows us to use a finite-size MPS to represent the state of an infinite-size system. As a result, one can simulate dynamics of a system for a longer time with a significant computational cost reduction compared to traditional methods. In two spatial dimensions, the tensor network known as Projected Entangled Pair States (PEPS) is emerging as a useful approach. However algorithms for optimizing the matrix elements of these tensors are complex and not very efficient. In particular, the efficiency of the optimization depends critically on the quality of the so-called ``environment'', which is expensive to compute. We have introduced a new method to accelerate the convergence of calculating the PEPS ground state by recycling the environment tensors for many optimization steps, vastly reducing the number of times that the full environment needs to be calculated.

•Jan 1, 2013•0 citations

Tensor Network Skeletonization

Lexing Ying B

We introduce a new coarse-graining algorithm, tensor network skeletonization, for the numerical computation of tensor networks. This approach utilizes a structure-preserving skeletonization procedure to remove short-range entanglements effectively at every scale. This approach is first presented in the setting of a two-dimensional (2D) statistical Ising model and is then extended to higher-dimensional tensor networks and disordered systems. When applied to the Euclidean path integral formulation, this approach also gives rise to new efficient representations of the ground states for 1D and 2D quantum Ising models.

arXiv:1607.00050•Multiscale Modeling and Simulation•Jan 1, 2017•17 citations

Classical versus quantum: Comparing tensor-network-based quantum circuits on Large Hadron Collider data

Jack Y. Araz, Michael Spannowsky

Tensor networks (TN) are approximations of high-dimensional tensors designed to represent locally entangled quantum many-body systems efficiently. This paper provides a comprehensive comparison between classical TNs and TN-inspired quantum circuits in the context of machine learning on highly complex, simulated Large Hadron Collider data. We show that classical TNs require exponentially large bond dimensions and higher Hilbert-space mapping to perform comparably to their quantum counterparts. While such an expansion in the dimensionality allows better performance, we observe that, with increased dimensionality, classical TNs lead to a highly flat loss landscape, rendering the usage of gradient-based optimization methods highly challenging. Furthermore, by employing quantitative metrics, such as the Fisher information and effective dimensions, we show that classical TNs require a more extensive training sample to represent the data as efficiently as TN-inspired quantum circuits. We also engage with the idea of hybrid classical-quantum TNs and show possible architectures to employ a larger phase space from the data. We offer our results using three main TN Ans\"atze: Tree tensor networks, matrix product states, and multiscale entanglement renormalization Ans\"atze.

arXiv:2202.10471•Physical Review A•Dec 19, 2022•32 citations
We present a novel mapping for studying 2D many-body quantum systems by solving an effective, one-dimensional long-range model in place of the original two-dimensional short-range one. In particular, we address the problem of choosing an efficient mapping from the 2D lattice to a 1D chain that optimally preserves the locality of interactions within the TN structure. By using Matrix Product States (MPS) and Tree Tensor Network (TTN) algorithms, we compute the ground state of the 2D quantum Ising model in transverse field with lattice size up to 64×64 , comparing the results obtained from different mappings based on two space-filling curves, the snake curve and the Hilbert curve. We show that the locality-preserving properties of the Hilbert curve leads to a clear improvement of numerical precision, especially for large sizes, and turns out to provide the best performances for the simulation of 2D lattice systems via 1D TN structures.
Abstract We investigate tensor network simulations of the two-dimensional (2D) Hubbard model by mapping the lattice onto a one-dimensional chain using space-filling curves. In particular, we focus on the Hilbert curve, whose locality-preserving structure minimizes the range of effective interactions in the mapped model. This enables a more compact matrix product state representation compared to conventional snake mapping. Through systematic benchmarks, we show that the Hilbert curve consistently yields lower ground-state energies at fixed bond dimension, with the advantage increasing for larger system sizes and in physically relevant interaction regimes. Our implementation reaches clusters up to 32 × 32 sites with open and periodic boundary conditions, delivering reliable ground-state energies and correlation functions in agreement with established results, but at significantly reduced computational cost. These findings establish space-filling curve mappings, particularly the Hilbert curve, as a powerful tool for extending tensor-network studies of strongly correlated 2D quantum systems beyond the limits accessible with standard approaches.
We investigate tensor network simulations of the two-dimensional Hubbard model by mapping the lattice onto a one-dimensional chain using space-filling curves. In particular, we focus on the Hilbert curve, whose locality-preserving structure minimizes the range of effective interactions in the mapped model. This enables a more compact matrix product state (MPS) representation compared to conventional snake mapping. Through systematic benchmarks, we show that the Hilbert curve consistently yields lower ground-state energies at fixed bond dimension, with the advantage increasing for larger system sizes and in physically relevant interaction regimes. Our implementation reaches clusters up to 32×3232\times3232×32 sites with open and periodic boundary conditions, delivering reliable ground-state energies and correlation functions in agreement with established results, but at significantly reduced computational cost. These findings establish space-filling curve mappings, particularly the Hilbert curve, as a powerful tool for extending tensor-network studies of strongly correlated two-dimensional quantum systems beyond the limits accessible with standard approaches.
Numerical simulations of quantum magnetism in two spatial dimensions are often constrained by the area law of entanglement entropy, which heavily limits the accessible system sizes in tensor network methods. In this work, we investigate how the choice of mapping from a two-dimensional lattice to a one-dimensional path affects the accuracy of the two-dimensional density matrix renormalization group algorithm. We systematically evaluate all mappings corresponding to a subset of the Hamiltonian paths of the $N\ifmmode\times\else\texttimes\fi{}N$ grid graphs up to N=8N=8N=8 and demonstrate that the fractal space-filling curves generally lead to faster convergence in ground state searches compared to the commonly used ``snake'' path. To explain this performance gain, we analyze various locality metrics and propose a scalable method for constructing high-performing paths on larger lattices by tiling smaller optimal paths. Our results show that such paths consistently improve simulation convergence, with the advantage increasing with system size.
The study of interacting quantum many-body systems is one of the central challenges in modern physics. Interestingly, by understanding the physical properties of such systems from a microscopic description, one can explain many complex quantum phenomena such as the high-temperature superconductivity, fractional quantum Hall effect, etc. However, due to high complexity of these systems, theoretical investigations such as analytical and perturbation theories are limited to studying only a small subset of problems. In the past few decades, numerical simulation has emerged as an indispensable method for studying many phenomena, and has led to immense success and progress in recent years. The main obstacle in addressing quantum many-body systems is that the number of parameters required to represent a state of the system scales exponentially with the system size. However, one hardly needs the full Hilbert space but only a small subspace to describe physical properties of the system. From the point of view in quantum information theory, quantum entanglement is one of the main factors that is responsible for the complexity of studying quantum many-body systems. In particular, the amount of quantum entanglement in such system quantifies the correlation between constituents and therefore it determines how big the subspace is required to represent the system. In this thesis, we are interested in using tensor network states, a new emerging numerical technique to study dynamical and ground state properties of the system. The key ingredient is that a tensor network state which consists of a fairly small number of parameters can represent very well the complete wave function of a system. In one spatial dimension, Matrix Product State (MPS) has become a standard tool, combined with related algorithms such as Time Evolving Block Decimation algorithm (TEBD) to study dynamical properties of a locally-perturbed quantum lattice system. In this thesis, we introduce a technique called ``infinite boundary conditions'' that allows us to use a finite-size MPS to represent the state of an infinite-size system. As a result, one can simulate dynamics of a system for a longer time with a significant computational cost reduction compared to traditional methods. In two spatial dimensions, the tensor network known as Projected Entangled Pair States (PEPS) is emerging as a useful approach. However algorithms for optimizing the matrix elements of these tensors are complex and not very efficient. In particular, the efficiency of the optimization depends critically on the quality of the so-called ``environment'', which is expensive to compute. We have introduced a new method to accelerate the convergence of calculating the PEPS ground state by recycling the environment tensors for many optimization steps, vastly reducing the number of times that the full environment needs to be calculated.
We introduce a new coarse-graining algorithm, tensor network skeletonization, for the numerical computation of tensor networks. This approach utilizes a structure-preserving skeletonization procedure to remove short-range entanglements effectively at every scale. This approach is first presented in the setting of a two-dimensional (2D) statistical Ising model and is then extended to higher-dimensional tensor networks and disordered systems. When applied to the Euclidean path integral formulation, this approach also gives rise to new efficient representations of the ground states for 1D and 2D quantum Ising models.
Tensor networks (TN) are approximations of high-dimensional tensors designed to represent locally entangled quantum many-body systems efficiently. This paper provides a comprehensive comparison between classical TNs and TN-inspired quantum circuits in the context of machine learning on highly complex, simulated Large Hadron Collider data. We show that classical TNs require exponentially large bond dimensions and higher Hilbert-space mapping to perform comparably to their quantum counterparts. While such an expansion in the dimensionality allows better performance, we observe that, with increased dimensionality, classical TNs lead to a highly flat loss landscape, rendering the usage of gradient-based optimization methods highly challenging. Furthermore, by employing quantitative metrics, such as the Fisher information and effective dimensions, we show that classical TNs require a more extensive training sample to represent the data as efficiently as TN-inspired quantum circuits. We also engage with the idea of hybrid classical-quantum TNs and show possible architectures to employ a larger phase space from the data. We offer our results using three main TN Ans\"atze: Tree tensor networks, matrix product states, and multiscale entanglement renormalization Ans\"atze.