Related papers: A Simple and General Equation for Matrix Product U…
We establish a canonical and unique tensor product for commutative monoids and groups in an infinity-category C which generalizes the ordinary tensor product of abelian groups. Using this tensor product we show that E_n-(semi)ring objects…
The $\star_M$-family of tensor-tensor products is a framework which generalizes many properties from linear algebra to third order tensors. Here, we investigate positive semidefiniteness and semidefinite programming under the…
Continuous frames and tensor products are important topics in theoretical physics. This paper combines those concepts. We derive fundamental properties of continuous frames for tensor product of Hilbert spaces. This includes, for example,…
With the rapid advent of generative models, efficiently deploying these models on specialized hardware has become critical. Tensor Processing Units (TPUs) are designed to accelerate AI workloads, but their high power consumption…
We consider the problem of random uniform generation of traces (the elements of a free partially commutative monoid) in light of the uniform measure on the boundary at infinity of the associated monoid. We obtain a product decomposition of…
Consider the most general $3 \times 3$ Majorana neutrino mass matrix $\cal M$. Motivated by present neutrino-oscillation data, much theoretical effort is directed at reducing it to a specific texture in terms of a small number of…
Many critical EDA problems suffer from the curse of dimensionality, i.e. the very fast-scaling computational burden produced by large number of parameters and/or unknown variables. This phenomenon may be caused by multiple spatial or…
We present a new method for compressing matrix product operators (MPOs) which represent sums of local terms, such as Hamiltonians. Just as with area law states, such local operators may be fully specified with a small amount of information…
We show how to efficiently simulate pure quantum states in one dimensional systems that have both finite energy density and vanishingly small energy fluctuations. We do so by studying the performance of a tensor network algorithm that…
We prove that matrix-product unitaries (MPUs) with on-site unitary symmetries are completely classified by the (chiral) index and the cohomology class of the symmetry group $G$, provided that we can add trivial and symmetric ancillas with…
We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems. Using a sequentially prepared quantum circuit representation of a matrix product state (MPS) that we…
Just as matrix product states represent ground states of one-dimensional quantum spin systems faithfully, continuous matrix product states (cMPS) provide faithful representations of the vacuum of interacting field theories in one spatial…
Using unitary (instead of general) matrices in artificial neural networks (ANNs) is a promising way to solve the gradient explosion/vanishing problem, as well as to enable ANNs to learn long-term correlations in the data. This approach…
Tensor network states, especially Matrix Product States (MPS), are crucial tools for studying how particles in large quantum systems are entangled with each other. MPS are particularly effective for modeling systems in one-dimensional…
Producing large complex simulation datasets can often be a time and resource consuming task. Especially when these experiments are very expensive, it is becoming more reasonable to generate synthetic data for downstream tasks. Recently,…
We propose a supersymmetric extra U(1) model, which can generate small neutrino masses and necessary $\mu$ terms, simultaneously. Fields including quarks and leptons are embedded in three ${\bf 27}$s of $E_6$ in a different way among…
For a positive integer $n$, let $M_n$ be the set of $n\times n$ complex matrices. Suppose $\|\cdot\|$ is the Ky Fan $k$-norm with $1 \le k \le mn$ or the Schatten $p$-norm with $1 \le p \le \infty$ ($p\ne 2$) on $M_{mn}$, where $m,n\ge 2$…
Products of $M$ i.i.d. random matrices of size $N \times N$ are related to classical limit theorems in probability theory ($N=1$ and large $M$), to Lyapunov exponents in dynamical systems (finite $N$ and large $M$), and to universality in…
This paper presents a new approach to solve linear and nonlinear model predictive control (MPC) problems that requires small memory footprint and throughput and is particularly suitable when the model and/or controller parameters change at…
Matrix-multiply-accumulate (MMA) units, or tensor cores, are now widespread across modern computing architectures. Yet, their use for particle-grid operators remains limited. In implicit particle methods, mass-matrix assembly is a…