BDG-RNN: Graph RNN for Quantum Chemistry

• The BDG-RNN is a graph-structured recurrent neural network wavefunction ansatz that generalizes MPS-RNN by allowing nonlocal orbital correlations via bounded-degree graphs.
• It integrates graph-based recurrence with tensor hybridization and semistochastic local-energy evaluation to tackle initialization sensitivity, limited expressivity, and high computational cost in variational Monte Carlo.
• Empirical benchmarks on molecular systems demonstrate that BDG-RNN achieves chemical accuracy with reduced bond dimensions, highlighting its efficiency and potential over traditional MPS approaches.

Searching arXiv for the cited BDG-RNN and related graph-recurrent work to ground the article in the referenced papers. Bounded-degree graph recurrent neural network (BDG-RNN) is a graph-structured recurrent neural network wavefunction ansatz introduced for neural network quantum states in quantum chemistry, in which hidden-state propagation is performed on a bounded-degree directed acyclic graph over orbitals rather than on a purely one-dimensional recurrence (Wu et al., 25 Jul 2025). It generalizes the MPS-RNN family by allowing each orbital or site to receive recurrent information from multiple graph neighbors, and it was introduced to address initialization sensitivity, the need for stronger inductive bias and expressivity for graph-like orbital correlations, and the cost of local-energy evaluation in variational Monte Carlo (VMC). In a broader graph-learning sense, the distance-ordered recurrent encoding used in Graph Recurrent Encoding by Distance (GRED) is a closely related BDG-RNN-style construction: the graph is reduced to a bounded recurrent input indexed by hop distance, and recurrence becomes the main long-range aggregation mechanism (Ding et al., 2023).

1. Problem setting and design rationale

The motivation for BDG-RNN is tied to the limitations of standard neural network quantum states (NQS) in molecular electronic structure. The relevant difficulties are stated in three parts: initialization sensitivity, the need for stronger inductive bias and expressivity, and the high cost of local-energy evaluation. NQS are described as very flexible and, without physical constraints, highly sensitive to parameter initialization; this is especially problematic for large strongly correlated molecules, where random initialization can make optimization unstable or inefficient. Molecular systems can also exhibit complicated entanglement patterns beyond simple linear or 2D locality, so a generic NQS may not encode the physical structure of molecular orbitals well. In addition, local-energy evaluation dominates runtime in VMC, and for ab initio Hamiltonians the number of nonzero Hamiltonian couplings scales badly, making repeated computation of $\Psi(m)/\Psi(n)$ expensive (Wu et al., 25 Jul 2025).

Tensor network states provide the immediate background. MPS is physically motivated and easier to initialize, but it is naturally 1D; molecular orbitals are not inherently 1D, and a 1D chain can be a poor representation of the true orbital entanglement graph. Even with orbital reordering, MPS may need very large bond dimensions $\chi$ to represent strongly correlated molecules, and 2D generalizations still may not match molecular connectivity. BDG-RNN is therefore introduced to address three issues simultaneously: initialization, because it can be initialized from MPS parameters like MPS-RNN; expressivity, because it adds graph-based recurrent updates and optional tensor terms; and graph-based molecular structure handling, because it uses a bounded-degree directed acyclic graph built from orbital interactions.

A plausible implication is that BDG-RNN should be understood less as a generic sequence model applied to chemistry and more as a structured hybrid between tensor-network reasoning and graph-based recurrence. The bounded-degree constraint is central here: it keeps the architecture controlled and computationally manageable while still allowing nonlocal graph connectivity beyond a simple chain.

2. Graph construction and recurrent update rule

BDG-RNN is defined as a graph-generalized extension of MPS-RNN. The 1D MPS-RNN memory update is recalled as

$$h_t^{n_t} = M_{t-1}^{n_t} h_{t-1}^{n_{t-1}^\circ} + v_t^{n_t},$$

where $h_t^{n_t}\in \mathbb{R}^\chi$ or $\mathbb{C}^\chi$, $M_{t-1}^{n_t}$ is a $\chi\times\chi$ matrix, and $v_t^{n_t}$ is a vector. The phase is computed by

