Related papers: Computing the Boolean product of two n\times n Boo…
We present an explicit formula of the powers for the $2\times 2$ quantum matrices, that is a natural quantum analogue of the powers of the usual $2\times 2$ matrices. As applications, we give some non-commutative relations of the entries of…
We study the top Lyapunov exponents of random products of positive $2 \times 2$ matrices and obtain an efficient algorithm for its computation. As in the earlier work of Pollicott, the algorithm is based on the Fredholm theory of…
N-matrices are real $n\times n$ matrices all of whose principal minors are negative. We provide (i) an $O(2^n)$ test to detect whether or not a given matrix is an N-matrix, and (ii) a characterization of N-matrices, leading to the recursive…
In analogy to a characterisation of operator matrices generating $C_0$-semigroups due to R. Nagel (\cite{[Na89]}), we give conditions on its entries in order that a $2\times 2$ operator matrix generates a cosine operator function. We apply…
Herein, we present a polylogarithmic decomposition method to load the matrix from the linearized 1-dimensional Burgers' equation onto a quantum computer. First, we use the Carleman linearization method to map the nonlinear Burgers' equation…
We show that the two problems of computing the permanent of an $n\times n$ matrix of $\operatorname{poly}(n)$-bit integers and counting the number of Hamiltonian cycles in a directed $n$-vertex multigraph with…
The M{\"o}bius transform is a crucial transformation into the Boolean world; it allows to change the Boolean representation between the True Table and Algebraic Normal Form. In this work, we introduce a new algebraic point of view of this…
In this paper, we study products of asymmetric Toeplitz matrices, we give necessary and sufficient conditions for the product of two asymmetric Toeplitz matrices compatible sizes is asymmetric Toeplitz matrix. We also give some results…
We present the two-loop corrected operator matrix elements calculated in N-dimensional regularization up to the finite terms which survive in the limit $\epsilon = N - 4 \to 0 $. The anomalous dimensions of the local operators have been…
We compute the determinant of $\sum_{n=1}^{N} \vec{A}^{(n)} \otimes \vec{B}^{(n)}$, where $\vec{A}^{(n)}$ is square and ${\vec{B}^{(n)}=\vec{x}^{(n)}{\vec{y}^{(n)}}^T}$ where $\vec{x}^{(n)}$ and $\vec{y}^{(n)}$ have length $N$.
We describe a method for calculating the roots of special functions satisfying second order linear ordinary differential equations. It exploits the recent observation that the solutions of a large class of such equations can be represented…
Discrepancy between periodic orbit theory and numerical calculation of a modified Kepler problem is cleared by a quantum mechanical calculation. The diagonal approximation already gives a good fit for the numerical calculation. A better…
We analyze a token-based Brownian circuit in which Brownian particles, coined `tokens,' move randomly by exploiting thermal fluctuations, searching for a path in multi-token state space corresponding to the solution of a given problem. The…
Algebraic matrix multiplication algorithms are designed by bounding the rank of matrix multiplication tensors, and then using a recursive method. However, designing algorithms in this way quickly leads to large constant factors: if one…
A program is created to compute recursively the Moshinsky brackets. It is very fast and provides highly accurate results. In the case of the double-precision computations with a single-processor consumer notebook, the computing time per…
Let ${\cal X }=XX^{\prime}$ be a random matrix associated with a centered $r$-column centered Gaussian vector $X$ with a covariance matrix $P$. In this article we compute expectations of matrix-products of the form $\prod_{1\leq i\leq…
A fast simulation algorithm for the calculation of multitime correlation functions of open quantum systems is presented. It is demonstrated that any stochastic process which ``unravels'' the quantum Master equation can be used for the…
We make use of product integrals to provide an unambiguous mathematical representation of Wilson line and Wilson loop operators. Then, drawing upon various properties of product integrals, we discuss such properties of these operators as…
For every modulus $q\ge3$, we define a family of subsets $\mathcal{A}$ of the multiplicative group $(\mathbb{Z}/{q}\mathbb{Z})^\times$ for which the Euler product $\prod_{p\text{mod}q\in\mathcal{A}}(1-p^{-s})$ can be computed in double…
Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…