Related papers: Quadratically optimized polynomials for fermion si…
In a recent paper we have suggested that the finite temperature density matrix can be computed efficiently by a combination of polynomial expansion and iterative inversion techniques. We present here significant improvements over this…
We carry out a comparative study among five-dimensional formulations of chirally symmetric fermions about the algorithmic performance, chiral symmetry violation and topological tunneling to find a computationally inexpensive formulation…
In this work several techniques to treat the partition function of the real scalar quartic quantum field theory on the Moyal plane is discussed. A factorisation approach requires the polytope volume for the diagonal subpolytope of symmetric…
Fermions are fundamental particles which obey seemingly bizarre quantum-mechanical principles, yet constitute all the ordinary matter that we inhabit. As such, their study is heavily motivated from both fundamental and practical incentives.…
We present a quantum eigenstate filtering algorithm based on quantum signal processing (QSP) and minimax polynomials. The algorithm allows us to efficiently prepare a target eigenstate of a given Hamiltonian, if we have access to an initial…
We present a new algorithm for reconstructing an exact algebraic number from its approximate value using an improved parameterized integer relation construction method. Our result is consistent with the existence of error controlling on…
Quadratic Unconstrained Binary Optimization (QUBO) is a broad class of optimization problems with many practical applications. To solve its hard instances in an exact way, known classical algorithms require exponential time and several…
We present a new quantum Monte Carlo algorithm suitable for generically complex problems, such as systems coupled to external magnetic fields or anyons in two spatial dimensions. We find that the choice of gauge plays a nontrivial role, and…
When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…
A representation of finite fields that has proved useful when implementing finite field arithmetic in hardware is based on an isomorphism between subrings and fields. In this paper, we present an unified formulation for multiplication in…
Boson sampling has been theoretically proposed and experimentally demonstrated to show quantum computational advantages. However, it still lacks the deep understanding of the practical applications of boson sampling. Here we propose that…
Quantum computers hold great promise for efficiently simulating Fermionic systems, benefiting fields like quantum chemistry and materials science. To achieve this, algorithms typically begin by choosing a Fermion-to-qubit mapping to encode…
Optimally-shaped electromagnetic fields have the capacity to coherently control the dynamics of quantum systems and thus offer a promising means for controlling molecular transformations relevant to chemical, biological, and materials…
This paper concerns the approximation of smooth, high-dimensional functions from limited samples using polynomials. This task lies at the heart of many applications in computational science and engineering - notably, some of those arising…
Unions of graph Fourier multipliers are an important class of linear operators for processing signals defined on graphs. We present a novel method to efficiently distribute the application of these operators to the high-dimensional signals…
An efficient Quantum Monte Carlo algorithm for the simulation of bosonic systems on a lattice in a grand canonical ensemble is proposed. It is based on the mapping of bosonic models to the spin models in the limit of the infinite total spin…
We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…
Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…
Many quantum algorithms, including recently proposed hybrid classical/quantum algorithms, make use of restricted tomography of the quantum state that measures the reduced density matrices, or marginals, of the full state. The most…
This review covers applications of quantum Monte Carlo methods to quantum mechanical problems in the study of electronic and atomic structure, as well as applications to statistical mechanical problems both of static and dynamic nature. The…