Related papers: Quantum integers and cyclotomy
For any given positive definite binary quadratic form $Q$ with integer coefficients, we establish two results on Diophantine approximation with integers represented by $Q$. Firstly, we show that for every irrational number $\alpha$, there…
The ring of q-character polynomials is a q-analog of the classical ring of character polynomials for the symmetric groups. This ring consists of certain class functions defined simultaneously on the groups $Gl_n(F_q)$ for all n, which we…
Using an algebraic framework we solve a problem posed in [5] and [7] about the axiomatizability of a quantum computational type logic related to fuzzy logic. A Hilbert-style calculus is developed obtaining an algebraic strong completeness…
This work formalizes efficient Fast Fourier-based multiplication algorithms for polynomials in quotient rings such as $\mathbb{Z}_{m}[x]/\left<x^{n}-a\right>$, with $n$ a power of 2 and $m$ a non necessarily prime integer. We also present a…
We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is…
Solutions of quaternionic quantum mechanics (QQM) are difficult to grasp, even in simple physical situations. In this article, we provide simple and understandable free particle quaternionic solutions, that can be easily compared to complex…
We show how the basic operations of quantum computing can be expressed and manipulated in a clear and concise fashion using a multiparticle version of geometric (aka Clifford) algebra. This algebra encompasses the product operator formalism…
Monotonicity criteria are established for the generalized Marcum Q-function, $\emph{Q}_{M}$, the standard Nuttall Q-function, $\emph{Q}_{M,N}$, and the normalized Nuttall Q-function, $\mathcal{Q}_{M,N}$, with respect to their real order…
In this paper we study the distribution of the real algebraic numbers. Given an interval $I$, a positive integer $n$ and $Q>1$, define the counting function $\Phi_n(Q;I)$ to be the number of algebraic numbers in $I$ of degree $n$ and height…
A mathematical proposition with a trainable pair, operator and quantum circuit, are introduced to approximate functions expressed as cubic Taylor polynomials, numerical simulations illustrate three cases.
Let $m$ be a positive integer and $b_{m}(n)$ be the number of partitions of $n$ with parts being powers of 2, where each part can take $m$ colors. We show that if $m=2^{k}-1$, then there exists the natural density of integers $n$ such that…
We first consider a method of centering and a change of variable formula for a quantum integral. We then present three types of quantum integrals. The first considers the expectation of the number of heads in $n$ flips of a "quantum coin".…
We introduce a new permutation statistic, namely, the number of cycles of length $q$ consisting of consecutive integers, and consider the distribution of this statistic among the permutations of $\{1,2,...,n\}$. We determine explicit…
The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum…
Quantum algorithms are a very promising field. However, creating and manipulating these kind of algorithms is a very complex task, specially for software engineers used to work at higher abstraction levels. The work presented here is part…
In this note we obtain the solutions of four $q$-functional equations and express the solutions in $q$-operator forms. These equations give sufficient conditions for $q$-operator methods.
In this introductory article a brief description of Quantum Field Theories (QFT) is presented with emphasis on the distinction between strongly and weakly coupled theories. A case is made for using numerical simulations to solve QCD, the…
What is the computational power of a quantum computer? We show that determining the output of a quantum computation is equivalent to counting the number of solutions to an easily computed set of polynomials defined over the finite field…
An analytical result is given for the exact evaluation of an integral which arises in the analysis of acoustic radiation from wave packet sources: $ I_{mn}(\beta,q) = \int_{-\infty}^{\infty} e^{-\beta^{2}x^{2}-i q x}x^{m+1/2}J_{n+1/2}(x)…
Quantum field theory (QFT) on fractal spacetimes is a program aiming at quantizing the gravitational interaction consistently at all energy scales thanks to an intrinsically or dynamically induced multiscale or multifractal-like spacetime…