pith. sign in

arxiv: 2604.25060 · v1 · submitted 2026-04-27 · ❄️ cond-mat.stat-mech · physics.chem-ph

Statistical mechanics in continuous space with tensor network methods

Pith reviewed 2026-05-07 17:31 UTC · model grok-4.3

classification ❄️ cond-mat.stat-mech physics.chem-ph
keywords tensor networksstatistical mechanicscontinuous spacehard-disk modelpartition functioncoarse-grainingboundary contractionthermodynamics
0
0 comments X

The pith

Tensor networks compute thermodynamic quantities for continuous-space particles by mapping them to locality-preserving lattice models.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows how to extend tensor network methods, traditionally restricted to lattice systems, to interacting particles moving in continuous space. It does so by discretizing the space into a grid and applying cell-based coarse-graining to produce an effective lattice model whose interactions remain local. The partition function of this lattice model is encoded as a tensor network, and thermodynamic observables are extracted by contracting the network from the boundary inward. The framework is applied to the two-dimensional hard-disk fluid, where the resulting calculations are compared against Monte Carlo simulations. If the mapping is accurate, tensor networks become available for a wide range of classical statistical-mechanics problems that were previously inaccessible to them.

Core claim

Through a real-space discretization combined with a cell-based coarse-graining scheme, we formulate an effective lattice model that explicitly preserves spatial locality. The partition function of this model is represented as a tensor network, and the thermodynamic quantities are computed via boundary contraction. We apply this framework to the two-dimensional hard-disk problem and demonstrate the strengths of the tensor-network formulation compared to existing Monte Carlo simulations.

What carries the argument

Real-space discretization combined with cell-based coarse-graining that yields a locality-preserving effective lattice model whose partition function is encoded as a tensor network and evaluated by boundary contraction.

Load-bearing premise

The discretization and cell-based coarse-graining must produce an effective lattice model whose thermodynamics match those of the original continuous-space system without uncontrolled errors that grow with size or density.

What would settle it

Systematic deviation between tensor-network results and converged Monte Carlo or exact results for pressure or free energy of the hard-disk system as density or system size is increased.

Figures

Figures reproduced from arXiv: 2604.25060 by Garnet Kin-Lic Chan, Gunhee Park, Johnnie Gray, Si-Jing Du, Tomislav Begu\v{s}i\'c.

Figure 2
Figure 2. Figure 2: FIG. 2. (a) Diagrammatic representation of the factor graph view at source ↗
Figure 1
Figure 1. Figure 1: FIG. 1. (a) Particles in a box. (b) Same system in the site rep view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. 2 view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. Within the infinite TN framework, the density is plot view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6. Pair correlation functions computed from infinite TN and MC calculations. For the MC reference, the GCMC data view at source ↗
Figure 7
Figure 7. Figure 7: FIG. 7. (a) Free energy convergence using the TN boundary view at source ↗
Figure 8
Figure 8. Figure 8: FIG. 8. Density as a function of lattice discretization constant view at source ↗
read the original abstract

Tensor network (TN) methods are well established for computing partition functions in statistical mechanics, though this use has traditionally been limited to lattice models. We extend the scope of TN methodology to interacting particle systems in continuous space. Through a real-space discretization combined with a cell-based coarse-graining scheme, we formulate an effective lattice model that explicitly preserves spatial locality. The partition function of this model is represented as a TN, and the thermodynamic quantities are computed via boundary contraction. We apply this framework to the two-dimensional hard-disk problem and demonstrate the strengths of the TN formulation compared to existing Monte Carlo simulations.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper claims to extend tensor network methods, traditionally limited to lattice models, to interacting particle systems in continuous space. It does so by combining real-space discretization with a cell-based coarse-graining scheme to produce an effective local lattice model whose partition function is encoded as a TN and evaluated by boundary contraction. The framework is applied to the two-dimensional hard-disk system, where the authors assert that it demonstrates advantages relative to existing Monte Carlo simulations.

Significance. If the discretization and coarse-graining map the continuous-space partition function to a lattice model whose thermodynamics converge to the exact continuous result in the appropriate limit, the work would meaningfully enlarge the domain of TN techniques to off-lattice problems. The explicit retention of spatial locality and the use of boundary contraction are technically attractive features that could complement Monte Carlo sampling in regimes with strong correlations or slow mixing.

major comments (1)
  1. [Abstract and method description] The central claim that the effective lattice model faithfully reproduces the thermodynamics of the continuous hard-disk system rests on an unverified assertion. The abstract states that the method works for hard disks and shows strengths versus Monte Carlo, but provides no quantitative error analysis, convergence data with respect to cell size or discretization parameters, or systematic extrapolation to the continuous limit. Without such controls, residual approximation errors that fail to vanish with system size or density would make the TN contraction compute the wrong model, rendering any claimed advantage over Monte Carlo irrelevant.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading of our manuscript and for highlighting the need for explicit verification of the continuous-space limit. We address the major comment below and will revise the manuscript accordingly.

