Related papers: Tensor renormalization group in bosonic field theo…
Tensor network renormalization group maps study critical points of 2d lattice models like the Ising model by finding the fixed point of the RG map. In a prior work arXiv:2408.10312 we showed that by adding a rotation to the RG map, the…
Singular Value Decomposition (SVD) is a powerful tool in linear algebra.We propose an extension of SVD for both the qualitative detection and quantitative determination of nonlinearity in a time series. The paper illustrates nonlinear SVD…
This work considers a computationally and statistically efficient parameter estimation method for a wide class of latent variable models---including Gaussian mixture models, hidden Markov models, and latent Dirichlet allocation---which…
In this paper, a way of generalizing the tensor renormalization group(TRG) is proposed. Mathematically, the connection between patterns of tensor renormalization group and the concept of truncation sequence in polytope geometry is…
Hadronic matrix elements involving tensor currents play an important r\^ole in decays that allow to probe the consistency of the Standard Model via precision lattice QCD calculations. The non-singlet tensor current is a scale-dependent…
A renormalization group flow of Hamiltonians for two-dimensional classical partition functions is constructed using tensor networks. Similar to tensor network renormalization ([G. Evenbly and G. Vidal, Phys. Rev. Lett. 115, 180405 (2015)],…
In this letter we calculate the exact partition function for free bosons on the plane with lacunae. First the partition function for a plane with two spherical holes is calculated by matching exactly for the infinite set of Wilson…
We present a simple yet novel parameterized form of linear mapping to achieves remarkable network compression performance: a pseudo SVD called Ternary SVD (TSVD). Unlike vanilla SVD, TSVD limits the $U$ and $V$ matrices in SVD to ternary…
Tensors decompositions are a class of tools for analysing datasets of high dimensionality and variety in a natural manner, with the Canonical Polyadic Decomposition (CPD) being a main pillar. While the notion of CPD is closely intertwined…
Singular value decomposition (SVD) and matrix inversion are ubiquitous in scientific computing. Both tasks are computationally demanding for large scale matrices. Existing algorithms can approximatively solve these problems with a given…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
We propose a tensor-network-based algorithm to study the classical Ising model on an infinitely large hyperbolic lattice with a regular 3D tesselation of identical dodecahedra. We reformulate the corner transfer matrix renormalization group…
We study nonchiral wave functions for systems with continuous spins obtained from the conformal field theory (CFT) of a free, massless boson. In contrast to the case of discrete spins, these can be treated as bosonic Gaussian states, which…
We study the three-dimensional $SU(2)$ principal chiral model (PCM) using different tensor renormalization group methods based on the triad and anisotropic decomposition of the tensor. The tensor network representation is formulated based…
We construct an effective field theory describing the decays of a heavy vector resonance $V$ into Standard Model particles. The effective theory is built using an extension of Soft-Collinear Effective Theory called SCET$_{\rm BSM}$, which…
This paper is the fourth in a series devoted to the development of a rigorous renormalisation group method for lattice field theories involving boson fields, fermion fields, or both. The third paper in the series presents a perturbative…
We compute, on the $(\lambda \Phi^4)_{1+1}$ model on the lattice, the soliton mass by means of two very different numerical methods. First, we make use of a ``creation operator'' formalism, measuring the decay of a certain correlation…
We propose a new algorithm for the computation of a singular value decomposition (SVD) low-rank approximation of a matrix in the Matrix Product Operator (MPO) format, also called the Tensor Train Matrix format. Our tensor network randomized…
The prevalent fully-connected tensor network (FCTN) has achieved excellent success to compress data. However, the FCTN decomposition suffers from slow computational speed when facing higher-order and large-scale data. Naturally, there…
We propose a method to construct a tensor network representation of partition functions without singular value decompositions nor series expansions. The approach is demonstrated for one- and two-dimensional Ising models and we study the…