Related papers: On exponential polynomials and quantum computing
We consider a family of quantum spin systems which includes as special cases the ferromagnetic XY model and ferromagnetic Ising model on any graph, with or without a transverse magnetic field. We prove that the partition function of any…
We give an efficient algorithm to evaluate a certain class of exponential sums, namely the periodic, quadratic, multivariate half Gauss sums. We show that these exponential sums become $\#\mathsf{P}$-hard to compute when we omit either the…
Given a quadratic map Q : K^n -> K^k defined over a computable subring D of a real closed field K, and a polynomial p(Y_1,...,Y_k) of degree d, we consider the zero set Z=Z(p(Q(X)),K^n) of the polynomial p(Q(X_1,...,X_n)). We present a…
We investigate the power of quantum computers when they are required to return an answer that is guaranteed correct after a time that is upper-bounded by a polynomial in the worst case. In an oracle setting, it is shown that such machines…
In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts…
The Schubert vanishing problem asks whether Schubert structure constants are zero. We give a complete solution of the problem from an algorithmic point of view, by showing that Schubert vanishing can be decided in probabilistic polynomial…
Gelfond and Khovanskii found a formula for the sum of the values of a Laurent polynomial at the zeros of a system of n Laurent polynomials in the complex n-torus whose Newton polyhedra have generic mutual positions. An exponential change of…
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient space), D…
We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the exponential quantum speed-up obtained for partial functions…
In this paper we study the complexity of quantum query algorithms computing the value of Boolean function and its relation to the degree of algebraic polynomial representing this function. We pay special attention to Boolean functions with…
Some purely chiral fractional quantum Hall states are described by symmetric or anti-symmetric polynomials of infinite variables. In this article, we review a systematic construction and classification of those fractional quantum Hall…
We propose a general algorithm to enumerate all solutions of a zero-dimensional polynomial system with respect to a given cost function. The algorithm is developed and is used to study a polynomial system obtained by discretizing the steady…
We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…
A novel method with two variations is proposed with which the number of positive and negative zeros of a polynomial with real coefficients and degree $n$ can be restricted with significantly better determinacy than that provided by the…
An efficient algorithm for computing eigenvectors of a matrix of integers by exact computation is proposed. The components of calculated eigenvectors are expressed as polynomials in the eigenvalue to which the eigenvector is associated, as…
We present a method for the solution of polynomial equations. We do not intend to present one more method among several others, because today there are many excellent methods. Our main aim is educational. Here we attempt to present a method…
We consider an n-qubit quantum system with a Hamiltonian, defined by an expansion in the Pauli basis, and propose a new algorithm for classical computing the exponential of the Hamiltonian. The algorithm is based on the representation of…
In this paper, we present efficient quantum algorithms that are exponentially faster than classical algorithms for solving the quantum optimal control problem. This problem involves finding the control variable that maximizes a physical…
Harrow, Hassidim, and Lloyd showed that for a suitably specified $N \times N$ matrix $A$ and $N$-dimensional vector $\vec{b}$, there is a quantum algorithm that outputs a quantum state proportional to the solution of the linear system of…
A probabilistic approach to the study of the number of zeros of complex harmonic polynomials was initiated by W. Li and A. Wei (2009), who derived a Kac-Rice type formula for the expected number of zeros of random harmonic polynomials with…