Related papers: Quadratic addition rules for quantum integers
The quantum dynamical systems of identical particles admitting an additional integral quadratic in momenta are considered. It is found that an appropriate ordering procedure exists which allows to convert the classical integrals into their…
In this paper, we introduce the notion of $q$-quasiadditivity of arithmetic functions, as well as the related concept of $q$-quasimultiplicativity, which generalise strong $q$-additivity and -multiplicativity, respectively. We show that…
In this article, we investigate properties of cyclic codes over a finite non-chain ring $\mathbb{F}_q+v\mathbb{F}_q+v^2\mathbb{F}_q+v^3\mathbb{F}_q+v^4\mathbb{F}_q,$ where $q=p^r,$ $r$ is a positive integer, $p$ is an odd prime, $4 \mid…
The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route towards a numerical…
In this paper, we find all integer sequences of the form a^n + b^n, where a and b are complex numbers and n is a nonnegative integer. We prove that if p and q are integers, then there is a correspondence between the roots of the quadratic…
Motivated by the recent work of several authors on vanishing coefficients of the arithmetic progression in certain $q$-series expansion, we study some variants of these $q$-series and prove some comparable results. For instance, if…
A quantum Latin square of order $n$ (denoted as QLS$(n)$) is an $n\times n$ array whose entries are unit column vectors from the $n$-dimensional Hilbert space $\mathcal{H}_n$, such that each row and column forms an orthonormal basis. Two…
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…
In this paper, we give a sufficient and necessary condition for a regular element of a quantum cluster algebra $\mathcal{O}_q(\mathcal{X})$ to be universally polynomial. This resolves several conjectures by the first author on the…
Suppose $Q(x)$ is a real $n\times n$ regular symmetric positive semidefinite matrix polynomial. Then it can be factored as $$Q(x) = G(x)^TG(x),$$ where $G(x)$ is a real $n\times n$ matrix polynomial with degree half that of $Q(x)$ if and…
In this paper, we consider three types of polynomial equations in quantum computer: linear divisibility equation, which belongs to a special type of binary-quadratic Diophantine equation; quadratic congruence equation with restriction in…
Elucidating a connection with nonlinear Fourier analysis, we extend a well known algorithm in quantum signal processing to represent measurable signals by square summable sequences. Each coefficient of the sequence is Lipschitz continuous…
Pure quantum states are often approximately encoded as classical bit strings such as those representing probability amplitudes and those describing circuits that generate the quantum states. The crucial quantity is the minimum length of…
We continue work started in [1] concerning integer sequences q(n), n in N, defined by q(n) = q(n-q(n-1)) + f(n), with q(1) = 1. Here, f(n), with f(1) = 0, is a given sequence. We define F as the set of semi-infinite sequence f such that the…
Let $(a;q)_n=\prod_{0\le k<n}(1-aq^k)$ for n=0,1,2,.... Define q-Euler numbers $E_n(q)$, q-Sali\'e numbers $S_n(q)$ and q-Carlitz numbers $C_n(q)$ as follows: $$\sum_{n=0}^{\infty}E_n(q)\frac{x^n}{(q,q)_n}…
For each positive integer $n$ it is shown how to construct a finite collection of multivariable polynomials $\{F_{i}:=F_{i}(t,X_{1},..., X_{\lfloor \frac{n+1}{2} \rfloor})\}$ such that each positive integer whose squareroot has a continued…
The concept of QCD sum rules is extended to bound states composed of particles with finite mass such as scalar quarks or strange quarks. It turns out that mass corrections become important in this context. The number of relevant corrections…
We give two quantum algorithms for computing (twisted) Kloosterman sums attached to a finite field $\mathbf{F}$ of $q$ elements. The first algorithm computes a quantum state containing, as its coefficients with respect to the standard…
We prove that quadratical quasigroups form a variety Q of right and left simple groupoids. New examples of quadratical quasigroups of orders 25 and 29 are given. The fine structure of quadratical quasigroups and inter-relationships between…
We show that $n$-bit integers can be factorized by independently running a quantum circuit with $\tilde{O}(n^{3/2})$ gates for $\sqrt{n}+4$ times, and then using polynomial-time classical post-processing. The correctness of the algorithm…