Related papers: A permanent formula for the Jones polynomial
In this paper, we consider the problem of representing a multivariate polynomial as the determinant of a definite (monic) symmetric/Hermitian linear matrix polynomial (LMP). Such a polynomial is known as determinantal polynomial.…
A restricted path integral method is proposed to simulate a type of quantum system or Hamiltonian called a sum of controlled few-fermions on a classical computer using Monte Carlo without a numerical sign problem. Then a universality is…
Continuous-time determinantal algorithm is proposed for the quantum Monte Carlo simulation of the interacting fermions. The scheme does not invoke Hubbard-Stratonovich transformation. The fermionic action is divided into two parts. One of…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
We describe algorithms for computing eigenpairs (eigenvalue-eigenvector pairs) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…
This article could be called "theme and variations" on Cantor's celebrated diagonal argument. Given a square nxn tableau T=(a_i^j) on a finite alphabet A, let L be the set of its row-words. The permanent Perm(T) is the set of words…
We use a Monte Carlo method to assemble finite element matrices for polynomial Chaos approximations of elliptic equations with random coefficients. In this approach, all required expectations are approximated by a Monte Carlo method. The…
A Monte Carlo method for computing the action of a matrix exponential for a certain class of matrices on a vector is proposed. The method is based on generating random paths, which evolve through the indices of the matrix, governed by a…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
An impurity solver based on a continuous-time quantum Monte Carlo method is developed for the Coqblin-Schrieffer model. The Monte Carlo simulation does not encounter a sign problem for antiferromagnetic interactions, and accurately…
Numerically exact continuous-time Quantum Monte Carlo algorithm for finite fermionic systems with non-local interactions is proposed. The scheme is particularly applicable for general multi-band time-dependent correlations since it does not…
A new algorithm is developed allowing the Monte Carlo study of a 1 + 1 dimensional theory in real time. The main algorithmic development is to avoid the explicit calculation of the Jacobian matrix and its determinant in the update process.…
Matrix permanents arise naturally in the context of linear optical networks fed with nonclassical states of light. In this letter we tie the computational complexity of a class of multi-dimensional integrals to the permanents of large…
We introduce and compare three different Monte Carlo determinantal algorithms that allow one to compute dynamical quantities, such as the self-energy, of fermionic systems in their thermodynamic limit. We show that the most efficient…
There is a natural relationship between Jones polynomials and quantum computation. We use this relationship to show that the complexity of evaluating relative-error approximations of Jones polynomials can be used to bound the classical…
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…
We present experimental results approximating the Jones polynomial using 4 qubits in a liquid state nuclear magnetic resonance quantum information processor. This is the first experimental implementation of a complete problem for the…
Given $\{P_n \}$ a sequence of monic orthogonal polynomials, we analyze their linear combinations $\{Q_n \}$with constant coefficients and fixed length $k+1$. Necessary and sufficient conditions are given for the orthogonality of the monic…
Using the Okounkov-Maulik stable map, we identify the equivariant cohomology of instanton moduli spaces with the space of polynomials on an infinite number of variables. We define the generalized Jack polynomials as the polynomials…
In this paper, we give some determinantal and permanental representations of generalized bivariate Fibonacci p-polynomials by using various Hessenberg matrices. The results that we obtained are important since generalized bivariate…