Papers › Projected site-occupation embedding theory

Projected site-occupation embedding theory

15 Feb 2019arXiv:1902.05747links table onlyarchive 2025-07-28

Bruno Senjean

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Site-occupation embedding theory (SOET) [B. Senjean et al., Phys. Rev. B 97, 235105 (2018)] is an in-principle exact embedding method combining wavefunction theory and density functional theory that gave promising results when applied to the one-dimensional Hubbard model. Despite its overall good performance, SOET faces a computational cost problem as its auxiliary impurity-interacting system remains the size of the full system (which is problematic as the computational cost increases exponentially with system size). In this work, this issue is circumvented by employing the Schmidt decomposition, thus leading to a drastic reduction of the computational cost while retaining the same accuracy. We show that this projected version of SOET (P-SOET) is competitive with other embedding techniques such as density matrix embedding theory (DMET) [G. Knizia and G. K-L. Chan, Phys. Rev. Lett. 109, 186404 (2012)]. In contrast to the latter, density functional contributions come naturally into play in P-SOET's framework without any additional computational cost or double counting effect. As an important result, the density-driven Mott-Hubbard transition (which is displayed by multiple impurity sites in DMET or in dynamical mean-field theory) is well described, for the first time, with a single impurity site.

PaperPDFCode

Code

bsenjean/P-SOET officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections