REVIEW 3 cited by
DMRG Approach to Optimizing Two-Dimensional Tensor 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
Tensor network algorithms have been remarkably successful solving a variety of problems in quantum many-body physics. However, algorithms to optimize two-dimensional tensor networks known as PEPS lack many of the aspects that make the seminal density matrix renormalization group (DMRG) algorithm so powerful for optimizing one-dimensional tensor networks known as matrix product states. We implement a framework for optimizing two-dimensional PEPS tensor networks which includes all of steps that make DMRG so successful for optimizing one-dimension tensor networks. We present results for several 2D spin models and discuss possible extensions and applications.
Forward citations
Cited by 3 Pith papers
-
Diagonal Isometric Form for Tensor Network States in Two Dimensions
A new isometric form for 2D tensor network states uses auxiliary tensors on a 45-degree rotated lattice, enabling a local Yang-Baxter move and a TEBD algorithm that captures area-law ground states and short-time dynamics.
-
Pauli propagation enables fast classical simulation of strongly correlated quantum systems
A classical algorithm combining sparse Pauli dynamics with a variational double bracket flow estimates ground-state energies of Heisenberg and Hubbard models with sub-1% error vs DMRG, with large speedups on some 2D systems.
-
Advantages of density in tensor network geometries for gradient based training
Densely connected tensor network geometries train to lower infidelity than sparse ones on random quantum states, and a new leaf-contraction trick reduces memory while improving training.
Discussion (0). Continue with ORCID to comment.