Related papers: Two-loop vacuum diagrams and tensor decomposition
We propose a universal decomposition of unitary maps over a tensorial power of C^2, introducing the key concept of "phase maps", and investigate how this decomposition can be used to implement unitary maps directly in the measurement-based…
We determine the numerical values of scalar multi-loop two-vertex Feynman diagrams, the generalized sunset diagrams, by integrating all but the longitudinal momenta analytically. For the longitudinal momenta we introduce one collective…
Tensor network methods are a class of numerical tools and algorithms to study many-body quantum systems in and out of equilibrium, based on tailored variational wave functions. They have found significant applications in simulating lattice…
We discuss extended definitions of linear and multilinear operations such as Kronecker, Hadamard, and contracted products, and establish links between them for tensor calculus. Then we introduce effective low-rank tensor approximation…
The scalar two-loop self-energy master diagram is studied in the case of arbitrary masses. Analytical results in terms of Lauricella- and Appell-functions are presented for the imaginary part. By using the dispersion relation a…
Tensor networks have in recent years emerged as the powerful tools for solving the large-scale optimization problems. One of the most popular tensor network is tensor train (TT) decomposition that acts as the building blocks for the…
We study the recovery of the underlying graphs or permutations for tensors in the tensor ring or tensor train format. Our proposed algorithms compare the matricization ranks after down-sampling, whose complexity is $O(d\log d)$ for $d$-th…
A recently proposed scheme for numerical evaluation of Feynman diagrams is extended to cover all two-loop two-point functions with arbitrary internal and external masses. The adopted algorithm is a modification of the one proposed by F. V.…
We provide a comprehensive review of classical algorithms for compressive sensing of images, focused on Total variation methods, with a view to application in LiDAR systems. Our primary focus is providing a full review for beginners in the…
We perform analytical reductions of one-loop tensor integrals with 5 and 6 legs to scalar master integrals. They are based on the use of recurrence relations connecting integrals in different space-time dimensions. The reductions are…
We give new and efficient black-box reconstruction algorithms for some classes of depth-$3$ arithmetic circuits. As a consequence, we obtain the first efficient algorithm for computing the tensor rank and for finding the optimal tensor…
Consider a data set collected by (individuals-features) pairs in different times. It can be represented as a tensor of three dimensions (Individuals, features and times). The tensor biclustering problem computes a subset of individuals and…
We present a diagrammatic decomposition of the transition pair correlation function for the uniform electron gas. We demonstrate explicitly that ring and ladder diagrams are dual counterparts that capture significant long- and short-ranged…
Recovering the digital input of a time-discrete linear system from its (noisy) output is a significant challenge in the fields of data transmission, deconvolution, channel equalization, and inverse modeling. A variety of algorithms have…
In this paper, we review some general formulations of exact renormalisation group equations and loop equations for tensor models and tensorial group field theories. We illustrate the use of these equations in the derivation of the leading…
The tensor-train (TT) decomposition expresses a tensor in a data-sparse format used in molecular simulations, high-order correlation functions, and optimization. In this paper, we propose four parallelizable algorithms that compute the TT…
Tensor train (TT) decomposition provides a space-efficient representation for higher-order tensors. Despite its advantage, we face two crucial limitations when we apply the TT decomposition to machine learning problems: the lack of…
We review several multi-loop techniques for analytical massless Feynman diagram calculations in relativistic quantum field theories: integration by parts, the method of uniqueness, functional equations and the Gegenbauer polynomial…
In this paper we discuss two different existing algorithms for computing topological entropy and we perform one of them in order to compute the isentropes for cubic polynomials.
We present a diagrammatic formulation of recently-revived covariant functional approaches to one-loop matching from an ultraviolet (UV) theory to a low-energy effective field theory. Various terms following from a covariant derivative…