$$\phi_t = \arg\!\left((w_t)^T h_t^{n_t^\circ} + c_t\right), \qquad \phi(n)=\sum_t \phi_t.$$

For 2D MPS-RNN, the update includes horizontal and vertical incoming memory contributions. BDG-RNN then generalizes this idea from chain or grid neighborhoods to a molecular orbital graph (Wu et al., 25 Jul 2025).

The graph is built in two stages. First, orbital ordering is obtained by Fiedler ordering based on the exchange integral

$K_{ij} = [ij|ji].$

Second, a directed acyclic graph with bounded out-degree is constructed. The initial graph is built with a maximum out-degree constraint $\chi$0 excluding sources and sinks, and then edges are added greedily until the maximum out-degree $\chi$1 is reached. The resulting modified graph $\chi$2 has the bounded-degree property that each node has at most $\chi$3 outgoing edges.

For a vertex $\chi$4, with neighborhood $\chi$5, the BDG-RNN memory cell is defined by

$\chi$6

Here, $\chi$7 is a matrix for each directed edge $\chi$8, $\chi$9 is a higher-order tensor term, $$h_t^{n_t} = M_{t-1}^{n_t} h_{t-1}^{n_{t-1}^\circ} + v_t^{n_t},$$0 is the in-degree of vertex $$h_t^{n_t} = M_{t-1}^{n_t} h_{t-1}^{n_{t-1}^\circ} + v_t^{n_t},$$1, and $$h_t^{n_t} = M_{t-1}^{n_t} h_{t-1}^{n_{t-1}^\circ} + v_t^{n_t},$$2 is a local bias or vector term.

This recurrence is the defining mechanism of BDG-RNN. A site update uses incoming hidden states from graph neighbors, plus optional higher-order multiplicative interactions. Relative to standard sequential RNN-NQS, the change is structural rather than merely parametric: correlations are no longer encoded through a single recurrent path but through a bounded-degree graph over orbitals.

3. Wavefunction parametrization, VMC objective, and sampling

The underlying physical model is the standard second-quantized electronic Hamiltonian

$$h_t^{n_t} = M_{t-1}^{n_t} h_{t-1}^{n_{t-1}^\circ} + v_t^{n_t},$$3

For a trial state $$h_t^{n_t} = M_{t-1}^{n_t} h_{t-1}^{n_{t-1}^\circ} + v_t^{n_t},$$4,

$$h_t^{n_t} = M_{t-1}^{n_t} h_{t-1}^{n_{t-1}^\circ} + v_t^{n_t},$$5

with

$$h_t^{n_t} = M_{t-1}^{n_t} h_{t-1}^{n_{t-1}^\circ} + v_t^{n_t},$$6

The energy gradient is

$$h_t^{n_t} = M_{t-1}^{n_t} h_{t-1}^{n_{t-1}^\circ} + v_t^{n_t},$$7

These are the VMC relations within which BDG-RNN is optimized (Wu et al., 25 Jul 2025).

The generic RNN wavefunction is written as

$$h_t^{n_t} = M_{t-1}^{n_t} h_{t-1}^{n_{t-1}^\circ} + v_t^{n_t},$$8

where $$h_t^{n_t} = M_{t-1}^{n_t} h_{t-1}^{n_{t-1}^\circ} + v_t^{n_t},$$9 is the phase and the conditional probabilities are generated from the hidden state $h_t^{n_t}\in \mathbb{R}^\chi$0. BDG-RNN uses the same general autoregressive amplitude and phase factorization as MPS-RNN, and the amplitude $h_t^{n_t}\in \mathbb{R}^\chi$1 and phase $h_t^{n_t}\in \mathbb{R}^\chi$2 keep the same computational structure as vanilla MPS-RNN.

Training proceeds by standard VMC: sample occupation-number vectors according to $h_t^{n_t}\in \mathbb{R}^\chi$3, estimate the local energy, compute gradients, and update parameters using AdamW with

