Related papers: Cluster update for tensor network states
We propose an improved approach to carry out the imaginary time evolution of infinite projected entangled-pair states (iPEPS), especially for systems with criticality. A cyclic optimal truncation is introduced to update the tensors along a…
Cluster expansions for the exponential of local operators are constructed using tensor networks. In contrast to other approaches, the cluster expansion does not break any spatial or internal symmetries and exhibits a very favourable…
We analyze the tensor network loop cluster expansion, introduced in [G. Park, J. Gray, and G. K.-L. Chan, Phys. Rev. B 112, 174310 (2025)] as a systematic correction to belief propagation, in the context of general quantum many-body…
The approximate contraction of a Projected Entangled Pair States (PEPS) tensor network is a fundamental ingredient of any PEPS algorithm, required for the optimization of the tensors in ground state search or time evolution, as well as for…
An efficient algorithm is constructed for contracting two-dimensional tensor networks under periodic boundary conditions. The central ingredient is a novel renormalization step that scales linearly with system size, i.e. from $L \to L+1$.…
Spectral clustering and co-clustering are well-known techniques in data analysis, and recent work has extended spectral clustering to square, symmetric tensors and hypermatrices derived from a network. We develop a new tensor spectral…
Within the Projected Entangled Pair State (PEPS) tensor network formalism, a simple update (SU) method has been used to investigate the time evolution of a two-dimensional U(1) critical spin-1/2 spin liquid under Hamiltonian quench [Phys.…
We propose a new effective cluster algorithm of tuning the critical point automatically, which is an extended version of Swendsen-Wang algorithm. We change the probability of connecting spins of the same type, $p = 1 - e^{- J/ k_BT}$, in…
We present a fast and robust cluster update algorithm that is especially efficient in implementing the task of image segmentation using the method of superparamagnetic clustering. We apply it to a Potts model with spin interactions that are…
It is demonstrated that Monte Carlo sampling can be used to efficiently extract the expectation value of projected entangled pair states with large virtual bond dimension. We use the simple update rule introduced by Xiang et al. to obtain…
Calculation of observables with three-dimensional projected entangled pair states is generally hard, as it requires a contraction of complex multi-layer tensor networks. We utilize the multi-layer structure of these tensor networks to…
Tensor networks establish an adaptable framework for the emulation of quantum circuits. By partitioning exponentially large registers and gates into smaller tensors, this unlocks fast transformations through tensor algebra, and grants fine…
Tensor completion is a natural higher-order generalization of matrix completion where the goal is to recover a low-rank tensor from sparse observations of its entries. Existing algorithms are either heuristic without provable guarantees,…
We derive and implement a new way of solving coupled cluster equations with lower computational scaling. Our method is based on decomposition of both amplitudes and two electron integrals, using a combination of tensor hypercontraction and…
The simple update (SU) and full update (FU) are the two paradigmatic time evolution algorithms for a tensor network known as the infinite projected entangled pair state (iPEPS). They differ by an error measure that is either, respectively,…
Dynamic tensor data are becoming prevalent in numerous applications. Existing tensor clustering methods either fail to account for the dynamic nature of the data, or are inapplicable to a general-order tensor. Also there is often a gap…
We introduce a method for extracting meaningful entanglement measures of tensor network states in general dimensions. Current methods require the explicit reconstruction of the density matrix, which is highly demanding, or the contraction…
We initiate the study of how tensor networks reproduce properties of static holographic space-times, which are not locally pure anti-de Sitter. We consider geometries that are holographically dual to ground states of defect, interface and…
We present an incremental, scalable and efficient dimension reduction technique for tensors that is based on sparse random linear coding. Data is stored in a compactified representation with fixed size, which makes memory requirements low…
Time evolution of an infinite 2D many body quantum lattice system can be described by the Suzuki-Trotter decomposition applied to the infinite projected entangled pair state (iPEPS). Each Trotter gate increases the bond dimension of the…