Pith. sign in

REVIEW 4 major objections 6 minor 64 references

Probing Quantum Spin Systems with Kolmogorov-Arnold Neural Network Quantum States

T0 review · 4 major / 6 minor · reviewed 2026-08-07 · deepseek-v4-flash

Pith's one-line read SineKAN neural networks can represent quantum spin ground states more cheaply and accurately than RBM, LSTM, and MLP baselines.

desk verdict Useful and honest KAN-NQS benchmark, but the L=100 superiority claim needs seed-averaged error bars before I'd trust it. read the letter →

arxiv 2506.01891 v4 pith:L2RIHKXN submitted 2025-06-02 quant-ph cond-mat.dis-nncond-mat.str-elcs.LG

classification quant-phcond-mat.dis-nncond-mat.str-elcs.LG
keywords SineKANKolmogorov-ArnoldnetworksneuralquantumstatesvariationalMonteCarloJ1-J2modelMarshallsignrulespinchainsreflectionsymmetry
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

SineKAN is proposed as a neural quantum state ansatz that represents a many-body wavefunction as a nested sum of learnable univariate sinusoidal functions, following the Kolmogorov-Arnold superposition theorem. The paper shows that the plain and reflection-symmetric variants match exact diagonalization for 20-site transverse-field Ising and anisotropic Heisenberg chains, and reproduce density-matrix renormalization group ground-state energies, fidelities, and correlation functions for the frustrated $J_1$-$J_2$ chain at sizes up to 100 sites. For the 100-site $J_1$-$J_2$ model, the symmetric rSineKAN achieves lower energy error and variance than restricted Boltzmann machines, LSTMs, and MLPs with comparable or larger parameter counts. The work argues that KAN-style learnable on-edge activations are a computationally cheap and expressive alternative for variational quantum many-body calculations.

What carries the argument

The load-bearing object is the SineKAN layer, a sinusoidal activation with learnable frequency $\omega_n$ and amplitude $A_{mnl}$ placed on every edge of the network, with a fixed grid of phase shifts $\pi n/N + \pi l/L$ plus a small random perturbation $\delta_{nl}$. Stacking such layers produces the nested univariate function of Eq. (2), whose parameters are optimized with variational Monte Carlo to minimize the Hamiltonian expectation value. Reflection symmetry enters through $y = S(\vec{\sigma}) + S(R(\vec{\sigma}))$, sharing weights between the chain and its mirror image and halving the effective parameter space. The Marshall sign rule is applied at the Hamiltonian level rather than in the network's phase, which is what lets the real, sign-free ansatz represent the alternating-sign ground states of the bipartite and weakly frustrated regimes.

What would settle it

Take the 100-site $J_1$-$J_2$ chain at $J_2=0.4$ or $0.5$, train rSineKAN both with and without the Marshall-sign-rule rotation applied to the Hamiltonian, and compare each variational energy and fidelity to DMRG; if the gap between the two runs is large, the reported advantage over RBM, LSTM, and MLP is an artifact of the sign encoding rather than of SineKAN expressivity. A second check is to rerun the $L=64$ case with grid size 8, where Table II shows the energy collapsing to $-16.962$ against an exact $-24$; if the collapse reappears under different random seeds, the anomaly is a genuine resonance, not a tuning accident.

Watch

Extended reading notes

Core claim

On its own terms, the paper's central claim is that a SineKAN wavefunction, built from layers of the form $y_m = \sum_{l,n} A_{mnl}\sin(\omega_n x_l + \pi n/N + \pi l/L + \delta_{nl}) + b_m$ with learnable amplitudes, frequencies, and biases, can serve as a highly accurate neural quantum state. In the $J_1$-$J_2$ chain with $L=100$ sites, the reflection-symmetric variant rSineKAN, constructed by summing the network's output on a spin configuration and its center reflection, outperforms RBM, LSTM, and MLP ans\"atze in reproducing DMRG ground-state energies while using about 86,000 parameters. The ansatz is trained by variational Monte Carlo with the Marshall sign rule encoded into the Hamiltonian, and its accuracy holds across the gapless to dimerized transition up to the Majumdar-Ghosh point at $J_2=0.5$; at $J_2=0.6$, where the sign rule breaks down, performance degrades for every ansatz tested. The paper also documents a sharp failure when the hidden-layer size matches the chain length and the grid size equals $\sqrt{L}$, avoided by perturbing the grid size by one.