$h_t^{n_t}\in \mathbb{R}^\chi$4

A key practical feature is initialization from MPS parameters generated from the Focus package, which is explicitly used to avoid the optimization difficulty associated with random initialization. For sampling, BDG-RNN autoregressive sampling is implemented with a hybrid DFS/BFS strategy to avoid out-of-memory issues. The model also supports particle-number conservation and spin-projection conservation; these are enforced during autoregressive sampling by modifying conditional probabilities so that forbidden occupations get probability $h_t^{n_t}\in \mathbb{R}^\chi$5 and forced occupations get probability $h_t^{n_t}\in \mathbb{R}^\chi$6.

The paper does not present these constraints as optional cosmetic additions. They are part of the reason BDG-RNN functions as a chemistry-oriented wavefunction ansatz rather than as a conventional graph predictor.

4. Variants, tensor hybridization, and correlator extensions

Two closely related architectures are defined. BDG-RNN retains only the matrix-based graph recurrence terms, whereas BDG-TensorRNN includes both the matrix terms and the tensor term $h_t^{n_t}\in \mathbb{R}^\chi$7, increasing expressive power at higher computational cost (Wu et al., 25 Jul 2025).

The tensor term is potentially expensive, because a naive

$h_t^{n_t}\in \mathbb{R}^\chi$8

requires $h_t^{n_t}\in \mathbb{R}^\chi$9 parameters. To reduce this cost, Tucker decomposition is used:

$\mathbb{C}^\chi$0

Here, $\mathbb{C}^\chi$1 is a rank-$\mathbb{C}^\chi$2 core tensor of shape $\mathbb{C}^\chi$3, and each $\mathbb{C}^\chi$4 is a factor matrix of shape $\mathbb{C}^\chi$5. The choice

$\mathbb{C}^\chi$6

reduces the scaling from $\mathbb{C}^\chi$7 to

$\mathbb{C}^\chi$8

The same framework is further extended by RBM-inspired correlators. The normalized NQS $\mathbb{C}^\chi$9 is wrapped by an additional factor $M_{t-1}^{n_t}$0:

$M_{t-1}^{n_t}$1

Two correlators are defined. The cos-RBM is

$M_{t-1}^{n_t}$2

and the Ising-RBM is

$M_{t-1}^{n_t}$3

Their parameter scaling is $M_{t-1}^{n_t}$4 for cos-RBM and $M_{t-1}^{n_t}$5 for Ising-RBM, where $M_{t-1}^{n_t}$6.

In the paper’s formulation, RBM is not the primary ansatz. The main wavefunction remains BDG-RNN or BDG-TensorRNN, and the correlator acts as an augmenting multiplicative factor to further enhance expressivity and improve accuracy without dramatically modifying the underlying VMC optimization framework.

5. Semistochastic local energy and implementation framework

Local-energy evaluation is identified as the computational bottleneck. To reduce its cost, the paper introduces a semistochastic estimator. The exact local energy

$M_{t-1}^{n_t}$7

is decomposed into a deterministic part for matrix elements with $M_{t-1}^{n_t}$8 and a stochastic part for the remaining smaller couplings (Wu et al., 25 Jul 2025).

The deterministic part is

$M_{t-1}^{n_t}$9

For the stochastic part, $\chi\times\chi$0 is sampled from

$\chi\times\chi$1

and estimated by

$\chi\times\chi$2

The total estimator is then

$\chi\times\chi$3

This estimator is stated to be unbiased, and it becomes exact as $\chi\times\chi$4 or $\chi\times\chi$5.

The implementation is in the open-source package PyNQS, based on PyTorch. PyNQS supports BDG-RNN, RBM, Transformers, and easy addition of new ansätze. The reported work uses double precision ($\chi\times\chi$6), while single precision ($\chi\times\chi$7) is also supported. Molecular integrals are obtained with PySCF, MPS initialization is generated with the Focus package, and Hamiltonian matrix elements are evaluated via Slater–Condon rules and GPU bitwise operations.

