Pith. sign in

REVIEW 2 cited by

A simple linear algebra identity to optimize Large-Scale Neural Network Quantum States

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.05715 v2 pith:JD46EQFD submitted 2023-10-09 cond-mat.str-el cond-mat.dis-nn

classification cond-mat.str-elcond-mat.dis-nn
keywords parametersquantumalgebrabeenchallengingdeepidentitylinear
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Neural-network architectures have been increasingly used to represent quantum many-body wave functions. These networks require a large number of variational parameters and are challenging to optimize using traditional methods, as gradient descent. Stochastic Reconfiguration (SR) has been effective with a limited number of parameters, but becomes impractical beyond a few thousand parameters. Here, we leverage a simple linear algebra identity to show that SR can be employed even in the deep learning scenario. We demonstrate the effectiveness of our method by optimizing a Deep Transformer architecture with $3 \times 10^5$ parameters, achieving state-of-the-art ground-state energy in the $J_1$-$J_2$ Heisenberg model at $J_2/J_1=0.5$ on the $10\times10$ square lattice, a challenging benchmark in highly-frustrated magnetism. This work marks a significant step forward in the scalability and efficiency of SR for Neural-Network Quantum States, making them a promising method to investigate unknown quantum phases of matter, where other methods struggle.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Testing Transformer Learnability on the Arithmetic Sequence of Rooted Trees

    cs.AI 2025-12 reject novelty 6.0 of 10

    A GPT-2 trained on the first 10^11 integers encoded as rooted-tree Dyck words reaches ~0.4 next-word accuracy, but the body does not contain the claimed controls or far-range test blocks.

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

    quant-ph 2025-06 conditional novelty 6.0 of 10

    SineKAN, a Kolmogorov-Arnold network with sinusoidal activations, accurately represents ground states of 1D spin chains and outperforms RBM, LSTM, and MLP neural quantum states in the J1-J2 model.

Pith tools