Geometry-Induced Long-Range Correlations in Recurrent Neural Network Quantum States

• URL: http://arxiv.org/abs/2604.08661v1
• Date: Thu, 09 Apr 2026 18:00:04 GMT
• Title: Geometry-Induced Long-Range Correlations in Recurrent Neural Network Quantum States
• Abstract summary: Neural Quantum States based on autoregressive recurrent neural network (RNN) wave functions enable efficient sampling without Markov-chain autocorrelation.<n>Standard RNN architectures are biased toward finite-length correlations and can fail on states with long-range dependencies.<n>Here we introduce dilated RNN wave functions, where recurrent units access distant sites through dilated connections.
• Score: 1.4801853435122905
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Neural Quantum States based on autoregressive recurrent neural network (RNN) wave functions enable efficient sampling without Markov-chain autocorrelation, but standard RNN architectures are biased toward finite-length correlations and can fail on states with long-range dependencies. A common response is to adopt transformer-style self-attention, but this typically comes with substantially higher computational and memory overhead. Here we introduce dilated RNN wave functions, where recurrent units access distant sites through dilated connections, injecting an explicit long-range inductive bias while retaining a favorable $\mathcal{O}(N \log N)$ forward pass scaling. We show analytically that dilation changes the correlation geometry and can induce power-law correlation scaling in a simplified linearized and perturbative setting. Numerically, for the critical 1D transverse-field Ising model, dilated RNNs reproduce the expected power-law connected two-point correlations in contrast to the exponential decay typical of conventional RNN ansätze. We further show that the dilated RNN accurately approximates the one-dimensional Cluster state, a paradigmatic example with long-range conditional correlations that has previously been reported to be challenging for RNN-based wave functions. These results highlight dilation as a simple geometric mechanism for building correlation-aware autoregressive neural quantum states.

Related papers

• Image Classification Using CNN-QNN Hybrid Model with Optimized Correlated Features [5.4251532917943415]
  We propose a method to optimize the correlation among convolutional neural network (CNN) features that are used as inputs to quantum neural network (QNN)<n>We introduce correlated features that are more physically compatible with QNN.
  arXiv  Detail & Related papers  (2026-08-05T02:39:03Z)
• Unifying Dynamical Systems and Graph Theory to Mechanistically Understand Computation in Neural Networks [1.644043499620662]
  We show that the spatial and temporal function of recurrent neural networks can be recovered by modelling the network as a graph.<n>We introduce resolvent-RNNs (R-RNNs), which constrain multi-hop pathways and thereby induce temporal sparsity beyond that achieved by standard L1 regularisation.
  arXiv  Detail & Related papers  (2026-05-05T10:18:53Z)
• ParaRNN: An Interpretable and Parallelizable Recurrent Neural Network for Time-Dependent Data [14.833374935611703]
  Recurrent neural networks (RNNs) are a foundational class of models for time-dependent data.<n>Despite their flexibility and empirical success in machine learning, RNNs often suffer from limited interpretability and slow training.<n>This paper proposes the Parallelized RNN (ParaRNN), a novel model composed of multiple small recurrent units.
  arXiv  Detail & Related papers  (2026-05-04T15:05:24Z)
• Deep-Unrolling Multidimensional Harmonic Retrieval Algorithms on Neuromorphic Hardware [78.17783007774295]
  This paper explores the potential of conversion-based neuromorphic algorithms for highly accurate and energy-efficient single-snapshot multidimensional harmonic retrieval.<n>A novel method for converting the complex-valued convolutional layers and activations into spiking neural networks (SNNs) is developed.<n>The converted SNNs achieve almost five-fold power efficiency at moderate performance loss compared to the original CNNs.
  arXiv  Detail & Related papers  (2024-12-05T09:41:33Z)