This computational stack is not incidental to the method’s presentation. The semistochastic estimator and the implementation framework are treated as necessary enablers for practical large-scale VMC with graph-structured recurrent ansätze.

6. Empirical behavior on benchmark molecular systems

The paper evaluates BDG-RNN on three systems and uses these experiments to characterize both accuracy and efficiency (Wu et al., 25 Jul 2025).

One-dimensional hydrogen chain $\chi\times\chi$8 is studied at bond length $\chi\times\chi$9 in the STO-6G basis with orthonormalized atomic orbitals and an exact benchmark. For $v_t^{n_t}$0 with $v_t^{n_t}$1, the paper tests various $v_t^{n_t}$2 and $v_t^{n_t}$3, chooses $v_t^{n_t}$4 and $v_t^{n_t}$5, reports that computational cost drops to about 0.05% of the original method, and describes an about 2000-fold speedup. For chain lengths $v_t^{n_t}$6, $v_t^{n_t}$7, and $v_t^{n_t}$8, exact local energy scales as $v_t^{n_t}$9, whereas semistochastic evaluation reduces this to approximately $$\phi_t = \arg\!\left((w_t)^T h_t^{n_t^\circ} + c_t\right), \qquad \phi(n)=\sum_t \phi_t.$$0. In accuracy terms, $$\phi_t = \arg\!\left((w_t)^T h_t^{n_t^\circ} + c_t\right), \qquad \phi(n)=\sum_t \phi_t.$$1 improves over MPS at the same $$\phi_t = \arg\!\left((w_t)^T h_t^{n_t^\circ} + c_t\right), \qquad \phi(n)=\sum_t \phi_t.$$2; $$\phi_t = \arg\!\left((w_t)^T h_t^{n_t^\circ} + c_t\right), \qquad \phi(n)=\sum_t \phi_t.$$3 at $$\phi_t = \arg\!\left((w_t)^T h_t^{n_t^\circ} + c_t\right), \qquad \phi(n)=\sum_t \phi_t.$$4 yields an energy error of about 0.6 mHa, while MPS needs $$\phi_t = \arg\!\left((w_t)^T h_t^{n_t^\circ} + c_t\right), \qquad \phi(n)=\sum_t \phi_t.$$5 to reach similar accuracy. Adding cos-RBM with $$\phi_t = \arg\!\left((w_t)^T h_t^{n_t^\circ} + c_t\right), \qquad \phi(n)=\sum_t \phi_t.$$6 and partial initialization from optimized BDG-RNN reduces the error to 0.2 mHa, and for $$\phi_t = \arg\!\left((w_t)^T h_t^{n_t^\circ} + c_t\right), \qquad \phi(n)=\sum_t \phi_t.$$7 with cos-RBM the result is near chemical accuracy.

The iron–sulfur cluster $$\phi_t = \arg\!\left((w_t)^T h_t^{n_t^\circ} + c_t\right), \qquad \phi(n)=\sum_t \phi_t.$$8 is studied in CAS$$\phi_t = \arg\!\left((w_t)^T h_t^{n_t^\circ} + c_t\right), \qquad \phi(n)=\sum_t \phi_t.$$9 with entanglement-minimized orbitals and an exact reference energy from previous literature. For $K_{ij} = [ij|ji].$0 with $K_{ij} = [ij|ji].$1, the paper chooses $K_{ij} = [ij|ji].$2 and $K_{ij} = [ij|ji].$3 and reports about an order-of-magnitude cost reduction. In terms of ansatz quality, $K_{ij} = [ij|ji].$4 beats standard MPS at the same $K_{ij} = [ij|ji].$5; at $K_{ij} = [ij|ji].$6, $K_{ij} = [ij|ji].$7 reaches chemical accuracy, while MPS needs roughly $K_{ij} = [ij|ji].$8 for comparable accuracy. $K_{ij} = [ij|ji].$9 slightly improves over $\chi$00. The correlators further improve results: cos-RBM with $\chi$01 gives about 1.7 mHa error at $\chi$02 and about 1.1 mHa error at $\chi$03, while Ising-RBM performs even better and reaches chemical accuracy at $\chi$04.