Load-bearing premise

The load-bearing premise is that the Marshall sign rule, which the paper encodes directly into the $J_1$-$J_2$ Hamiltonian for every value of $J_2$, is a faithful description of the true ground-state sign structure wherever the paper's accuracy claims are made; the rule is exact only at $J_2=0$ and only approximate beyond it, so a sign-structure mismatch would bias the reported energies and fidelities.

Editorial extensions

If this is right

  • For 1D spin chains, a neural quantum state can be made markedly more parameter-efficient by replacing fixed node activations with learnable on-edge sine functions; the 100-site $J_1$-$J_2$ runs use tens of thousands of parameters rather than the millions of an RBM baseline.
  • The reflection-symmetric rSineKAN resolves the near-degenerate ground states of the anisotropic Heisenberg chain and the Majumdar-Ghosh point, indicating that simple discrete symmetries can substitute for much larger model capacity.
  • SineKAN inference time scales almost flatly with chain length up to hundreds of sites, so the ansatz is practical for systems where RBM inference has already become exponentially costly.
  • Beyond $J_2=0.5$, the fidelity drop tracks the violation of the Marshall sign rule, turning the ansatz into a tool for diagnosing where sign structure is no longer captured by a fixed phase convention.
  • If the comparison holds, transformer-free NQS architectures based on KAN layers are competitive baselines for future frustrated-magnetism studies, including the previously studied $L=100$ chain.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The grid-size failure at $\sqrt{L}$ suggests a periodicity collision between the sinusoidal grid phases and the input lattice; a testable remedy is to use incommensurate phase shifts or random grids, which would make the anomaly vanish without hand tuning.
  • The paper's comparison encodes the Marshall sign rule for all ans\"atze, so the cleanest extension is to test rSineKAN on genuinely non-bipartite or geometrically frustrated models, where no useful sign rule exists and the network must learn signs from scratch.
  • If the computational savings replicate, SineKAN layers could replace MLP heads inside transformer or autoregressive NQS architectures, giving those models a cheaper way to represent local correlations.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 6 minor

Summary. The manuscript proposes SineKAN, a neural quantum state (NQS) ansatz built from Kolmogorov-Arnold networks with learnable sinusoidal activations, and benchmarks it on three one-dimensional spin models. For L=20, the vSineKAN and rSineKAN variants are compared against exact diagonalization for the transverse-field Ising model, the anisotropic Heisenberg model, and the J1-J2 model, including energies, variances, fidelities, correlations, and structure factors. For L=32, 64, and 100, ground-state energies are compared with DMRG, and at L=100 the authors compare against RBM, RNN-LSTM, and MLP baselines. The central claim is that the reflection-symmetric rSineKAN outperforms these baselines in energy accuracy and variance, particularly at the Majumdar-Ghosh point.

Significance. If the comparative claim survives statistical scrutiny, the paper offers a compact and computationally efficient NQS ansatz that is competitive with established baselines and that handles the Majumdar-Ghosh point particularly well. The strengths include public code, benchmarks against ED and DMRG, and honest reporting of failure cases such as the vSineKAN fidelity collapse in the AHM, the poor J2=0.6 results, and the grid-size anomaly in Table II. The main weakness is that the headline L=100 comparison is not yet statistically grounded, as it rests on single-seed, post-hoc tuned runs without error bars.

