Related papers: Quantization of Arbitrary Hamiltonians
We consider an equation of multiple variables in which a partial derivative does not vanish at a point. The implicit function theorem provides a local existence and uniqueness of the function for the equation. In this paper, we propose an…
Given the Hamiltonian, the evaluation of unitary operators has been at the heart of many quantum algorithms. Motivated by existing deterministic and random methods, we present a hybrid approach, where Hamiltonians with large amplitude are…
We consider how to use Hamiltonian Monte Carlo to sample from a distribution whose log-density is piecewise quadratic, conditioned on the sample lying on the level set of a piecewise affine, continuous function.
We describe an algorithm for the factorization of non-commutative polynomials over a field. The first sketch of this algorithm appeared in an unpublished manuscript (literally hand written notes) by James H. Davenport more than 20 years…
It is argued that the massive non-Abelian gauge field theory without involving Higgs bosons may be well established on the basis of gauge-invariance principle because the dynamics of the field is gauge-invariant in the physical space…
New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…
Quantization for a Borel probability measure refers to the idea of estimating a given probability by a discrete probability with support containing a finite number of elements. If in the quantization some of the elements in the support are…
Recently J. M. Arrazola et al. [Phys. Rev. A 100, 032306 (2019)] proposed a quantum algorithm for solving nonhomogeneous linear partial differential equations of the form $A\psi(\textbf{r})=f(\textbf{r})$. Its nonhomogeneous solution is…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
We discuss systematically several possible inequivalent ways to describe the dynamics and the transition probabilities of a quantum system when its hamiltonian is not self-adjoint. In order to simplify the treatment, we mainly restrict our…
We give conditions under which the number of solutions of a system of polynomial equations over a finite field F_q of characteristic p is divisible by p. Our setup involves the substitution t_i |-> f_i(t_i) for auxiliary polynomials…
Numerical solving differential equations with fractional derivatives requires elimination of the singularity which is inherent in the standard definition of fractional derivatives. The method of integration by parts to eliminate this…
Bell polynomials appear in several combinatorial constructions throughout mathematics. Perhaps most naturally in the combinatorics of set partitions, but also when studying compositions of diffeomorphisms on vector spaces and manifolds, and…
We provide an easy method for the construction of characteristic polynomials of simple ordinary abelian varieties ${\mathcal A}$ of dimension $g$ over a finite field ${\mathbb F}_q$, when $q\ge 4$ and $2g=\rho^{b-1}(\rho-1)$ for some prime…
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
The Hamilton-Jacobi formalism of constrained systems is used to study superstring. That obtained the equations of motion for a singular system as total differential equations in many variables. These equations of motion are in exact…
In the convergence analysis of numerical methods for solving partial differential equations (such as finite element methods) one arrives at certain generalized eigenvalue problems, whose maximal eigenvalues need to be estimated as…
A new non-associative algebra for the quantization of strongly interacting fields is proposed. The full set of quantum $(\pm)$associators for the product of three operators is offered. An algorithm for the calculation of some…
Combinatorial interpretation of the fibonomial coefficients as a number of choices of specific finite subsets of an infinite partially ordered set of not binomial type is proposed. This partially ordered set is here defined via…
We construct the commutative Poisson algebra of classical Hamiltonians in field theory. We pose the problem of quantization of this Poisson algebra. We also make some interesting computations in the known quadratic part of the quantum…