Related papers: Matrix integral solutions to the discrete KP hiera…
We review existing methods for implementing smooth functions f(A) of a sparse Hermitian matrix A on a quantum computer, and analyse a further combination of these techniques which has some advantages of simplicity and resource consumption…
We introduce a single tau function that represents the CKP hierarchy into a generalized Hirota "bilinear" equation. The actions on the tau function by additional symmetries for the hierarchy are calculated, which involve strictly more than…
Consider a symmetric (finite) matrix ensemble, with a certain probability distribution. What is the probability that the spectrum belongs to a certain interval or union of intervals on the real line? In this paper, we show that, upon…
We derive the expressions for $\psi$-functions and generic solutions of lattice principal chiral equations, lattice KP hierarchy and hierarchy including lattice N-wave type equations. $\tau$-function of $n$ free fermions plays fundamental…
In case of the KP hierarchy where the dependent variable takes values in an (arbitrary) associative algebra A, it is known that there are solutions which can be expressed in terms of quasideterminants of a Wronski matrix which solves the…
In this paper, we study numerical homogenization methods based on integral equations. Our work is motivated by materials such as concrete, modeled as composites structured as randomly distributed inclusions imbedded in a matrix. We…
The general correlation function for the eigenvalues of $p$ complex hermitian matrices coupled in a chain is given as a single determinant. For this we use a slight generalization of a theorem of Dyson.
A combinatorial construction proves an identity for the product of the Pfaffian of a skew-symmetric matrix by the Pfaffian of one of its submatrices. Several applications of this identity are followed by a brief history of Pfaffians.
Relation between the Virasoro constraints and KP integrability (determinant formulas) for matrix models is a lasting mystery. We elaborate on the claim that the situation is improved when integrability is enhanced to super-integrability,…
The present work is inspired by three interrelated themes: Weingarten calculus for integration over unitary groups, monotone Hurwitz numbers which enumerate certain factorisations of permutations into transpositions, and Jucys-Murphy…
Solving linear systems and computing eigenvalues are two fundamental problems in linear algebra. For solving linear systems, many efficient quantum algorithms have been discovered. For computing eigenvalues, currently, we have efficient…
This paper introduces the hierarchical interpolative factorization for integral equations (HIF-IE) associated with elliptic problems in two and three dimensions. This factorization takes the form of an approximate generalized LU…
The addition formulae for KP $\tau$-functions, when evaluated at lattice points in the KP flow group orbits in the infinite dimensional Sato-Segal-Wilson Grassmannian, give infinite parametric families of solutions to discretizations of the…
We describe efficient differentiation methods for computing Jacobians and gradients of a large class of matrix functions including the matrix logarithm $\log(A)$ and $p$-th roots $A^{\frac{1}{p}}$. We exploit contour integrals and conformal…
We introduce a new algorithm for finding the eigenvalues and eigenvectors of Hermitian matrices within a specified region, based upon the LANSO algorithm of Parlett and Scott. It uses selective reorthogonalization to avoid the duplication…
Single scale Feynman integrals in quantum field theories obey difference or differential equations with respect to their discrete parameter $N$ or continuous parameter $x$. The analysis of these equations reveals to which order they…
In this work we present a low-rank algorithm for computing low-rank approximations of large-scale Lyapunov operator $\varphi$-functions. These computations play a crucial role in implementing of matrix-valued exponential integrators for…
We develop an algorithm for computing the solution of a large system of linear ordinary differential equations (ODEs) with polynomial inhomogeneity. This is equivalent to computing the action of a certain matrix function on the vector…
Quantum subspace diagonalization methods are an exciting new class of algorithms for solving large\rev{-}scale eigenvalue problems using quantum computers. Unfortunately, these methods require the solution of an ill-conditioned generalized…
In this study, the solution of the Hamilton-Jacobi equation (HJE) with holonomic Hamiltonian is investigated in terms of the first integrals of the corresponding Hamiltonian system. Holonomic functions are related to a specific type of…