major comments (4)
  1. [Section VII D and Fig. 11] The L=100 superiority claim is based on a single optimized run per architecture with no seed averaging or error bars. The gaps to the next-best baseline are often only about an order of magnitude, and RNN-LSTM has the best variance at J2=0.3. Without at least a few independent seeds and reported standard deviations, the claim that rSineKAN outperforms RBM, RNN-LSTM, and MLP is not established. Please report seed-averaged means and standard deviations, or an equivalent stability check, for all compared architectures.
  2. [Section VI A and Table IV] The learning rates are chosen per model and per J2 by checking performance against DMRG, and the grid size is changed from 8 to 7 for L=64 because of the anomaly in Table II. This post-hoc selection makes the comparison vulnerable to overfitting to the specific benchmark points. Please describe the selection protocol, including how many hyperparameter configurations were tried and on which J2 values, and ensure that the baselines received an equally thorough tuning; otherwise the head-to-head comparison is not controlled.
  3. [Section VII D and Fig. 9] The DMRG reference energies are stated to use maximum bond dimension chi=200, but no convergence check or truncation error is reported. Since some claimed relative errors are as small as about 1e-5, the DMRG reference may not be converged to that precision for L=100 frustrated chains. Please report the DMRG truncation error or a bond-dimension sweep for at least the L=100 points.
  4. [Section VIII and Section VII C] The Marshall sign rule is encoded into the Hamiltonian for all J2, including J2=0.6 where it is not valid. The paper correctly acknowledges this, but the J2=0.6 results are then not a clean test of the ansatz's ability to represent the true ground state; they are results for a rotated Hamiltonian whose ground state differs from the physical one. Please state this limitation explicitly when interpreting Fig. 12 and the 'best among ansaetze' claim at J2=0.6, or report additional runs without the MSR-based rotation.
minor comments (6)
  1. [Section IX, Fig. 13 caption] The caption says 'linear scaling for RBM and exponential scaling for the RBM,' which appears to be a typo; the text says RNN-LSTM scales linearly and RBM scales exponentially. Please correct the caption.
  2. [Section VII C] The fidelity drop at J2=0.6 is described as 'values around ~0.40%,' which should read approximately 0.40 or 40%; the later text refers to '~41% at J2=0.6.'
  3. [Section VI A] There is a typo in 'All SineKAN architectires are trained'; it should be 'architectures.'
  4. [Section IV] The phrase 'The computational complexity of RBM is more comparable to O(eN)' is ambiguous; please write the intended scaling as O(e^N) or with an explicit statement of the relevant complexity.
  5. [Section II, Eq. (5)] The summation notation 'L,NX' and the use of Almn in the text while the equation uses Amnl are inconsistent; please standardize the index names in Eq. (5) and its surrounding description.
  6. [Section III] The sentence 'fixed learning rate (typically ReLU)' should read 'fixed activation function (typically ReLU).'

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity; the only self-citation is in architectural motivation and is not load-bearing.

full rationale

We examined the claimed derivation chain. The SineKAN architecture is taken from Ref. [36], whose authors overlap with this paper (Reinhardt and Gleyzer), and the paper cites that work to motivate the choice of sinusoidal activations. This is a minor self-citation, but it is not load-bearing: the paper's central claims are new variational energies, fidelities, and correlations benchmarked against ED and DMRG, computed with VMC; no equation in the paper reduces to a fitted value, and no output quantity is defined in terms of an input. The MSR encoding into the Hamiltonian is a known physics-informed approximation, used consistently for all compared models for J2≤0.5, and the J2=0.6 breakdown is attributed to MSR violation rather than to hidden fitting. Hyperparameters such as learning rates are tuned per model and J2, but they are optimizer settings, not ansatz parameters, and the reported comparisons are empirical benchmarks rather than predictions derived from the tuning. The L=100 superiority claim is a measured result against an external DMRG reference; its dependence on single-seed runs and per-model tuning is a robustness concern, not a circularity concern. Overall, there is no significant circularity in the derivation or benchmarking logic; the score of 2 reflects only the minor self-citation in the architectural motivation.

