REVIEW 2 cited by
Predicting interacting Green's functions with neural networks
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
read the original abstract
Strongly correlated materials exhibit complex electronic phenomena that are challenging to capture with traditional theoretical methods, yet understanding these systems is crucial for discovering new quantum materials. Addressing the computational bottlenecks in studying such systems, we present a proof-of-concept machine learning-based approach to accelerate Dynamical Mean Field Theory (DMFT) calculations. Our method predicts interacting Green's functions on arbitrary two-dimensional lattices using a two-step ML framework. First, an autoencoder-based network learns and generates physically plausible band structures of materials, providing diverse training data. Next, a dense neural network predicts interacting Green's functions of these physically-possible band structures, expressed in the basis of Legendre polynomials. We demonstrate that this architecture can serve as a substitute for the computationally demanding quantum impurity solver in DMFT, significantly reducing computational cost while maintaining accuracy. This approach offers a scalable pathway to accelerate simulations of strongly correlated systems and lays the groundwork for future extensions to multi-band systems.
Forward citations
Cited by 2 Pith papers
-
Compact and Stable Representation of Real-Frequency Spectral Functions for Machine Learning
Cayley-mapped trigonometric moments with Jacobian give a fixed-dimensional, positivity-constrained ML target for real-frequency spectra that matches or beats dense-grid learning on DMFT and impurity benchmarks.
-
Linear Foundation Model for Quantum Embedding: Data-Driven Compression of the Ghost Gutzwiller Variational Space
A PCA-learned linear subspace of embedding-Hamiltonian ground states solves ghost-Gutzwiller embedding problems with exact-diagonalization accuracy but orders-of-magnitude lower cost, and transfers across lattices and...
Discussion (0). Continue with ORCID to comment.