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:2512.02666

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

Ashkan Abedi, Vittorio Giovannetti, Dario De Santis

quant-phcond-mat.quant-gascond-mat.stat-mechcond-mat.str-elphysics.comp-phSubmitted Dec 2, 2025• Announced Dec 3, 2025• 1 citation
arXivHTMLPDF

Abstract

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.

Comments
13 pages, 10 figures

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

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

Giovanni Cataldi, Ashkan Abedi, Giuseppe Magnifico +4 more

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.

arXiv:2105.02239•Quantum•Sep 29, 2021•26 citations

Cost scaling of MPS and TTNS simulations for 2D and 3D systems with area-law entanglement

Thomas Barthel

Tensor network states are an indispensable tool for the simulation of strongly correlated quantum many-body systems. In recent years, tree tensor network states (TTNS) have been successfully used for two-dimensional systems and to benchmark quantum simulation approaches for condensed matter, nuclear, and particle physics. In comparison to the more traditional approach based on matrix product states (MPS), the graph distance of physical degrees of freedom can be drastically reduced in TTNS. Surprisingly, it turns out that, for large systems in $D>1$ spatial dimensions, MPS simulations of low-energy states are nevertheless more efficient than TTNS simulations. With a focus on $D=2$ and 3, the scaling of computational costs for different boundary conditions is determined under the assumption that the system obeys an entanglement (log-)area law, implying that bond dimensions scale exponentially in the surface area of the associated subsystems.

quant-pharXiv:2601.08132•Jan 14, 2026•0 citations

Quantitative Description of Strongly Correlated Materials by Combining Downfolding Techniques and Tensor Networks

Daan Vrancken, Simon Ganne, Daan Verraes +5 more

High Resolution Image Download MS PowerPoint Slide We present a high-accuracy procedure for electronic structure calculations of strongly correlated materials. To address limitations in current electronic structure methods, we employ density functional theory in combination with the constrained random phase approximation to construct an effective multiband Hubbard model, which is subsequently solved using tensor networks. Our work focuses on one-dimensional and quasi-one-dimensional materials, for which we employ the machinery of matrix product states. We apply this framework to the conjugated polymers trans -polyacetylene and polythiophene, as well as the quasi-one-dimensional charge-transfer insulator Sr 2 CuO 3 . The predicted band gaps show quantitative agreement with state-of-the-art computational techniques and experimental measurements. Beyond band gaps, tensor networks provide access to a wide range of physically relevant properties, including spin magnetization and various excitation energies. Their flexibility supports the implementation of complex Hamiltonians with longer-range interactions, while the bond dimension enables systematic control over accuracy. Furthermore, the computational cost scales efficiently with system size, demonstrating the framework’s scalability.

arXiv:2502.19588•Journal of Chemical Theory and Computation•Aug 10, 2025•0 citations

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

Quantum Gauge Networks: A New Kind of Tensor Network

Kevin Slagle

Although tensor networks are powerful tools for simulating low-dimensional quantum physics, tensor network algorithms are very computationally costly in higher spatial dimensions. We introduce quantum gauge networks : a different kind of tensor network ansatz for which the computation cost of simulations does not explicitly increase for larger spatial dimensions. We take inspiration from the gauge picture of quantum dynamics, which consists of a local wavefunction for each patch of space, with neighboring patches related by unitary connections. A quantum gauge network (QGN) has a similar structure, except the Hilbert space dimensions of the local wavefunctions and connections are truncated. We describe how a QGN can be obtained from a generic wavefunction or matrix product state (MPS). All 2k -point correlation functions of any wavefunction for M many operators can be encoded exactly by a QGN with bond dimension O(Mk) . In comparison, for just k=1 , an exponentially larger bond dimension of 2M/6 is generically required for an MPS of qubits. We provide a simple QGN algorithm for approximate simulations of quantum dynamics in any spatial dimension. The approximate dynamics can achieve exact energy conservation for time-independent Hamiltonians, and spatial symmetries can also be maintained exactly. We benchmark the algorithm by simulating the quantum quench of fermionic Hamiltonians in up to three spatial dimensions.

arXiv:2210.12151•Quantum•Sep 14, 2023•3 citations
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.
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 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.
Tensor network states are an indispensable tool for the simulation of strongly correlated quantum many-body systems. In recent years, tree tensor network states (TTNS) have been successfully used for two-dimensional systems and to benchmark quantum simulation approaches for condensed matter, nuclear, and particle physics. In comparison to the more traditional approach based on matrix product states (MPS), the graph distance of physical degrees of freedom can be drastically reduced in TTNS. Surprisingly, it turns out that, for large systems in D>1D>1D>1 spatial dimensions, MPS simulations of low-energy states are nevertheless more efficient than TTNS simulations. With a focus on D=2D=2D=2 and 3, the scaling of computational costs for different boundary conditions is determined under the assumption that the system obeys an entanglement (log-)area law, implying that bond dimensions scale exponentially in the surface area of the associated subsystems.
High Resolution Image Download MS PowerPoint Slide We present a high-accuracy procedure for electronic structure calculations of strongly correlated materials. To address limitations in current electronic structure methods, we employ density functional theory in combination with the constrained random phase approximation to construct an effective multiband Hubbard model, which is subsequently solved using tensor networks. Our work focuses on one-dimensional and quasi-one-dimensional materials, for which we employ the machinery of matrix product states. We apply this framework to the conjugated polymers trans -polyacetylene and polythiophene, as well as the quasi-one-dimensional charge-transfer insulator Sr 2 CuO 3 . The predicted band gaps show quantitative agreement with state-of-the-art computational techniques and experimental measurements. Beyond band gaps, tensor networks provide access to a wide range of physically relevant properties, including spin magnetization and various excitation energies. Their flexibility supports the implementation of complex Hamiltonians with longer-range interactions, while the bond dimension enables systematic control over accuracy. Furthermore, the computational cost scales efficiently with system size, demonstrating the framework’s scalability.
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.
Although tensor networks are powerful tools for simulating low-dimensional quantum physics, tensor network algorithms are very computationally costly in higher spatial dimensions. We introduce quantum gauge networks : a different kind of tensor network ansatz for which the computation cost of simulations does not explicitly increase for larger spatial dimensions. We take inspiration from the gauge picture of quantum dynamics, which consists of a local wavefunction for each patch of space, with neighboring patches related by unitary connections. A quantum gauge network (QGN) has a similar structure, except the Hilbert space dimensions of the local wavefunctions and connections are truncated. We describe how a QGN can be obtained from a generic wavefunction or matrix product state (MPS). All 2k -point correlation functions of any wavefunction for M many operators can be encoded exactly by a QGN with bond dimension O(Mk) . In comparison, for just k=1 , an exponentially larger bond dimension of 2M/6 is generically required for an MPS of qubits. We provide a simple QGN algorithm for approximate simulations of quantum dynamics in any spatial dimension. The approximate dynamics can achieve exact energy conservation for time-independent Hamiltonians, and spatial symmetries can also be maintained exactly. We benchmark the algorithm by simulating the quantum quench of fermionic Hamiltonians in up to three spatial dimensions.