Assumptions & free parameters 3 free parameters · 5 assumptions · 0 invented entities

The central claim depends on empirical hyperparameter choices (learning rates, grid sizes, bias schedules) and on the Marshall sign rule approximation; no new physical entities are postulated.

free parameters (3)
  • Learning rates per model and J2 = 1e-3 to 1e-5 depending on model and J2
    Learning rates were found empirically by scanning values from 1e-2 to 1e-6 against DMRG energies, as described in Section V A and Table IV.
  • Grid size for SineKAN layers = 8 (or 7 for L=64)
    Grid size was set to 8 for most systems but changed to 7 for L=64 to avoid the phase-alignment performance collapse documented in Table II.
  • Zeeman bias h_init = gamma + 0.2, annealed to zero
    For the anisotropic Heisenberg model, a magnetic bias is added and linearly ramped to zero to lift the Neel degeneracy, as described in Section VI.
assumptions (5)
  • standard math Kolmogorov-Arnold superposition theorem
    Used in Section II to justify expressing the wavefunction as a sum of univariate functions.
  • domain assumption SineKAN ansatz expressivity
    Assumes that the specific sinusoidal KAN architecture with finite grid size can approximate the ground-state wavefunctions of the studied spin chains; no rigorous guarantee is provided.
  • domain assumption Marshall sign rule approximation
    For J1-J2 with J2>0, the unitary transformation removing MSR is not exact; the paper relies on the approximation being accurate for J2≤0.5, as stated in Sections IV and VIII.
  • domain assumption Zero total magnetization sector
    For AHM and J1-J2, simulations are restricted to the zero-magnetization sector, which contains the ground state for these Hamiltonians but excludes other sectors.
  • domain assumption DMRG reference accuracy
    DMRG with bond dimension 200 is treated as the exact ground-truth reference for L=32,64,100; for 1D gapped and critical models this is standard but not exact.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Probing Quantum Spin Systems with Kolmogorov-Arnold Neural Network Quantum States." pith.science (2026). https://pith.science/paper/L2RIHKXN

@misc{pith2026250601891,
  author       = {Pith},
  title        = {Pith review of: Probing Quantum Spin Systems with Kolmogorov-Arnold Neural Network Quantum States},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/L2RIHKXN}},
  note         = {Machine review of arXiv:2506.01891}
}
abstract

