TNPA uses tensor-network contractions only in a reliable temperature window to seed population annealing, with an effective-sample-size diagnostic to pick the switch-over temperature.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
representative citing papers
Spectral bounds relate graph Laplacian eigenvalues to the congestion of binary-tree embeddings, with an efficient spectral-ordering algorithm and applications to tensor-network contraction complexity.
PEPSKit.jl is a Julia package that supplies high-level algorithms for ground-state, time-evolution and finite-temperature iPEPS simulations with symmetry support on various lattices.
Introductory lecture notes on tensor networks with emphasis on matrix-product states, their algorithms, higher-dimensional generalizations, and applications to mixed states and open quantum systems, accompanied by Julia code.
citing papers explorer
-
Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry
Spectral bounds relate graph Laplacian eigenvalues to the congestion of binary-tree embeddings, with an efficient spectral-ordering algorithm and applications to tensor-network contraction complexity.
-
PEPSKit.jl: A Julia package for projected entangled-pair state simulations
PEPSKit.jl is a Julia package that supplies high-level algorithms for ground-state, time-evolution and finite-temperature iPEPS simulations with symmetry support on various lattices.
-
Introduction to matrix-product states and tensor networks
Introductory lecture notes on tensor networks with emphasis on matrix-product states, their algorithms, higher-dimensional generalizations, and applications to mixed states and open quantum systems, accompanied by Julia code.