The three-dimensional hydrogen cluster $\chi$05 in a $\chi$06 geometry is studied at interatomic distance $\chi$07 in the STO-3G basis, with orbital ordering via Fiedler ordering and $\chi$08 for $\chi$09. For $\chi$10 with $\chi$11, the paper chooses $\chi$12 and $\chi$13, reports around 80-fold speedup, and states that the error is below 0.1 mHa. On top of $\chi$14 with $\chi$15, cos-RBM, Ising-RBM, Jastrow, and MLP-like correlators all improve accuracy, with Ising-RBM is best. Increasing $\chi$16 reduces error slightly, and for $\chi$17, cos-RBM and Ising-RBM nearly coincide. The topology study is especially central: MPS converges slowly and needs $\chi$18 for chemical accuracy; $\chi$19 is better than MPS but still converges slowly; $\chi$20 and $\chi$21 converge faster; and $\chi$22 reaches about 1.1 mHa error at $\chi$23, i.e. chemical accuracy. The paper also tests BDG(2)-TensorRNN, which achieves accuracy comparable to $\chi$24 at $\chi$25, but with a much smaller bond dimension $\chi$26 and fewer variational parameters.

Taken together, these results are used to support three claims internal to the paper: BDG-RNN is better than MPS at fixed bond dimension, graph topology matters for molecular structure, and tensor-term hybridization can compensate for lower graph degree.

7. Relation to adjacent methods, terminology, and limitations

Within neural quantum states, BDG-RNN differs from standard RNN-NQS by using a graph rather than only a chain, allowing multiple neighbors and non-adjacent orbital couplings, and optionally including higher-order tensor interactions. Relative to MPS and MPS-RNN, the stated narrative is that BDG-RNN keeps the MPS-like initialization and recurrent structure but improves over MPS by enabling graph-based nonlocal interactions. Relative to RBM-based ansatzes, the strategy is to use BDG-RNN as the main wavefunction and then multiply it by an RBM-inspired correlator to boost expressivity while keeping sampling and training compatible with VMC. The paper also explicitly notes that BDG-RNN is not framed as a standard graph neural network: it is a quantum wavefunction ansatz, its output must define a normalized amplitude and phase for a many-body state, it is integrated into autoregressive sampling and VMC, and it uses tensor-network-inspired memory updates with optional Tucker-compressed higher-order terms (Wu et al., 25 Jul 2025).

The term “BDG-RNN” also admits a broader architectural reading in graph representation learning. The GRED model in “Recurrent Distance Filtering for Graph Representation Learning” is described as a very natural example of a bounded-degree graph recurrent neural network, although the paper names the architecture Graph Recurrent Encoding by Distance and the key mechanism Recurrent Distance Filtering. There, the graph-to-sequence reduction constructs a bounded-length distance sequence for each target, and a recurrent model encodes that sequence; the boundedness comes from the maximum hop $\chi$27, which is a fixed hyperparameter or the graph diameter. In that sense, the architecture is a recurrent neural network operating over graph-derived sequences of bounded length, with recurrence used as the main long-range aggregator. The paper adds an important terminological qualification: in that setting, the “degree” is not node degree in the usual adjacency sense but the number of hop groups processed per target node (Ding et al., 2023).

The limitations acknowledged for the chemistry BDG-RNN are also explicit. Large-scale strongly correlated systems still require further improvements; memory and cost remain significant; more symmetry exploitation and mixed-precision schemes would help; advanced optimizers such as minimum-step stochastic reconfiguration may accelerate training; and further development of the PyNQS framework is suggested. This suggests that BDG-RNN is presented not as a closed solution to molecular NQS design, but as a structured and extensible ansatz family that connects MPS initialization, graph-based recurrence, correlator augmentation, and semistochastic VMC into a single framework.