Neural Quantum States (NQS) are a class of variational wave functions parametrized by neural networks (NNs) to study quantum many-body systems. In this work, we propose \texttt{SineKAN}, a NQS \textit{ansatz} based on Kolmogorov-Arnold Networks (KANs), to represent quantum mechanical wave functions as nested univariate functions. We show that \texttt{SineKAN} wavefunction with learnable sinusoidal activation functions can capture the ground state energies, fidelities and various correlation functions of the one dimensional Transverse-Field Ising model, Anisotropic Heisenberg model, and Antiferromagnetic $J_{1}-J_{2}$ model with different chain lengths. In our study of the $J_1-J_2$ model with $L=100$ sites, we find that the \texttt{SineKAN} model outperforms several previously explored neural quantum state \textit{ans\"atze}, including Restricted Boltzmann Machines (RBMs), Long Short-Term Memory models (LSTMs), and Multi-layer Perceptrons (MLP) \textit{a.k.a.} Feed Forward Neural Networks, when compared to the results obtained from the Density Matrix Renormalization Group (DMRG) algorithm. We find that \texttt{SineKAN} models can be trained to high precisions and accuracies with minimal computational costs.

Figures

Figures reproduced from arXiv: 2506.01891 by the authors.

Figure 1
Figure 1. FIG. 1 [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. FIG. 2: Energy gap ( [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. FIG. 3: Comparison between the [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (9 more)
Figure 4
Figure 4. Figure 4: FIG. 4: Top: GS fidelity, Middle: Relative energy error, [PITH_FULL_IMAGE:figures/full_fig_p006_4.png]
Figure 5
Figure 5. Figure 5: FIG. 5: Top: GS fidelity, Middle: Relative energy error, [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]
Figure 7
Figure 7. Figure 7: FIG. 7 [PITH_FULL_IMAGE:figures/full_fig_p008_7.png]
Figure 6
Figure 6. Figure 6: FIG. 6: Isotropic spin–spin correlation function [PITH_FULL_IMAGE:figures/full_fig_p008_6.png]
Figure 8
Figure 8. Figure 8: FIG. 8 [PITH_FULL_IMAGE:figures/full_fig_p009_8.png]
Figure 9
Figure 9. Figure 9: FIG. 9: Comparison of the relative error [PITH_FULL_IMAGE:figures/full_fig_p010_9.png]
Figure 10
Figure 10. Figure 10: FIG. 10: Comparison of the variance for the GS energy computed using the [PITH_FULL_IMAGE:figures/full_fig_p010_10.png]
Figure 11
Figure 11. Figure 11: FIG. 11: Comparison of error relative to DMRG [PITH_FULL_IMAGE:figures/full_fig_p010_11.png]
Figure 12
Figure 12. Figure 12: FIG. 12 [PITH_FULL_IMAGE:figures/full_fig_p011_12.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

64 extracted references · 26 canonical work pages

  1. [16]

    L. L. Viteritti, R. Rende, and F. Becca, Phys. Rev. Lett. 130, 236401 (2023), arXiv:2211.05504 [cond-mat.dis-nn]

  2. [1]

    Becca, L

    F. Becca, L. Capriotti, A. Parola, and S. Sorella, arXiv e-prints , arXiv:0905.4854 (2009), arXiv:0905.4854 [cond- mat.str-el]

  3. [2]

    Becca and S

    F. Becca and S. Sorella, Quantum Monte Carlo Ap- proaches for Correlated Systems (Cambridge University Press, 2017)

  4. [3]

    Carleo and M

    G. Carleo and M. Troyer, Science 355, 602 (2017), arXiv:1606.02318 [cond-mat.dis-nn]

  5. [4]

    Z. Lu, H. Pu, F. Wang, Z. Hu, and L. Wang, arXiv e-prints , arXiv:1709.02540 (2017), arXiv:1709.02540 [cs.LG]

  6. [5]

    D.-L. Deng, X. Li, and S. Das Sarma, Physical Review X 7, 021021 (2017), arXiv:1701.04844 [cond-mat.dis-nn]

  7. [6]

    Hibat-Allah, M

    M. Hibat-Allah, M. Ganahl, L. E. Hayward, R. G. Melko, and J. Carrasquilla, Physical Review Research 2, 023358 (2020), arXiv:2002.02973 [cond-mat.dis-nn]

  8. [7]

    Supplementing Recurrent Neural Networks with Annealing to Solve Combinatorial Optimization Problems

    S. Ahsan Khandoker, J. Munshad Abedin, and M. Hibat- Allah, Machine Learning: Science and Technology 4, 015026 (2023), arXiv:2207.08189 [cond-mat.dis-nn]

Show all 64 references
  1. [8]

    Roth, arXiv e-prints , arXiv:2003.06228 (2020), arXiv:2003.06228 [physics.comp-ph]

    C. Roth, arXiv e-prints , arXiv:2003.06228 (2020), arXiv:2003.06228 [physics.comp-ph]

  2. [9]

    H. L. Dao, arXiv e-prints , arXiv:2505.22083 (2025), arXiv:2505.22083 [quant-ph]

  3. [10]

    K. Choo, T. Neupert, and G. Carleo, Phys. Rev. B 100, 125124 (2019), arXiv:1903.06713 [cond-mat.str-el]

  4. [11]

    A. Chen, K. Choo, N. Astrakhantsev, and T. Ne- upert, Physical Review Research 4, L022026 (2022), arXiv:2111.06411 [cond-mat.str-el]

  5. [12]

    Roth and A

    C. Roth and A. H. MacDonald, arXiv e-prints , arXiv:2104.05085 (2021), arXiv:2104.05085 [quant-ph]

  6. [13]

    Liang, W.-Y

    X. Liang, W.-Y. Liu, P.-Z. Lin, G.-C. Guo, Y.-S. Zhang, and L. He, Phys. Rev. B 98, 104426 (2018), arXiv:1807.09422 [cond-mat.str-el]

  7. [14]

    D. Luo, Z. Chen, K. Hu, Z. Zhao, V. M. Hur, and B. K. Clark, Physical Review Research 5, 013216 (2023), arXiv:2101.07243 [cond-mat.str-el]

  8. [15]

    Sharir, Y

    O. Sharir, Y. Levine, N. Wies, G. Carleo, and A. Shashua, Phys. Rev. Lett. 124, 020503 (2020), arXiv:1902.04057 [cond-mat.dis-nn]

  9. [17]

    Loris Viteritti, R

    L. Loris Viteritti, R. Rende, A. Parola, S. Goldt, and F. Becca, arXiv e-prints , arXiv:2311.16889 (2023), arXiv:2311.16889 [cond-mat.str-el]

  10. [18]

    Rende, L

    R. Rende, L. Loris Viteritti, L. Bardone, F. Becca, and S. Goldt, arXiv e-prints , arXiv:2310.05715 (2023), arXiv:2310.05715 [cond-mat.str-el]

  11. [19]

    Rende, L

    R. Rende, L. Loris Viteritti, F. Becca, A. Scardicchio, A. Laio, and G. Carleo, arXiv e-prints , arXiv:2502.09488 (2025), arXiv:2502.09488 [quant-ph]. 14

  12. [20]

    A. Chen, V. Dattatraya Naik, and M. Heyl, arXiv e-prints , arXiv:2503.10462 (2025), arXiv:2503.10462 [cond-mat.dis-nn]

  13. [21]

    Roca-Jerat, M

    S. Roca-Jerat, M. Gallego, F. Luis, J. Carrete, and D. Zueco, Phys. Rev. B 110, 205147 (2024), arXiv:2407.04773 [quant-ph]

  14. [22]

    Zhang and M

    Y.-H. Zhang and M. Di Ventra, Phys. Rev. B107, 075147 (2023), arXiv:2208.01758 [quant-ph]

  15. [23]

    Nomura, A

    Y. Nomura, A. S. Darmawan, Y. Yamaji, and M. Imada, Phys. Rev. B 96, 205152 (2017), arXiv:1709.06475 [cond- mat.str-el]

  16. [24]

    Ferrari, F

    F. Ferrari, F. Becca, and J. Carrasquilla, Phys. Rev. B 100, 125131 (2019), arXiv:1906.00463 [cond-mat.str-el]

  17. [25]

    T.-H. Yang, M. Soleimanifar, T. Bergamaschi, and J. Preskill, When can classical neural networks represent quantum states? (2024), arXiv:2410.23152 [quant-ph]

  18. [26]

    Lange, A

    H. Lange, A. Van de Walle, A. Abedinnia, and A. Bohrdt, Quantum Science and Technology 9, 040501 (2024)

  19. [27]

    D. E. Rumelhart, G. E. Hinton, and R. J. Williams, Na- ture 323, 533 (1986)

  20. [28]

    Z. Liu, Y. Wang, S. Vaidya, F. Ruehle, J. Halver- son, M. Soljaˇ ci´ c, T. Y. Hou, and M. Tegmark, Kan: Kolmogorov-arnold networks (2024), arXiv:2404.19756 [cs.LG]

  21. [29]

    A. N. Kolmogorov, Doklady Akademii Nauk 108 (1956)

  22. [30]

    A. N. Kolmogorov, in Doklady Akademii Nauk , Vol. 114 (Russian Academy of Sciences, 1957) pp. 953–956

  23. [31]

    A. A. Aghaei, rkan: Rational kolmogorov-arnold net- works (2024), arXiv:2406.14495

  24. [32]

    Ta, Bsrbf-kan: A combination of b-splines and radial basic functions in kolmogorov-arnold networks (2024), arXiv:2406.11173

    H.-T. Ta, Bsrbf-kan: A combination of b-splines and radial basic functions in kolmogorov-arnold networks (2024), arXiv:2406.11173

  25. [33]

    Bozorgasl and H

    Z. Bozorgasl and H. Chen, Wav-kan: Wavelet kolmogorov-arnold networks (2024), arXiv:2405.12832

  26. [34]

    A. A. Aghaei, fkan: Fractional kolmogorov-arnold net- works with trainable jacobi basis functions (2024), arXiv:2406.07456

  27. [35]

    S. SS, K. AR, G. R, and A. KP, Chebyshev polynomial- based kolmogorov-arnold networks: An efficient archi- tecture for nonlinear function approximation (2024), arXiv:2405.07200

  28. [36]

    Reinhardt, D

    E. Reinhardt, D. Ramakrishnan, and S. Gleyzer, Frontiers in Artificial Intelligence 7, 10.3389/frai.2024.1462952 (2025)

  29. [37]

    T. Ji, Y. Hou, and D. Zhang, arXiv e-prints , arXiv:2407.11075 (2024), arXiv:2407.11075 [cs.LG]

  30. [38]

    E. Lieb, T. Schultz, and D. Mattis, Annals of Physics 16, 407 (1961)

  31. [39]

    Smolensky, in Parallel Distributed Processing: Explo- rations in the Microstructure of Cognition, Volume 1: Foundations, edited by D

    P. Smolensky, in Parallel Distributed Processing: Explo- rations in the Microstructure of Cognition, Volume 1: Foundations, edited by D. E. Rumelhart and J. L. Mc- Clelland (MIT Press, 1986) Chap. 6, pp. 194–281

  32. [40]

    G. E. Hinton, Neural Computation 14, 1771 (2002)

  33. [41]

    Cahuantzi, X

    R. Cahuantzi, X. Chen, and S. G¨ uttel, A comparison of lstm and gru networks for learning symbolic sequences, in Intelligent Computing (Springer Nature Switzerland,

  34. [42]

    S. Yang, X. Yu, and Y. Zhou, in 2020 International Workshop on Electronic Communication and Artificial Intelligence (IWECAI) (2020) pp. 98–101

  35. [43]

    A. S. Householder, Bulletin of Mathematical Biophysics 3, 63 (1941)

  36. [44]

    Okamoto and K

    K. Okamoto and K. Nomura, Physics Letters A 169, 433 (1992)

  37. [45]

    S. R. White and I. Affleck, Phys. Rev. B 54, 9862 (1996), arXiv:cond-mat/9602126 [cond-mat]

  38. [46]

    Bethe, Zeitschrift f¨ ur Physik71, 205 (1931)

    H. Bethe, Zeitschrift f¨ ur Physik71, 205 (1931)

  39. [47]

    Eggert, Phys

    S. Eggert, Phys. Rev. B 54, R9612 (1996), arXiv:cond- mat/9602026 [cond-mat]

  40. [48]

    C. K. Majumdar and D. K. Ghosh, Journal of Mathe- matical Physics 10, 1388 (1969)

  41. [49]

    Marshall, Proceedings of the Royal Society of London

    W. Marshall, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences 232, 48 (1955)

  42. [50]

    Capriotti, International Journal of Modern Physics B 15, 1799 (2001), arXiv:cond-mat/0112207 [cond-mat.str- el]

    L. Capriotti, International Journal of Modern Physics B 15, 1799 (2001), arXiv:cond-mat/0112207 [cond-mat.str- el]

  43. [51]

    L. L. Viteritti, F. Ferrari, and F. Becca, SciPost Physics 12, 166 (2022), arXiv:2202.07576 [cond-mat.str-el]

  44. [52]

    A. W. Sandvik, Phys. Rev. Lett. 83, 3069 (1999), arXiv:cond-mat/9904218 [cond-mat.str-el]

  45. [53]

    D. P. Kingma and J. Ba, CoRR abs/1412.6980 (2014)

  46. [54]

    Vicentini, D

    F. Vicentini, D. Hofmann, A. Szab´ o, D. Wu, C. Roth, C. Giuliani, G. Pescia, J. Nys, V. Vargas-Calder´ on, N. Astrakhantsev, and G. Carleo, SciPost Physics Code- bases , 007 (2022)

  47. [55]

    A. W. Sandvik, in Lectures on the Physics of Strongly Correlated Systems Xiv: Fourteenth Training Course in the Physics of Strongly Correlated Systems, American In- stitute of Physics Conference Series, Vol. 1297, edited by A. Avella and F. Mancini (AIP, 2010) pp. 135–338, arX...

  48. [56]

    Westerhout, N

    T. Westerhout, N. Astrakhantsev, K. S. Tikhonov, M. I. Katsnelson, and A. A. Bagrov, Nature Communications 11, 1593 (2020)

  49. [57]

    Szab´ o and C

    A. Szab´ o and C. Castelnovo, Physical Review Research 2, 033075 (2020), arXiv:2002.04613 [cond-mat.str-el]

  50. [58]

    N. S. Bingham, S. Rooke, J. Park, A. Simon, W. Zhu, X. Zhang, J. Batley, J. D. Watts, C. Leighton, K. A. Dahmen, and P. Schiffer, Phys. Rev. Lett. 127, 207203 (2021), arXiv:2110.03596 [cond-mat.mes-hall]

  51. [59]

    Korshak, T

    Y. Korshak, T. Medvedeva, A. Ovchinnikov, V. Spector, and T. Babushkina, Nature 326, 370 (1987)

  52. [60]

    Zhang, Z

    H. Zhang, Z. Zhao, A. T. Turley, L. Wang, P. R. McGo- nigal, Y. Tu, Y. Li, Z. Wang, R. T. K. Kwok, J. W. Y. Lam, and B. Z. Tang, Advanced Materials 32, 2001457 (2020)

  53. [61]

    D. Wu, R. Rossi, F. Vicentini, N. Astrakhantsev, F. Becca, X. Cao, J. Carrasquilla, F. Ferrari, A. Georges, M. Hibat-Allah, M. Imada, A. M. L¨ auchli, G. Mazzola, A. Mezzacapo, A. Millis, J. Robledo Moreno, T. Ne- upert, Y. Nomura, J. Nys, O. Parcollet, R. Pohle, I. Romero, M....

  54. [62]

    H¨ afner and F

    D. H¨ afner and F. Vicentini, Journal of Open Source Soft- ware 6, 3419 (2021)

  55. [63]

    Fishman, S

    M. Fishman, S. R. White, and E. M. Stoudenmire, Sci- Post Phys. Codebases , 4 (2022)

  56. [64]

    Chen and M

    A. Chen and M. Heyl, Nature Physics 20, 1476 (2024), arXiv:2302.01941 [cond-mat.dis-nn]. 15 Chain Length J2 rSineKAN vSineKAN Hidden Layer Grid Size No. of Params Learning Rate Hidden Layer Grid Size No. of Params Learning Rate 0.0 1 × 10−3 1 × 10−4 0.1 1 × 10−3 1 × 10−4 0.2 1...

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.