Related papers: FFT-based Kronecker product approximation to micro…
The harmonic product of tensors---leading to the concept of harmonic factorization---has been defined in a previous work (Olive et al, 2017). In the practical case of 3D crack density measurements on thin or thick walled structures, this…
We consider finite approximations of a fractal generated by an iterated function system of affine transformations on $\mathbb{R}^d$ as a discrete set of data points. Considering a signal supported on this finite approximation, we propose a…
We propose a scalable fluxonium-transmon-fluxonium (FTF) system that utilizes a central transmon to mediate high-fidelity gates and parity checks between two fluxonium qubits without the need for strong non-local interactions. This approach…
We show that the well known Kronecker product is a suitable tool for the construction of matrix representations of widely used spin Hamiltonians. In this way we avoid the explicit use of basis sets for the construction of the matrix…
Solving high-dimensional partial differential equations necessitates methods free of exponential scaling in the dimension of the problem. This work introduces a tensor network approach for the Kolmogorov backward equation via approximating…
Recent years have seen rapid advances in the data-driven analysis of dynamical systems based on Koopman operator theory and related approaches. On the other hand, low-rank tensor product approximations -- in particular the tensor train (TT)…
We present an efficient low-rank approximation algorithm for non-negative tensors. The algorithm is derived from our two findings: First, we show that rank-1 approximation for tensors can be viewed as a mean-field approximation by treating…
This paper presents a method to build explicit tensor-train (TT) representations. We show that a wide class of tensors can be explicitly represented with sparse TT-cores, obtaining, in many cases, optimal TT-ranks. Numerical experiments…
Tensor train (TT) decomposition is a powerful representation for high-order tensors, which has been successfully applied to various machine learning tasks in recent years. However, since the tensor product is not commutative, permutation of…
We consider the problem of matrix approximation and denoising induced by the Kronecker product decomposition. Specifically, we propose to approximate a given matrix by the sum of a few Kronecker products of matrices, which we refer to as…
We derive constraints on the operator product expansion of two stress tensors in conformal field theories (CFTs), both generic and holographic. We point out that in large $N$ CFTs with a large gap to single-trace higher spin operators, the…
We present a new framework for studying conformal field theories deformed by one or more relevant operators. The original CFT is described in infinite volume using a basis of states with definite momentum, $P$, and conformal Casimir,…
Through coarse-graining, tensor network representations of a two-dimensional critical lattice model flow to a universal four-leg tensor, corresponding to a conformal field theory (CFT) fixed-point. We computed explicit elements of the…
Building on a previously introduced block Lanczos method, we demonstrate how to approximate any operator function of the form Trf (A) when the argument A is given as a Hermitian matrix product operator. This gives access to quantities that,…
We introduce and analyze a mesh-free two-level hybrid Chebyshev-Tucker tensor representation for approximating multivariate functions, which combines tensor-product Chebyshev interpolation with the low-rank Tucker decomposition of the…
A metallic disk with strong spin orbit interaction is investigated . The finite disk geometry introduces a confining potential. Due to the strong spin-orbit interaction and confining potential the metal disk is described by an effective one…
Using lattice approximations of Euclidean space, we develop a way to approximate stable processes that are represented by stochastic integrals over Euclidean space. Via a stable version of the Lindeberg-Feller Theorem we show that the…
The tensor-train (TT) format is a data-sparse tensor representation commonly used in high dimensional data approximations. In order to represent data with interpretability in data science, researchers develop data-centric skeletonized low…
We present a real-space formulation and higher-order finite-difference implementation of periodic Orbital-free Density Functional Theory (OF-DFT). Specifically, utilizing a local reformulation of the electrostatic and kernel terms, we…
This paper proposes a novel formulation of the tensor completion problem to impute missing entries of data represented by tensors. The formulation is introduced in terms of tensor train (TT) rank which can effectively capture global…