read point-by-point responses
  1. Referee: [Abstract and method description] The central claim that the effective lattice model faithfully reproduces the thermodynamics of the continuous hard-disk system rests on an unverified assertion. The abstract states that the method works for hard disks and shows strengths versus Monte Carlo, but provides no quantitative error analysis, convergence data with respect to cell size or discretization parameters, or systematic extrapolation to the continuous limit. Without such controls, residual approximation errors that fail to vanish with system size or density would make the TN contraction compute the wrong model, rendering any claimed advantage over Monte Carlo irrelevant.

    Authors: We agree that a systematic quantitative study of the discretization and coarse-graining errors is required to rigorously establish convergence to the continuous hard-disk thermodynamics. The present manuscript reports thermodynamic quantities obtained at fixed discretization parameters and compares them to Monte Carlo benchmarks, but does not contain a dedicated convergence analysis with respect to cell size or an extrapolation procedure. We will add this analysis to the revised version, including explicit error estimates and scaling plots that demonstrate the vanishing of the approximation error in the appropriate limit. This addition will directly address the concern that the TN contraction might be solving an incorrect model. revision: yes

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper maps continuous-space hard-disk systems to an effective lattice model via explicit real-space discretization and cell-based coarse-graining, then represents the partition function as a tensor network and computes quantities by boundary contraction. No load-bearing step reduces computed thermodynamic quantities to fitted parameters, self-referential definitions, or self-citation chains that presuppose the target result. The central claim is a methodological construction whose validity is checked against independent Monte Carlo benchmarks rather than by construction. Any self-citations to prior TN work are non-load-bearing and do not substitute for the discretization step itself.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the unproven premise that the chosen discretization and coarse-graining preserve the continuous-space partition function to sufficient accuracy; no free parameters or new entities are explicitly introduced in the abstract.

axioms (1)
  • domain assumption Real-space discretization combined with cell-based coarse-graining yields an effective lattice model that preserves spatial locality and the thermodynamics of the original continuous system.
    Invoked when the authors state that the effective lattice model is formulated and its partition function is represented as a TN.

pith-pipeline@v0.9.0 · 5410 in / 1248 out tokens · 59048 ms · 2026-05-07T17:31:40.790097+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

