betaFeedback

Reading v1View latest version

WorksPhysics and Astronomy

Foundation Tensor Networks Generalize Across Quantum Lattice Systems

Abstract

Neural quantum states and tensor networks have emerged as leading techniques for simulating quantum many-body systems. However, disordered systems remain extremely challenging in both frameworks as they require computation of the ground state for every realization of the disorder. Recently, neural quantum states have been used to construct foundation models that generate the ground state directly from the Hamiltonian. Still, they are hindered by the need to perform extensive sampling to estimate observables. To address these difficulties, we introduce the foundation tensor network (FTN), which uses a neural network to generate the tensor network representation of the ground-state wavefunction from the Hamiltonian. To accelerate training, we develop a technique, called GridBP, based on iterated one-dimensional belief propagation that reduces the cost of computing the energy expectation value to just two tensor contractions. We use FTNs to calculate the critical parameters of the glass transition in the quantum Edwards-Anderson model via finite-size scaling analysis. To facilitate rapid averaging, we use a moment-generating function to evaluate the order parameter, lowering the cost to a single tensor contraction. We obtain high-fidelity estimates for the critical parameters by averaging over 500,000 disorder realizations.

Introduction

Examining zero-temperature critical phenomena in disordered systems is among the most theoretically interesting problems in quantum statistical mechanics due to the complex phase behavior of these systems arising from quantum, rather than thermal, fluctuations. Spin glasses are archetypal systems in the study of disordered and glassy critical phenomena [1]. In these systems, quenched disorder that persists over extremely long time scales generates a glassy phase where spins are frozen in a random but ordered state that is neither ferromagnetic nor antiferromagnetic [2, 3]. Here, a central problem is to understand the physics of how spin glasses exit the glassy phase into other disordered phases. The Edwards-Anderson transverse-field quantum Ising (EA-TFQIM) model, examined in this paper, is a paradigmatic disordered system that undergoes a transition from a glassy to a disordered paramagnetic phase as the strength of the transverse field increases [4].

Simulating quantum spin glasses requires gathering statistics over many ground states generated by different realizations of the disorder, making it one of the most challenging problems in computational physics. The direct approach of exactly diagonalizing [5] the Hamiltonian is intractable for systems of even moderate size, making Monte Carlo methods the dominant technique [6, 7, 8, 9, 10]. One such approach [6] converts the system from a dd-dimensional quantum system to a (d+1)(d+1)-dimensional classical system by employing a Trotter decomposition in imaginary time [11]. To understand quantum phase transitions, classical Monte Carlo methods must approach the limit of infinite inverse temperature, which imposes increasing computational costs.

Variational Monte Carlo [12, 13] (VMC), meanwhile, optimizes a trial wavefunction by drawing samples from the corresponding Born rule distribution. VMC incurs both sampling and optimization costs to converge the variational ansatz to the ground state. Applying these methods to quantum spin glasses is computationally prohibitive as they require two layers of averaging: disorder and quantum. One must first find the ground state for each realization of the disorder and then draw samples from that wavefunction to estimate observables. Neural network parametrization of the variational wavefunction within VMC defines the emerging framework of neural quantum states (NQS) [14, 15]. Recent work shows that NQS can act as foundation models for a range of Hamiltonians [16], reducing the need to optimize the trial wavefunction for each realization of the disorder. However, one must still perform extensive sampling to obtain accurate estimates of observables from an NQS.

Tensor networks define a prominent alternative to Monte Carlo for quantum many-body simulations [17]. They encode the wavefunction as a tensor network state (TNS), a contraction of tensor cores arranged in a network that mirrors the topology of the system they represent. The central advantage is that observables can be computed deterministically as tensor contractions. The TNS representation of a ground state can be obtained by directly optimizing the tensor cores to minimize the variational energy [18], cooling the state through imaginary-time evolution [19], or evaluating the partition function for the (d+1)(d+1)-dimensional classical system [20]. Tensor networks have proven effective for computing properties of lattice systems, such as the quantum Ising and Heisenberg models [21], among a range of other applications [22, 23, 24, 25, 26, 27]. Provided that contraction is feasible [28] for a given lattice, the primary cost of tensor networks lies in finding the ground state. Recent work has also combined tensor networks with both VMC and NQS [29, 30]. methods. However, these approaches, although highly accurate and expressive, still employ Monte Carlo sampling to estimate observables and suffer from the usual sampling costs.

