Related papers: Quadratically optimized polynomials for fermion si…
We design a variational quantum algorithm to solve multi-dimensional Poisson equations with mixed boundary conditions that are typically required in various fields of computational science. Employing an objective function that is formulated…
We introduce a new class of quantum Monte Carlo methods, based on a Gaussian quantum operator representation of fermionic states. The methods enable first-principles dynamical or equilibrium calculations in many-body Fermi systems, and,…
We present a simple derivation of a Feynman-Kac type formula to study fermionic systems. In this approach the real time or the imaginary time dynamics is expressed in terms of the evolution of a collection of Poisson processes. A computer…
Quadratic permutation polynomial interleavers over integer rings have recently received attention in practical turbo coding systems from deep space applications to mobile communications. In this correspondence, a necessary and sufficient…
The advantages of using Multi-Step corrections for simulations of lattice gauge theories with dynamical fermions will be discussed. This technique is suited for algorithms based on the Multi-Boson representation of the dynamical fermions as…
Symmetry plays a central role in accelerating symbolic computation involving polynomials. This chapter surveys recent developments and foundational methods that leverage the inherent symmetries of polynomial systems to reduce complexity,…
This paper establishes new upper bounds for the right eigenvalues of monic matrix polynomials over the quaternion division algebra. The noncommutative nature of quaternion multiplication presents fundamental challenges in eigenvalue…
In this paper we present a Maple library (MOPs) for computing Jack, Hermite, Laguerre, and Jacobi multivariate polynomials, as well as eigenvalue statistics for the Hermite, Laguerre, and Jacobi ensembles of Random Matrix theory. We also…
We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of…
Fermion-to-qubit mappings are used to represent fermionic modes on quantum computers, an essential first step in many quantum algorithms for electronic structure calculations. In this work, we present a formalism to design flexible…
A broad spectrum of physical systems in condensed-matter and high-energy physics, vibrational spectroscopy, and circuit and cavity QED necessitates the incorporation of bosonic degrees of freedom, such as phonons, photons, and gluons, into…
Simulations of odd flavors QCD can be performed in the framework of the hybrid Monte Carlo algorithm where the inverse of the fermion matrix is approximated by a polynomial. In this exploratory study we perform three flavors QCD…
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…
This paper studies the polynomial optimization problem whose feasible set is a union of several basic closed semialgebraic sets. We propose a unified hierarchy of Moment-SOS relaxations to solve it globally. Under some assumptions, we prove…
This paper considers fast algorithms for operations on linearized polynomials. We propose a new multiplication algorithm for skew polynomials (a generalization of linearized polynomials) which has sub-quadratic complexity in the polynomial…
Primitive polynomials over finite fields are crucial for various domains of computer science, including classical pseudo-random number generation, coding theory and post-quantum cryptography. Nevertheless, the pursuit of an efficient…
We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These…
The increase with time of computer resources devoted to simulations of full QCD is spectacular. Yet the reduction of systematic errors is comparatively slow. This is due to the algorithmic complexity of the problem. I review, in elementary…
Pauli matrices and Pauli strings are widely used in quantum computing. These mathematical objects are useful to describe or manipulate the quantum state of qubits. They offer a convenient basis to express operators and observables used in…
We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…