Related papers: Complexity of Linear Operators
We propose a way to study one-dimensional statistical mechanics models with complex-valued action using transfer operators. The argument consists of two steps. First, the contour of integration is deformed so that the associated transfer…
Endowing the set of functional graphs (FGs) with the sum (disjoint union of graphs) and product (standard direct product on graphs) operations induces on FGs a structure of a commutative semiring R. The operations on R can be naturally…
We consider the nonlinear inverse problem of learning a transition operator $\mathbf{A}$ from partial observations at different times, in particular from sparse observations of entries of its powers…
Quantum computation with a complete graph of superconducting qubits has been recently proposed, and applications to amplitude amplification, phase estimation, and the simulation of realistic atomic collisions given [Phys. Rev. A 91, 062309…
Linear algebraic expressions are the essence of many computationally intensive problems, including scientific simulations and machine learning applications. However, translating high-level formulations of these expressions to efficient…
Let $\sigma(A)$, $\rho(A)$ and $r(A)$ denote the spectrum, spectral radius and numerical radius of a bounded linear operator $A$ on a Hilbert space $H$, respectively. We show that a linear operator $A$ satisfying $$\rho(AB)\le r(A)r(B)…
A linear constraint system is specified by linear equations over the group $\ZZ_d$ of integers modulo $d$. Their operator solutions play an important role in the study of quantum contextuality and non-local games. In this paper, we use 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…
We introduce a quantum linear system solving algorithm based on the Kaczmarz method, a widely used workhorse for large linear systems and least-squares problems that updates the solution by enforcing one equation at a time. Its simplicity…
The Riemann zeta function $\zeta(s)$ is defined as the infinite sum $\sum_{n=1}^\infty n^{-s}$, which converges when ${\rm Re}\,s>1$. The Riemann hypothesis asserts that the nontrivial zeros of $\zeta(s)$ lie on the line ${\rm Re}\,s=…
In this work, we analyze the combinatorial properties of cylinders and subdivisions of augmented semi-simplicial sets. These constructions are obtained as particular cases of a certain action from a co-semi-simplicial set on an augmented…
In this paper, an exact algorithm in polynomial time is developed to solve unrestricted binary quadratic programs. The computational complexity is $O\left( n^{\frac{15}{2}}\right) $, although very conservative, it is sufficient to prove…
Obeying constraints imposed by classical physics, we give optimal fine-grained algorithms for matrix multiplication and problems involving graphs and mazes, where all calculations are done in 3-dimensional space. We assume that whatever the…
Using the technology of harmonic analysis, we derive a crossing equation that acts only on the scalar primary operators of any two-dimensional conformal field theory with $U(1)^c$ symmetry. From this crossing equation, we derive bounds on…
In this paper we extend work of Kawamura, see kawamura, for Cuntz-Krieger algebras O_A for infinite matrices A. We generalize the definition of branching systems, prove their existence for any given matrix A and show how they induce some…
This paper gives simple distributed algorithms for the fundamental problem of computing graph distances in the Congested Clique model. One of the main components of our algorithms is fast matrix multiplication, for which we show an…
The computational cost of many signal processing and machine learning techniques is often dominated by the cost of applying certain linear operators to high-dimensional vectors. This paper introduces an algorithm aimed at reducing the…
The process of alternately row scaling and column scaling a positive $n \times n$ matrix $A$ converges to a doubly stochastic positive $n \times n$ matrix $S(A)$, called the \emph{Sinkhorn limit} of $A$. Exact formulae for the Sinkhorn…
The matrix logarithm, when applied to Hermitian positive definite matrices, is concave with respect to the positive semidefinite order. This operator concavity property leads to numerous concavity and convexity results for other matrix…
Let $L$ be a set of $n$ lines in the plane. The zone $Z(\ell)$ of a line $\ell$ in the arrangement $\mathcal{A}(L)$ of $L$ is the set of faces of $\mathcal{A}(L)$ whose closure intersects $\ell$. It is known that the combinatorial size of…