相关论文: Linear quantum addition rules

A new method for computing sums on a quantum computer is introduced. This technique uses the quantum Fourier transform and reduces the number of qubits necessary for addition by removing the need for temporary carry bits. This approach also…

PARITY is the problem of determining the parity of a string $f$ of $n$ bits given access to an oracle that responds to a query $x\in\{0,1,...,n-1\}$ with the $x^{\rm th}$ bit of the string, $f(x)$. Classically, $n$ queries are required to…

Let $q$ be a Pisot or Salem number. Let $f_j(x)$ $(j=1,2,\dots)$ be integer-valued polynomials of degree $\ge2$ with positive leading coefficients, and let $\{a_j (n)\}_{n\ge1}$ $(j=1,2,\dots)$ be sequences of algebraic integers in the…

As a natural generalization of ordinary Lie algebras we introduce the concept of quantum Lie algebras ${\cal L}_q(g)$. We define these in terms of certain adjoint submodules of quantized enveloping algebras $U_q(g)$ endowed with a quantum…

$q$-analogs of special functions, including hypergeometric functions, play a central role in mathematics and have numerous applications in physics. In the theory of probability, $q$-analogs of various probability distributions have been…

A monic polynomial in F_q[t] of degree n over a finite field F_q of odd characteristic can be written as the sum of two irreducible monic elements in F_q[t] of degrees n and n-1 if q is larger than a bound depending only on n. The main tool…

This paper gives a universal definition of $\mathbb{F}_q [t]$ in $\mathbb{F}_q (t)$ using 89 quantifiers, more direct than those that exist in the current literature. The language $\mathcal{L}_{\mbox{rings}, t}$ we consider here is the…

Generalizations of the three main equations of quantum physics, namely, the Schr\"odinger, Klein-Gordon, and Dirac equations, are proposed. Nonlinear terms, characterized by exponents depending on an index $q$, are considered in such a way…

Let $(U_n)_{n\geq 0}$ be a fixed linear recurrence sequence of integers with order at least two, and for any positive integer $\ell$, let $\ell \cdot 2^{\ell} + 1$ be a Cullen number. Recently in \cite{bmt}, generalized Cullen numbers in…

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}…

In this sequence of work we investigate polynomial equations of additive functions. We consider the solutions of equation \[ \sum_{i=1}^{n}f_{i}(x^{p_{i}})g_{i}(x)^{q_{i}}= 0 \qquad \left(x\in \mathbb{F}\right), \] where $n$ is a positive…

In mathematical aspect, we introduce quantum algorithm and the mathematical structure of quantum computer. Quantum algorithm is expressed by linear algebra on a finite dimensional complex inner product space. The mathematical formulations…

A hyperbinary partition of the nonnegative integer n is a partition where every part is a power of 2 and every part appears at most twice. We give three applications of the length generating function for such partitions, denoted by h_q(n).…

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…

We introduce a class of permutation polynomial over $\mathbb F_{q^n}$ that can be written in the form $\frac{L(x)}{x^{q+1}}$ or $\frac{L(x^{q+1})}x$ for some $q$-linear polynomial $L$ over $\mathbb F_{q^n}$. Specifically, we present those…

We show that for any polynomial $f: \mathbb{Z}\to \mathbb{Z}$ with positive leading coefficient and irreducible over $\mathbb{Q}$, if $N$ is large enough then there are two strings of consecutive positive integers $I_{1}=\{n_1-m,\ldots,…

Let $M_q(n)$ be the standard quantized matrix algebra, introduced by Faddeev, Reshetikhin, and Takhtajan. It is shown, by constructing an appropriate monomial ordering $\prec$ on its PBW $K$-basis ${\cal B}$ , that $M_q(n)$ is a solvable…

Let $r$ be a prime power and $q=r^m$. For $0\le i\le m-1$, let $f_i\in \mathbb{F}_r[x]$ be $q$-linearized and $a_i\in \mathbb{F}_q$. Assume that $z\in \mathbb{\bar{F}}_r$ satisfies the equation $\sum_{i=0}^{m-1}a_if_i(z)^{r^i}=0$, where…

Suppose that $(U_{n})_{n \geq 0}$ is a binary recurrence sequence and has a dominant root $\alpha$ with $\alpha>1$ and the discriminant $D$ is square-free. In this paper, we study the Diophantine equation $U_n + U_m = x^q$ in integers $n…

Let $q$ be a prime power and let $\mathcal{R}=\mathbb{F}_{q}[u_1,u_2, \cdots, u_k]/\langle f_i(u_i),u_iu_j-u_ju_i\rangle$ be a finite non-chain ring, where $f_i(u_i), 1\leq i \leq k$ are polynomials, not all linear, which split into…