53 extracted references · 53 canonical work pages

  1. [1]

    (b) The number of Monte Carlo steps in the Wang-Landau algorithm as a function of area

    Free energy density values for different system sizes are plotted in the inset. (b) The number of Monte Carlo steps in the Wang-Landau algorithm as a function of area. The inset shows a comparison of the free energy density calculated via the TN and MC methods. See the main text for the details of the Monte Carlo procedures. a versatile tool for studying ...

  2. [2]

    Verstraete, V

    F. Verstraete, V. Murg, and J. Cirac, Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin sys- tems, Advances in Physics57, 143 (2008)

  3. [3]

    Or´ us, Tensor networks for complex quantum systems, Nature Reviews Physics1, 538 (2019)

    R. Or´ us, Tensor networks for complex quantum systems, Nature Reviews Physics1, 538 (2019)

  4. [4]

    J. I. Cirac, D. P´ erez-Garc´ ıa, N. Schuch, and F. Ver- straete, Matrix product states and projected entangled pair states: Concepts, symmetries, theorems, Rev. Mod. Phys.93, 045003 (2021)

  5. [5]

    Okunishi, T

    K. Okunishi, T. Nishino, and H. Ueda, Developments in the tensor network - from statistical mechanics to quan- tum entanglement, Journal of the Physical Society of Japan91, 062001 (2022)

  6. [6]

    S.-J. Ran, E. Tirrito, C. Peng, X. Chen, L. Tagliacozzo, G. Su, and M. Lewenstein,Tensor Network Contractions: Methods and Applications to Quantum Many-Body Sys- tems, Lecture Notes in Physics, Vol. 964 (Springer Cham,

  7. [7]

    Xiang,Density Matrix and Tensor Network Renor- malization(Cambridge University Press, 2023)

    T. Xiang,Density Matrix and Tensor Network Renor- malization(Cambridge University Press, 2023)

  8. [8]

    Nishino, Density matrix renormalization group method for 2d classical models, Journal of the Physical Society of Japan64, 3598 (1995)

    T. Nishino, Density matrix renormalization group method for 2d classical models, Journal of the Physical Society of Japan64, 3598 (1995)

  9. [9]

    Nishino and K

    T. Nishino and K. Okunishi, Corner transfer matrix algo- rithm for classical renormalization group, Journal of the Physical Society of Japan66, 3040 (1997)

  10. [10]

    Nishino, Y

    T. Nishino, Y. Hieida, K. Okunishi, N. Maeshima, Y. Akutsu, and A. Gendiar, Two-dimensional tensor product variational formulation, Progress of Theoretical Physics105, 409 (2001)

  11. [11]

    Levin and C

    M. Levin and C. P. Nave, Tensor renormalization group approach to two-dimensional classical lattice models, Phys. Rev. Lett.99, 120601 (2007)

  12. [12]

    Or´ us and G

    R. Or´ us and G. Vidal, Infinite time-evolving block deci- mation algorithm beyond unitary evolution, Phys. Rev. B78, 155117 (2008)

  13. [13]

    Z. Y. Xie, H. C. Jiang, Q. N. Chen, Z. Y. Weng, and T. Xiang, Second renormalization of tensor-network states, Phys. Rev. Lett.103, 160601 (2009)

  14. [14]

    Z. Y. Xie, J. Chen, M. P. Qin, J. W. Zhu, L. P. Yang, and T. Xiang, Coarse-graining renormalization by higher- order singular value decomposition, Phys. Rev. B86, 045139 (2012)

  15. [15]

    J. F. Yu, Z. Y. Xie, Y. Meurice, Y. Liu, A. Denbleyker, H. Zou, M. P. Qin, J. Chen, and T. Xiang, Tensor renor- malization group study of classicalxymodel on the square lattice, Phys. Rev. E89, 013308 (2014). 8

  16. [16]

    Evenbly and G

    G. Evenbly and G. Vidal, Tensor network renormaliza- tion, Phys. Rev. Lett.115, 180405 (2015)

  17. [17]

    Yang, Z.-C

    S. Yang, Z.-C. Gu, and X.-G. Wen, Loop optimization for tensor network renormalization, Phys. Rev. Lett.118, 110504 (2017)

  18. [18]

    Dektor and D

    A. Dektor and D. Venturi, Dynamic tensor approxima- tion of high-dimensional nonlinear pdes, Journal of Com- putational Physics437, 110295 (2021)

  19. [19]

    Y. Hur, J. G. Hoskins, M. Lindsey, E. Stoudenmire, and Y. Khoo, Generative modeling via tensor train sketch- ing, Applied and Computational Harmonic Analysis67, 101575 (2023)

  20. [20]

    Y. Chen, J. Hoskins, Y. Khoo, and M. Lindsey, Commit- tor functions via tensor networks, Journal of Computa- tional Physics472, 111646 (2023)

  21. [21]

    Tang and L

    X. Tang and L. Ying, Solving high-dimensional fokker- planck equation with functional hierarchical tensor, Jour- nal of Computational Physics511, 113110 (2024)

  22. [22]

    R. T. Grimm, A. J. Staat, and J. D. Eaves, The Integral Decimation Method for Quantum Dynamics and Statis- tical Mechanics, Quantum10, 2064 (2026)

  23. [23]

    Z. A. Johnson, L. G. Silvestri, P. Guthrey, and M. S. Murillo, Tensor networks for liquids in heterogeneous sys- tems (2025), arXiv:2507.19352 [physics.comp-ph]

  24. [24]

    Wang and D

    F. Wang and D. P. Landau, Efficient, multiple-range ran- dom walk algorithm to calculate the density of states, Phys. Rev. Lett.86, 2050 (2001)

  25. [25]

    Wang and D

    F. Wang and D. P. Landau, Determining the density of states for classical statistical models: A random walk algorithm to produce a flat histogram, Phys. Rev. E64, 056101 (2001)

  26. [26]

    Hirschfelder, D

    J. Hirschfelder, D. Stevenson, and H. Eyring, A theory of liquid structure, The Journal of Chemical Physics5, 896 (1937)

  27. [27]

    J. E. Lennard-Jones and A. F. Devonshire, Critical phe- nomena in gases - i, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences163, 53 (1937)

  28. [28]

    J. G. Kirkwood, Critique of the free volume theory of the liquid state, The Journal of Chemical Physics18, 380 (1950)

  29. [29]

    J. A. Barker,Lattice Theories of the Liquid State, Inter- national Encyclopedia of Physical Chemistry and Chemi- cal Physics. Topic 10: The Fluid State, Vol. 1 (Pergamon Press, Oxford, 1963) p. 133, first edition

  30. [30]

    M´ ezard and A

    M. M´ ezard and A. Montanari,Information, Physics, and Computation(Oxford University Press, 2009)

  31. [31]

    Li and L.-P

    H. Li and L.-P. Yang, Tensor network simulation for the frustratedJ 1−J2 ising model on the square lattice, Phys. Rev. E104, 024118 (2021)

  32. [32]

    Jordan, R

    J. Jordan, R. Or´ us, G. Vidal, F. Verstraete, and J. I. Cirac, Classical simulation of infinite-size quantum lat- tice systems in two spatial dimensions, Phys. Rev. Lett. 101, 250602 (2008)

  33. [33]

    Haegeman, T

    J. Haegeman, T. J. Osborne, and F. Verstraete, Post- matrix product state methods: To tangent space and beyond, Phys. Rev. B88, 075133 (2013)

  34. [34]

    Haegeman and F

    J. Haegeman and F. Verstraete, Diagonalizing transfer matrices and matrix product operators: A medley of ex- act and computational methods, Annual Review of Con- densed Matter Physics8, 355 (2017)

  35. [35]

    Zauner-Stauber, L

    V. Zauner-Stauber, L. Vanderstraeten, M. T. Fishman, F. Verstraete, and J. Haegeman, Variational optimization algorithms for uniform matrix product states, Phys. Rev. B97, 045145 (2018)

  36. [36]

    M. T. Fishman, L. Vanderstraeten, V. Zauner-Stauber, J. Haegeman, and F. Verstraete, Faster methods for con- tracting infinite two-dimensional tensor networks, Phys. Rev. B98, 235148 (2018)

  37. [37]

    Vanderstraeten, J

    L. Vanderstraeten, J. Haegeman, and F. Verstraete, Tangent-space methods for uniform matrix product states, SciPost Phys. Lect. Notes , 7 (2019)

  38. [38]

    Nietner, B

    A. Nietner, B. Vanhecke, F. Verstraete, J. Eisert, and L. Vanderstraeten, Efficient variational contraction of two-dimensional tensor networks with a non-trivial unit cell, Quantum4, 328 (2020)

  39. [39]

    Vanhecke, M

    B. Vanhecke, M. V. Damme, J. Haegeman, L. Van- derstraeten, and F. Verstraete, Tangent-space methods for truncating uniform MPS, SciPost Phys. Core4, 004 (2021)

  40. [40]

    Cama˜ no, E

    C. Cama˜ no, E. N. Epperly, and J. A. Tropp, Successive randomized compression: A randomized algorithm for the compressed MPO-MPS product, Quantum10, 2022 (2026)

  41. [41]

    Corboz, S

    P. Corboz, S. R. White, G. Vidal, and M. Troyer, Stripes in the two-dimensional t-j model with infinite projected entangled-pair states, Phys. Rev. B84, 041108 (2011)

  42. [42]

    B. J. Alder and T. E. Wainwright, Phase transition for a hard sphere system, The Journal of Chemical Physics 27, 1208 (1957)

  43. [43]

    K. J. Strandburg, Two-dimensional melting, Rev. Mod. Phys.60, 161 (1988)

  44. [44]

    E. P. Bernard and W. Krauth, Two-step melting in two dimensions: First-order liquid-hexatic transition, Phys. Rev. Lett.107, 155704 (2011)

  45. [45]

    Engel, J

    M. Engel, J. A. Anderson, S. C. Glotzer, M. Isobe, E. P. Bernard, and W. Krauth, Hard-disk equation of state: First-order liquid-hexatic transition in two dimensions with three simulation methods, Phys. Rev. E87, 042134 (2013)

  46. [46]

    B. Li, Y. Nishikawa, P. H¨ ollmer, L. Carillo, A. C. Maggs, and W. Krauth, Hard-disk pressure computations-a his- toric perspective, The Journal of Chemical Physics157, 234111 (2022)

  47. [47]

    Frenkel and B

    D. Frenkel and B. Smit,Understanding Molecular Sim- ulation: From Algorithms to Applications, 3rd ed. (Aca- demic Press, 2023)

  48. [48]

    J. G. Kirkwood, Statistical mechanics of fluid mixtures, The Journal of Chemical Physics3, 300 (1935)

  49. [49]

    R. W. Zwanzig, High-temperature equation of state by a perturbation method. i. nonpolar gases, The Journal of Chemical Physics22, 1420 (1954)

  50. [50]

    C. D. Christ, A. E. Mark, and W. F. van Gunsteren, Basic ingredients of free energy calculations: A review, Journal of Computational Chemistry31, 1569 (2010)

  51. [51]

    Q. Yan, R. Faller, and J. J. de Pablo, Density-of-states monte carlo method for simulation of fluids, The Journal of Chemical Physics116, 8745 (2002)

  52. [52]

    Dayal, S

    P. Dayal, S. Trebst, S. Wessel, D. W¨ urtz, M. Troyer, S. Sabhapandit, and S. N. Coppersmith, Performance limitations of flat-histogram methods, Phys. Rev. Lett. 92, 097201 (2004)

  53. [53]

    Singh, M

    S. Singh, M. Chopra, and J. J. de Pablo, Density of states-based molecular simulations, Annual Review of Chemical and Biomolecular Engineering3, 369 (2012)