• An Efficient Approach to Regression Problems with Tensor Neural Networks [5.345144592056051]
  This paper introduces a tensor neural network (TNN) to address nonparametric regression problems. The TNN demonstrates superior performance compared to conventional Feed-Forward Networks (FFN) and Radial Basis Function Networks (RBN) A significant innovation in our approach is the integration of statistical regression and numerical integration within the TNN framework.
  arXiv  Detail & Related papers  (2024-06-14T03:38:40Z)
• Higher-order Spatio-temporal Physics-incorporated Graph Neural Network for Multivariate Time Series Imputation [9.450743095412896]
  Missing values is an essential but challenging issue due to the complex latent-temporal correlation and dynamic nature of time series. We propose a higher-ordertemporal physics-incorporated Graph Neural Networks (HSPGNN) to address this problem. HSPGNN provides better dynamic analysis and explanation than traditional data-driven models.
  arXiv  Detail & Related papers  (2024-05-16T16:35:43Z)
• Analyzing Convergence in Quantum Neural Networks: Deviations from Neural Tangent Kernels [20.53302002578558]
  A quantum neural network (QNN) is a parameterized mapping efficiently implementable on near-term Noisy Intermediate-Scale Quantum (NISQ) computers. Despite the existing empirical and theoretical investigations, the convergence of QNN training is not fully understood.
  arXiv  Detail & Related papers  (2023-03-26T22:58:06Z)
• Learning Low Dimensional State Spaces with Overparameterized Recurrent Neural Nets [57.06026574261203]
  We provide theoretical evidence for learning low-dimensional state spaces, which can also model long-term memory. Experiments corroborate our theory, demonstrating extrapolation via learning low-dimensional state spaces with both linear and non-linear RNNs.
  arXiv  Detail & Related papers  (2022-10-25T14:45:15Z)
• Deep Architecture Connectivity Matters for Its Convergence: A Fine-Grained Analysis [94.64007376939735]
  We theoretically characterize the impact of connectivity patterns on the convergence of deep neural networks (DNNs) under gradient descent training. We show that by a simple filtration on "unpromising" connectivity patterns, we can trim down the number of models to evaluate.
  arXiv  Detail & Related papers  (2022-05-11T17:43:54Z)
• Coupled Oscillatory Recurrent Neural Network (coRNN): An accurate and (gradient) stable architecture for learning long time dependencies [15.2292571922932]
  We propose a novel architecture for recurrent neural networks. Our proposed RNN is based on a time-discretization of a system of second-order ordinary differential equations. Experiments show that the proposed RNN is comparable in performance to the state of the art on a variety of benchmarks.
  arXiv  Detail & Related papers  (2020-10-02T12:35:04Z)
• Provably Efficient Neural Estimation of Structural Equation Model: An Adversarial Approach [144.21892195917758]
  We study estimation in a class of generalized Structural equation models (SEMs) We formulate the linear operator equation as a min-max game, where both players are parameterized by neural networks (NNs), and learn the parameters of these neural networks using a gradient descent. For the first time we provide a tractable estimation procedure for SEMs based on NNs with provable convergence and without the need for sample splitting.
  arXiv  Detail & Related papers  (2020-07-02T17:55:47Z)
• Multipole Graph Neural Operator for Parametric Partial Differential Equations [57.90284928158383]
  One of the main challenges in using deep learning-based methods for simulating physical systems is formulating physics-based data. We propose a novel multi-level graph neural network framework that captures interaction at all ranges with only linear complexity. Experiments confirm our multi-graph network learns discretization-invariant solution operators to PDEs and can be evaluated in linear time.
  arXiv  Detail & Related papers  (2020-06-16T21:56:22Z)
• Measuring Model Complexity of Neural Networks with Curve Activation Functions [100.98319505253797]
  We propose the linear approximation neural network (LANN) to approximate a given deep model with curve activation function. We experimentally explore the training process of neural networks and detect overfitting. We find that the $L1$ and $L2$ regularizations suppress the increase of model complexity.
  arXiv  Detail & Related papers  (2020-06-16T07:38:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.