Related papers: Efficient computation of matrix elements of generi…
We describe an explicit construction of approximate Ginsparg-Wilson fermions for QCD. We use ingredients of perfect action origin, and further elements. The spectrum of the lattice Dirac operator reveals the quality of the approximation. We…
A recently developed numerical method for the calculation of derivatives of functions of general complex matrices, which can also be combined with implicit matrix function approximations such as Krylov-Ritz type algorithms, is presented. An…
Let Alt_n be the vector space of all alternating n-by-n complex matrices, on which the complex general linear group GL_n acts by $x \mapsto g x g^t$. The aim of this paper is to show that Pfaffian of a certain matrix whose entries are…
We introduce a method for calculating individual elements of matrix functions. Our technique makes use of a novel series expansion for the action of matrix functions on basis vectors that is memory efficient even for very large matrices. We…
In a series of recent papers we have shown how the dynamical behavior of certain classical systems can be analyzed using operators evolving according to Heisenberg-like equations of motions. In particular, we have shown that raising and…
An expression in the form of an easily computed integral is given for the determinant of the scalar GJMS operator on an odd--dimensional sphere. Manipulation yields a sum formula for the logdet in terms of the logdets of the ordinary…
This paper examines the problem of locating outlier columns in a large, otherwise low-rank, matrix. We propose a simple two-step adaptive sensing and inference approach and establish theoretical guarantees for its performance; our results…
This paper examines the problem of locating outlier columns in a large, otherwise low-rank matrix, in settings where {}{the data} are noisy, or where the overall matrix has missing elements. We propose a randomized two-step inference…
A new deterministic, numerical method to solve fermion field theories is presented. This approach is based on finding solutions $Z[J]$ to the lattice functional equations for field theories in the presence of an external source $J$. Using…
We study the optimal Slater-determinant approximation of an $N$-fermion wave function analytically. That is, we seek the Slater-determinant (constructed out of $N$ orthonormal single-particle orbitals) wave function having largest overlap…
Determinants of structured matrices play a fundamental role in both pure and applied mathematics, with wide-ranging applications in linear algebra, combinatorics, coding theory, and numerical analysis. In this work, the enumeration of…
We propose a general framework for finding the ground state of many-body fermionic systems by using feed-forward neural networks. The anticommutation relation for fermions is usually implemented to a variational wave function by the Slater…
An important theorem in Gaussian quantum information tells us that we can diagonalise the covariance matrix of any Gaussian state via a symplectic transformation. Whilst the diagonal form is easy to find, the process for finding the…
In this paper, we present a new algorithm and an experimental implementation for factoring elements in the polynomial n'th Weyl algebra, the polynomial n'th shift algebra, and ZZ^n-graded polynomials in the n'th q-Weyl algebra. The most…
The overlap Dirac operator in lattice QCD requires the computation of the sign function of a matrix. While this matrix is usually Hermitian, it becomes non-Hermitian in the presence of a quark chemical potential. We show how the action of…
In this paper we describe an adaptive Levin method for numerically evaluating integrals of the form $\int_\Omega f(\mathbf x) \exp(i g(\mathbf x)) \,d\Omega$ over general domains that have been meshed by transfinite elements. On each…
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…
In this paper, we derive new model formulations for computing generalized singular values of a Grassman matrix pair. These new formulations make use of truncated filter matrices to locate the $i$-th generalized singular value of a Grassman…
We compare two different methods of computing form factors. One is the well established procedure of solving the form factor consistency equations and the other is to represent the field content as well as the particle creation operators in…
Slater determinants are product states of filled quantum fermionic orbitals. When they are expressed in a configuration space basis chosen a priori, their entanglement is bound and controlled. This suggests that an exact representation of…