In this paper, we introduce a methodological framework called foundation tensor networks (FTNs) that combines the strengths of NQS and TNS. FTNs learn a foundation model for the tensor network cores that generalizes across Hamiltonians. In contrast to other hybridizations of neural and tensor networks, the wavefunction returned by the FTN is fundamentally a TNS. We use a transformer [31] to directly generate the tensor network representation of the ground state from a graph embedding of the Hamiltonian. In disordered systems, this circumvents the need to find the ground state for each sample, amortizing the optimization work. To demonstrate FTNs, we train a foundation model to produce the ground states of the EA-TFQIM as a function of the transverse field and all site-site couplings. We use this to examine the transition from the low-field glassy phase to the high-field disordered phase. Directly averaging the one-shot ground states across realizations of the disorder enables us to compute the critical parameters via finite-size scaling analysis [32]. We obtain estimates that match and refine results in the literature, which have significant uncertainty, demonstrating that FTNs are a powerful new tool for exploring critical phenomena.

The Quantum Edwards-Anderson Model

We study the critical phenomena of the EA-TFQIM on a square L×LL \times L two-dimensional lattice with N=L2N = L^2 sites and open boundary conditions. Its Hamiltonian takes the form

H(J)=∑⟨a,a′⟩Ja,a′ZaZa′+Γ∑aXa(1)\mathcal{H}(\boldsymbol{J}) = \sum_{\langle a,a'\rangle} J_{a,a'} Z_a Z_{a'} + \Gamma\sum_a X_a \tag*{(1)}

where XaX_a and ZaZ_a are Pauli operators acting on spin aa, Ja,a′J_{a,a'} is the coupling between sites aa and a′a', and Γ\Gamma is the transverse field. The first sum runs over unordered nearest-neighbor pairs. The couplings Ja,a′J_{a,a'} are i.i.d. Gaussian random variables with unit variance and zero mean, Ja,a′∼N(0,1)J_{a,a'} \sim\mathcal{N}(0,1). All units in this study are nondimensionalized in terms of a natural coupling scale that coincides with the width of the coupling distribution.

Each set of random couplings J={Ja,a′}\boldsymbol{J} = \{J_{a,a'}\} generates a different ground-state wavefunction that minimizes the Rayleigh quotient

∣ΨJ⟩∈argmin⁡∣Ψ⟩ ⟨Ψ∣H(J)∣Ψ⟩⟨Ψ∣Ψ⟩.(2)|\Psi_{\boldsymbol{J}}\rangle\in\underset{|\Psi\rangle}{\operatorname{argmin}}\ \frac{\langle\Psi|\mathcal{H}(\boldsymbol{J})|\Psi\rangle}{\langle\Psi|\Psi\rangle}. \tag*{(2)}

At zero temperature, the EA-TFQIM exhibits a quantum phase transition mediated by the transverse field. At ΓC\Gamma_C the system transitions from a glassy phase to a paramagnetic phase. The order parameter for the transition is the replica overlap

Q=1N2EJ[∑a,a′⟨ZaZa′′⟩J2],(3)Q = \frac{1}{N^2}\mathbb{E}_{\boldsymbol{J}}\left[\sum_{a,a'}\langle Z_a Z_{a'}'\rangle_{\boldsymbol{J}}^2\right], \tag*{(3)}

where ⟨⋅⟩J\langle\cdot\rangle_{\boldsymbol{J}} denotes a quantum average taken with respect to the ground state with the couplings J\boldsymbol{J}.

Amortized Disorder Sampling

To accelerate averaging over the disorder, we learn a mapping between the parameters of the Hamiltonian and a representation of the ground-state wavefunction. Then we can average over the disorder by directly generating wavefunctions from the disorder samples via the learned mapping. The process of learning the mapping over the entire distribution of Hamiltonians amortizes the computational effort compared to optimizing a trial state for each sample individually. We call this amortized disorder sampling. A transformer provides an expressive ansatz to learn the mapping, and the projected entangled pair state (PEPS) enables us to efficiently represent the wavefunction and measure observables without an additional step of sampling from the Born distribution. Here, we develop a method to perform amortized disorder sampling using FTNs.

We first expand the wavefunction in the computational basis

∣Ψ⟩=∑σCσ∣σ⟩,(4)|\Psi\rangle= \sum_{\boldsymbol{\sigma}} C_{\boldsymbol{\sigma}} |\boldsymbol{\sigma}\rangle, \tag*{(4)}

where σ=(σ1,…,σN)\boldsymbol{\sigma} = (\sigma_1,\ldots,\sigma_N) is the spin index, C\mathcal{C} is the coefficient tensor, and ∣σ⟩|\boldsymbol{\sigma}\rangle is the tensor product computational basis state. Next, we encode the coefficient tensor as a projected entangled pair state (PEPS) [33] of the form

Cσ=tTr⁡[∏n=1NTn(σn)],(5)C_{\boldsymbol{\sigma}} = \operatorname{tTr}\left[\prod_{n=1}^{N} \mathcal{T}_n(\sigma_n)\right], \tag*{(5)}

where {Tn}n=1N\{\mathcal{T}_n\}_{n=1}^{N} are the tensor cores, and tTr⁡[⋅]\operatorname{tTr}[\cdot] is the tensor trace that sums over virtual indices of connected cores.

Instead of optimizing the PEPS directly, we use a transformer-based neural network to learn the mapping between Hamiltonian parameters and tensor cores. We embed information about each site, including local couplings, the transverse field, and position, into a series of NN tokens Ξ={ξn}n=1N\boldsymbol{\Xi} = \{\boldsymbol{\xi}_n\}_{n=1}^{N}. After passing the tokens through the generator Gθ\mathcal{G}_{\theta}, a series of transformer blocks, we obtain a set of latent states representing the approximate ground state of the input Hamiltonian: Ξ′=Gθ(Ξ)\boldsymbol{\Xi}' = \mathcal{G}_{\theta}(\boldsymbol{\Xi}), where θ\theta are the parameters. The readout, Rθ\mathcal{R}_{\theta}, a multilayer perceptron, then converts each token into a tensor core Tn=Rθ(ξn′)\mathcal{T}_n = \mathcal{R}_{\theta}(\boldsymbol{\xi}'_n).

We construct the generator from a series of transformer blocks [31] of the form

Uθ(Ξ)=[(Pθ∘Nθ+I)∘(Aθ∘Nθ+I)](Ξ),(6)U_\theta(\Xi) = [(\mathcal{P}_\theta\circ\mathcal{N}_\theta+ \mathcal{I}) \circ(\mathcal{A}_\theta\circ\mathcal{N}_\theta+ \mathcal{I})](\Xi), \tag*{(6)}

where N\mathcal{N}, I\mathcal{I}, P\mathcal{P}, and A\mathcal{A} denote layer normalization [34], the identity map, a multi-layer perceptron (MLP), and multi-head self-attention (MSA), respectively. The MSA layer takes the form

[Aθ(Ξ)]i=∥h=1NHMh[∑j=1Nexp⁡(ξiTShξj)∑k=1Nexp⁡(ξiTShξk)ξj],(7)[\mathcal{A}_\theta(\Xi)]_i = \mathbin{\|}_{h=1}^{N_H} M_h \left[\sum_{j=1}^{N} \frac{\exp(\xi_i^{T} S_h \xi_j)}{\sum_{k=1}^{N}\exp(\xi_i^{T} S_h \xi_k)} \xi_j \right], \tag*{(7)}

where NHN_H is the number of attention heads, MhM_h and ShS_h are learnable matrices indexed for each attention head hh, and ∥\| denotes vector concatenation. To form the generator, we compose these transformer blocks

Gθ(Ξ)=(UθNL∘⋯∘Uθ1)(Ξ),(8)\mathcal{G}_\theta(\Xi) = (U_{\theta_{N_L}} \circ\cdots\circ U_{\theta_1})(\Xi), \tag*{(8)}

where NLN_L is the number of layers.

The combination of the transformer and tensor network forms an FTN, which we denote as ∣Ψθ(Ξ)⟩\lvert\Psi_\theta(\Xi)\rangle. We train the generator and readout to minimize the average energy over a collection of Hamiltonians [16]

θ∗∈argmin⁡θEΞ[⟨Ψθ(Ξ)∣H(J)∣Ψθ(Ξ)⟩⟨Ψθ(Ξ)∣Ψθ(Ξ)⟩].(9)\theta^* \in\operatorname*{argmin}_{\theta} \mathbb{E}_{\Xi} \left[\frac{\langle\Psi_\theta(\Xi)\lvert H(J)\rvert\Psi_\theta(\Xi)\rangle}{\langle\Psi_\theta(\Xi)\lvert\Psi_\theta(\Xi)\rangle}\right]. \tag*{(9)}

Once trained, the FTN enables us to compute quantities like the overlap parameter in Eq. (3) directly by evaluating the neural network and contracting the resulting PEPS.

Grid Belief Propagation

An essential ingredient in the feasibility of FTNs is fast training. At each training step, we must evaluate the energy and its gradient with respect to the parameters θ\theta. Both require one or more contractions, which are significantly more expensive than performing inference on the transformer. This makes the contraction step the computationally limiting factor. Thus, we attempt to minimize the number of contraction steps. There are several ways to compute the energy expectation value with a PEPS. One is to form a projected entangled pair operator (PEPO) representation of the Hamiltonian [21]. Another is to use linearity and evaluate the Hamiltonian term by term. The former requires enlarging the bond dimension, which is undesirable due to the high cost of PEPS contraction [35], and the latter scales quadratically with the number of sites. Inspired by belief propagation algorithms for tensor networks [36, 37], we derive a method called grid belief propagation (GridBP) that enables us to compute the energy and its gradient, via automatic differentiation, with only two contractions and no increase in the bond dimension.

Consider a general product of states, ⟨ϕ~∣\langle\tilde{\phi}\rvert and ∣ϕ⟩\lvert\phi\rangle, and operators, {Om}m=1M\{O_m\}_{m=1}^{M}, of the form

z=⟨ϕ~∣∏m=1MOm∣ϕ⟩.(10)z = \langle\tilde{\phi}\rvert\prod_{m=1}^{M} O_m \lvert\phi\rangle. \tag*{(10)}

By defining messages with a recursion relation of the form

∣μn⟩=On∣μn+1⟩,n≤M(11)\lvert\mu_n\rangle= O_n\lvert\mu_{n+1}\rangle,\quad n \le M \tag*{(11)}
⟨μ~n∣=⟨μ~n−1∣On,n≥1,(12)\langle\tilde{\mu}_n\rvert= \langle\tilde{\mu}_{n-1}\rvert O_n,\quad n \ge1, \tag*{(12)}

where ∣μM+1⟩=∣ϕ⟩\lvert\mu_{M+1}\rangle= \lvert\phi\rangle and ⟨μ~0∣=⟨ϕ~∣\langle\tilde{\mu}_0\rvert= \langle\tilde{\phi}\rvert, we can isolate a particular operator at position n=1,…,Mn=1,\ldots,M via

z=⟨μ~n−1∣On∣μn+1⟩.(13)z = \langle\tilde{\mu}_{n-1}\rvert O_n \lvert\mu_{n+1}\rangle. \tag*{(13)}

We can exploit this relation to isolate pairs of sites in a PEPS contraction and obtain the two-body environment tensor

Ea,a′=(∂Ta⊗∂Ta′)ZΨ,(14)\mathcal{E}_{a,a'} = (\partial_{T_a} \otimes\partial_{T_{a'}})\mathcal{Z}_\Psi, \tag*{(14)}

which is sufficient to compute the energy contribution of any two-body term. Here ZΨ=⟨Ψ∣Ψ⟩\mathcal{Z}_\Psi= \langle\Psi\lvert\Psi\rangle is the bilayer network, cf. Figure 1 (a), and Ta=∑σTa(σ)⊗Ta(σ)\mathbb{T}_a = \sum_\sigma\mathbb{T}_a(\sigma) \otimes T_a(\sigma) is the core bra-ket pair at site aa. We first isolate a column at nn:

Figure 1. An illustration of the GridBP method for computing the two-body environment tensor. We select a pair of cores in the bilayer network (a) and isolate their column using a first round of message passing left and right between columns (b). Then, from the MPS-MPO-MPS product, we isolate their rows via a second round of message passing up and down the network (c). Finally, we differentiate the resulting 3×43 \times4 network with respect to TaT_a and Ta′T_{a'} to obtain the two-body environment tensor.

ZΨ=⟨ν~n−1∣Cn∣νn+1⟩,(15)\mathcal{Z}_\Psi= \langle\tilde{\nu}_{n-1}\rvert C_n \lvert\nu_{n+1}\rangle, \tag*{(15)}

where CnC_n is the matrix product operator (MPO) for column nn and ⟨ν~n∣\langle\tilde{\nu}_n\rvert and ∣νn⟩\lvert\nu_n\rangle are matrix product states (MPS), cf. Figure 1 (b). Next, we isolate a pair of rows in the MPS-MPO-MPS product at sites n′n' and n′+1n'+1 in column nn, Figure 1 (c),

ZΨ=⟨τ~n′−1n∣Rn′nRn′+1n∣τn′+2n⟩.(16)\mathcal{Z}_\Psi= \langle\tilde{\tau}_{n'-1}^{n}\rvert R_{n'}^{n} R_{n'+1}^{n} \lvert\tau_{n'+2}^{n}\rangle. \tag*{(16)}

Rn′nR_{n'}^{n} and Rn′+1nR_{n'+1}^{n} are the row MPOs. ∣τn′+2n⟩\lvert\tau_{n'+2}^{n}\rangle and ⟨τ~n′−1n∣\langle\tilde{\tau}_{n'-1}^{n}\rvert are the column matrix product states. Finally, we take derivatives with respect to the cores to generate the two-body environment tensor

Ea,a′=⟨τ~n′−1n∣∂TaRn′n⊗∂Ta′Rn′+1n∣τn′+2n⟩,(17)\mathcal{E}_{a,a'} = \langle\tilde{\tau}_{n'-1}^{n}\rvert\partial_{T_a} R_{n'}^{n} \otimes\partial_{T_{a'}} R_{n'+1}^{n} \lvert\tau_{n'+2}^{n}\rangle, \tag*{(17)}

where a=(n,n′)a=(n,n') and a′=(n,n′+1)a'=(n,n'+1). The one-body environment follows similarly. By iterating both recursion relations, we obtain all one-body and two-body environments along all columns. Performing the same procedure on the transposed network generates the two-body environments along all rows. Because the messages are cached in each stage, this procedure has the same cost as two contractions of the bilayer PEPS.

Replica Moment-Generating Functions

Computing the overlap parameter (3) requires computing correlations over all pairs of sites. Naively, this would necessitate O(N2)O(N^2) contractions. To avoid this, we use an approach based on replica moment-generating functions (MGFs). To handle the quadratic dependence on the correlation matrix, we introduce a replica wavefunction ∣Ψ^⟩=∣Ψ⟩⊗∣Ψ⟩\lvert\hat{\Psi}\rangle= \lvert\Psi\rangle\otimes\lvert\Psi\rangle and a Pauli-Z operator Z^a=Za⊗Za\hat{Z}_a = Z_a \otimes Z_a. This reduces the per-sample overlap parameter to

q=1N2∑a,a′⟨Z^aZ^a′⟩Ψ^,(18)q = \frac{1}{N^2} \sum_{a,a'} \langle\hat{Z}_a \hat{Z}_{a'} \rangle_{\hat{\Psi}}, \tag*{(18)}

where ⟨⋅⟩Ψ^\langle\cdot\rangle_{\hat{\Psi}} denotes the average taken with respect to the replica wavefunction, and Q=EJ[q]Q = \mathbb{E}_J[q]. Then its MGF is

M(λ)=⟨exp⁡(λTZ^)⟩Ψ^,(19)\mathcal{M}(\lambda) = \left\langle\exp\left(\lambda^{\mathsf{T}}\hat{Z}\right) \right\rangle_{\hat{\Psi}}, \tag*{(19)}

where λ={λa}a=1N\lambda= \{\lambda_a\}_{a=1}^{N} are the MGF parameters, and Z^={Z^a}a=1N={Za⊗Za}a=1N\hat{Z} = \{\hat{Z}_a\}_{a=1}^{N} = \{Z_a \otimes Z_a\}_{a=1}^{N} is a vector of replica Pauli-Z products. The overlap parameter reduces to

q=1N2∑a,a′∂λa∂λa′M(λ)∣λ=0.(20)q = \frac{1}{N^2} \sum_{a,a'} \left. \partial_{\lambda_a} \partial_{\lambda_{a'}} \mathcal{M}(\lambda) \right|_{\lambda=0}. \tag*{(20)}

We can transform this into a form that requires a single contraction using the Hessian-vector product trick:

q=1N2∂α1∂α2M([α1+α2]1)∣(α1,α2)=(0,0),(21)q = \frac{1}{N^2} \left. \partial_{\alpha_1} \partial_{\alpha_2} \mathcal{M}\left([\alpha_1+\alpha_2]\mathbf{1}\right) \right|_{(\alpha_1,\alpha_2)=(0,0)}, \tag*{(21)}

where 1∈RN\mathbf{1} \in\mathbb{R}^{N} is the all-ones vector. This only costs one evaluation of M\mathcal{M} under automatic differentiation.

Training and Validation

To train the FTN, we perform transfer learning across system sizes from L=2L = 2 to L=10L = 10. At each stage, the FTN is exposed only to systems of the new size. We use a single architecture for all sizes, with four transformer blocks of embedding width 64, eight attention heads, and an MLP with a single hidden layer of width

256 and GELU activation in each transformer block, and a readout MLP with two hidden layers of width 128 and tanh activations. At each size, we optimize the multi-Hamiltonian objective in Eq. (9) using 250,000 steps of Adam [38] with a cosine annealing [39] schedule from 10−310^{-3} to 10−610^{-6}.

For each step, we draw a new set of fields from a uniform distribution Γ∼U(1.5,2.5)\Gamma\sim U(1.5, 2.5) and disorder samples from the normal distribution mentioned above with a batch size of four. We compute the gradient with respect to the parameters via automatic differentiation of the energy computed by GridBP. In all cases, we use a bond dimension of χ=2\chi= 2 and a bond dimension cutoff of χmax⁡=16\chi_{\max} = 16 during contraction. To lower computational costs and avoid instabilities in the SVD during automatic differentiation [18], we use randomized QRbased rounding [40]. We find that each successive size benefits significantly from the last and that only a few steps of additional training are needed to bring the error into an acceptable range, cf. Figure 2. This demonstrates the ability of the FTN to generalize across system sizes. We compare FTN results with exact diagonalization results at L=4L = 4 and with DMRG results for 5≤L≤85 \le L \le8. We performed the entire training run on a single Nvidia A100 GPU in approximately 52 hours.

Figure 2. Convergence of energy and overlap parameter error during training. “Steps” denotes the total number of steps accumulated across all training phases. Dotted vertical lines denote transfer learning to a new system size.

We validate the FTN model by comparing it to brute-force DMRG [41], as well as imaginary-time evolution using simple update (SU) [21]. We run SU with a decreasing time-step schedule from 0.1 to 10−710^{-7} and values of χ\chi and χmax⁡\chi_{\max} matching those of the FTN. At each time-step size, convergence is determined by an absolute change in energy per site below 10−810^{-8} for three consecutive checks, performed every 100 evolution steps. Similarly, we run DMRG sweeps at a maximum bond dimension of χmax⁡=1024\chi_{\max} = 1024, with convergence determined by an absolute change in total energy below 10−1110^{-11} between successive sweeps. For the FTN, we compare the ground states generated directly from inference and after ten additional fine-tuning steps of energy optimization at a learning rate of 10−310^{-3}. We measure the time required for each algorithm to generate its approximate ground state. We find that the FTN without post-inference optimization is as accurate as or more accurate than SU in almost all cases, cf. Figure 3(a),(Figure 3b), and is also faster, cf. Figure 3(c). Moreover, we observe that post-inference optimization of the FTN output does not significantly improve results, suggesting that the PEPS output by the FTN for each disorder realization is already near-optimal for its bond dimension.

Figure 3. Comparison of FTNs (with and without post-inference optimization), DMRG, and simple update (SU). Mean and maximum errors are denoted by closed and open markers, respectively. (a) Energy error vs. system size. (b) Overlap parameter (3) error vs. system size. (c) Wall time to compute the approximate ground state.

The Glass Transition

To study the critical phenomena of the EA-TFQIM, we use our FTN model to compute over 500,000 ground

ParameterEstimate95% CI
ΓC\Gamma_C2.121[2.115, 2.126]
1/ν1/\nu1.128[1.104, 1.151]
bqb_q1.918[1.914, 1.921]

Table 1. Critical parameters of the glass transition obtained from finite-size scaling analysis.

states for different realizations of the disorder. This was possible using eight A6000 GPUs in roughly 24 hours since our combined methodology is able to generate a PEPS, fine-tune it, and measure its overlap parameter (Eq. (3)) in under three seconds per sample. Indeed, we compute each overlap parameter using the replica MGF method, applied to the FTN output after post-inference optimization.

The transition is characterized by three critical parameters: ΓC\Gamma_{\mathrm{C}}, the critical field at which the transition occurs; ν\nu, the scaling exponent of the correlation length; and bqb_q, the scaling exponent of the order parameter. We use finite-size scaling (FSS) analysis to determine the critical parameters, cf. Figure 4. FSS posits that the rescaled curves LbqQ(Γ,L)L^{b_q}Q(\Gamma,L) should collapse to a single curve when plotted against S(Γ,L)S(\Gamma,L). A widely used FSS ansatz for the curve is

Figure 4. Collapse of the rescaled overlap parameter to a single curve under finite-size scaling.

Q(Γ,L)=L−bq[c0+c1S(Γ,L)+c2S2(Γ,L)],(22)Q(\Gamma,L)=L^{-b_q}\left[c_0+c_1S(\Gamma,L)+c_2S^2(\Gamma,L)\right], \tag*{(22)}

under the transformation

S(Γ,L)=(Γ−ΓC)L1/ν,(23)S(\Gamma,L)=(\Gamma-\Gamma_{\mathrm{C}})L^{1/\nu}, \tag*{(23)}

where c0c_0, c1c_1, and c2c_2 are coefficients. We fit the curves using nonlinear least squares from 128 random starts and estimate the 95% confidence intervals (CIs) by drawing 1024 bootstrapped samples with replacement.

Our results, reported in Table I, are in close agreement with other studies of the EA-TFQIM [6, 7, 42]. The large number (7168) of samples per point enables us to obtain narrow CIs quantifying uncertainty due to disorder under our model assumptions.

Acknowledgments

This work was supported by the U.S. Department of Energy, Office of Science, Accelerated Research in Quantum Computing Centers, Quantum Utility through Advanced Computational Quantum Algorithms, grant no. DE-SC0025572.

References

References

  1. [1]T. Castellani and A. Cavagna, Spin-glass theory for pedestrians, J. Stat. Mech. 2005, P05012 (2005).DOI
  2. [2]K. Binder and A. P. Young, Spin glasses: Experimental facts, theoretical concepts, and open questions, Rev. Mod. Phys. 58, 801 (1986).DOI
  3. [3]S. F. Edwards and P. W. Anderson, Theory of spin glasses, J. Phys. 5, 965 (1975).
  4. [4]H. Rieger and A. P. Young, Zero-temperature quantum phase transition of a two-dimensional ising spin glass, Phys. Rev. Lett. 72, 4141 (1994).DOI
  5. [5]H. Q. Qin, Exact diagonalization of quantum-spin models, Phys. Rev. B Condens. Matter 42, 6561 (1990).pubmed.ncbi.nlm.nih.gov/9994743
  6. [6]I. González-Adalid Pemartín, V. Martín-Mayor, and G. Parisi, The quantum transition of the two-dimensional ising spin glass, Nature (2024).DOI
  7. [7]L. Brolodoni and S. Pilati, Zero-temperature monte carlo simulations of two-dimensional quantum spin glasses guided by neural network states, Phys. Rev. E 110, 065305 (2024).DOI
  8. [8]P. Lunts, M. S. Albergo, and M. Lindsey, Non-hertz-millis scaling of the antiferromagnetic quantum critical metal via scalable hybrid monte carlo, Nat. Commun. 14, 2547 (2023).DOI
  9. [9]A. A. Patel, P. Lunts, and S. Sachdev, Localization of overdamped bosonic modes and transport in strange metals, Proc. Natl. Acad. Sci. U. S. A. 121, e2402052121 (2024).DOI
  10. [10]A. A. Patel, P. Lunts, and M. S. Albergo, Strange metals and planckian transport in a gapless phase from spatially random interactions, Phys. Rev. X 15, 031064 (2025).DOI
  11. [11]M. Suzuki, Relationship between d-dimensional quantum spin systems and (d+1)-dimensional ising systems: Equivalence, critical exponents and systematic approximants of the partition function and spin correlations, Prog. Theor. Phys. 56, 1454 (1976).
  12. [12]S. Sorella, Wave function optimization in the variational monte carlo method, Phys. Rev. B Condens. Matter Mater. Phys. 71, 10.1103/physrevb.71.241103 (2005).DOI
  13. [13]A. W. Sandvik and G. Vidal, Variational quantum monte carlo simulations with tensor-network states, Phys. Rev. Lett. 99, 220602 (2007).DOI
  14. [14]G. Carleo and M. Troyer, Solving the quantum many-body problem with artificial neural networks, Science 355, 602 (2017).DOI
  15. [15]H. Lange, A. Van de Walle, A. Abendinia, and A. Bohrdt, From architectures to applications: a review of neural quantum states, Quantum Sci. Technol. 9, 040501 (2024).arxiv.org/abs/2402.09402
  16. [16]R. Rende, L. L. Viteritti, F. Becca, A. Scardicchio, A. Laio, and G. Carleo, Foundation neural-networks quantum states as a unified ansatz for multiple hamiltonians, Nat. Commun. 16, 7213 (2025).DOI
  17. [17]R. Orús, Tensor networks for complex quantum systems, Nature Reviews Physics 1, 538 (2019).DOI
  18. [18]H.-J. Liao, J.-G. Liu, L. Wang, and T. Xiang, Differentiable programming tensor networks, Phys. Rev. X. 9, 10.1103/physrevx.9.031041 (2019).DOI
  19. [19]G. Vidal, Efficient simulation of one-dimensional quantum many-body systems, Phys. Rev. Lett. 93, 040502 (2004).DOI
  20. [20]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. B Condens. Matter Mater. Phys. 86, 045139 (2012).DOI
  21. [21]M. Lubasch, J. I. Cirac, and M.-C. Baňuls, Algorithms for finite projected entangled pair states, Phys. Rev. B Condens. Matter Mater. Phys. 90, 10.1103/physrevb.90.064425 (2014).DOI
  22. [22]R. T. Grimm, A. J. Staat, and J. D. Eaves, The integral decimation method for quantum dynamics and statistical mechanics, Quantum 10, 2064 (2026), 2506.11341v4.DOI
  23. [23]R. T. Grimm and J. D. Eaves, Direct numerical solutions to stochastic differential equations with multiplicative noise, Phys. Rev. Lett. 132, 267101 (2024).arxiv.org/abs/2312.05507
  24. [24]R. T. Grimm and J. D. Eaves, Accurate numerical simulations of open quantum systems using spectral tensor trains, J. Chem. Phys. 161, 234111 (2024).arxiv.org/abs/2407.11327
  25. [25]A. Strathearn, P. Kirton, D. Kilda, J. Keeling, and B. W. Lovett, Efficient non-markovian quantum dynamics using time-evolving matrix product operators, Nat. Commun. 9, 3322 (2018).DOI
  26. [26]G. Park, N. Ng, D. R. Reichman, and G. K.-L. Chan, Tensor network inference functionals in the continuous-time limit: Connections to quantum embedding, bath discretization, and higher-order time propagation, Phys. Rev. B 110, 045104 (2024).DOI
  27. [27]G. K.-L. Chan and S. Sharma, The density matrix renormalization group in quantum chemistry, Annu. Rev. Phys. Chem. 62, 465 (2011).DOI
  28. [28]N. Schuch, M. M. Wolf, F. Verstraete, and J. I. Cirac, Computational complexity of projected entangled pair states, Phys. Rev. Lett. 98, 140506 (2007).pubmed.ncbi.nlm.nih.gov/17501258
  29. [29]S.-J. Du, A. Chen, and G. K.-L. Chan, Neuralized fermionic tensor networks for quantum many-body systems, Phys. Rev. B 113, 10.1103/x8vI-qf14 (2026).DOI
  30. [30]Z. Chen, L. Newhouse, E. Chen, D. Luo, and M. Soljačić, ANTN: Bridging autoregressive neural networks and tensor networks for quantum many-body simulation, arXiv [quant-ph] (2023), arXiv:2304.01996 [quant-ph].arxiv.org/abs/2304.01996
  31. [31]A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, and I. Polosukhin, Attention is all you need, Adv. Neural Inf. Process. Syst. 30 (2017).arxiv.org/abs/1706.03762
  32. [32]J. Houdayer and A. Hartmann, Low-temperature behavior of two-dimensional gaussian ising spin glasses, Phys. Rev. B Condens. Matter Mater. Phys. 70, 014418 (2004).DOI
  33. [33]J. I. Cirac, D. Pérez-García, N. Schuch, and F. Verstraete, Tensor product states and projected entangled pair states: Concepts, symmetries, theorems, Rev. Mod. Phys. 93, 045003 (2021).DOI
  34. [34]J. L. Ba, J. R. Kiros, and G. E. Hinton, Layer normalization, arXiv [stat.ML] 10.48550/arXiv.1607.06450 (2016), arXiv:1607.06450 [stat.ML].
  35. [35]M. Lubasch, J. I. Cirac, and M.-C. Baňuls, Unifying projected entangled pair state contractions, New J. Phys. 16, 033014 (2014).DOI
  36. [36]R. Alkabetz and I. Arad, Tensor networks contraction and the belief propagation algorithm, Phys. Rev. Res. 3, 023073 (2021).DOI
  37. [37]G. Evenbly, N. Pancotti, A. Milsted, J. Gray, and G. K.-L. Chan, Loop series expansions for tensor networks, Phys. Rev. Res. 8, 013245 (2026).
  38. [38]D. P. Kingma and J. Ba, Adam: A method for stochastic optimization, arXiv [cs.LG] (2014), arXiv:1412.6980 [cs.LG].arxiv.org/abs/1412.6980
  39. [39]I. Loshchilov and F. Hutter, SGDR: Stochastic gradient descent with warm restarts, arXiv [cs.LG] (2016), arXiv:1608.03983 [cs.LG].arxiv.org/abs/1608.03983
  40. [40]H. Al Daas, G. Ballard, P. Cezeaux, E. Hallman, A. Miedlar, M. Pasha, T. W. Reid, and A. K. Saibaba, Randomized algorithms for rounding in the tensor-train format, SIAM J. Sci. Comput. 45, A74 (2023).arxiv.org/abs/2110.04393
  41. [41]S. R. White, Density matrix formulation for quantum renormalization groups, Phys. Rev. Lett. 69, 2863 (1992).pubmed.ncbi.nlm.nih.gov/10046608
  42. [42]A. D. King, J. Raymond, T. Lanting, R. Harris, A. Zucca, F. Altomare, A. J. Berkley, K. Boothby, S. Ejetemaee, C. Enderud, E. Hoskinson, S. Huang, E. Ladizinsky, A. J. R. MacDonald, G. Marsden, R. Molavi, T. Oh, G. Poulin-Lamarre, M. Reis, C. Rich, Y. Sato, N. Tsai, M. Volkmann, J. D. Whittaker, Y. Yao, A. W. Sandvik, and M. H. Amin, Quantum critical dynamics in a 5,000-qubit programmable spin glass, Nature 617, 61 (2023).DOI

Paper details

vlnc:W_qsk3ed85
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents