Related papers: Linear quantum addition rules

Let $\mathcal{H}^{*}=\{h_1,h_2,\ldots\}$ be an ordered set of integers. We give sufficient conditions for the existence of increasing sequences of natural numbers $a_j$ and $n_k$ such that $n_k+h_{a_j}$ is a sum of two squares for every…

Let m be a positive integer and a,q two rational numbers. Denote by AP_m(a,q) the set of rational numbers d such that a,a+q,...,a+(m-1)q form an arithmetic progression in the Edwards curve E_d:x^2+y^2=1+d x^2 y^2. We study the set AP_m(a,q)…

For a fixed positive integer $m$ and any partition $m = m_1 + m_2 + \cdots + m_e$ , there exists a sequence $\{n_{i}\}_{i=1}^{k}$ of positive integers such that $$m=\frac{1}{n_{1}}+\frac{1}{n_{2}}+\cdots+\frac{1}{n_{k}},$$ with the property…

The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial…

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…

Let $A(q)=\sum_{n=0}^{\infty}a_n q^n$ and $B(q)=\sum_{n=0}^{\infty}b_n q^n$ be two eta quotients. Previously, we considered the problem of when \[ a_n=0 <=> b_n=0. \] Here we consider the ``mod $m$'' version of this problem, i.e. eta…

We present a formula for the number of line segments connecting q+1 points of an n_1 x...x n_k rectangular grid. As corollaries, we obtain formulas for the number of lines through at least q points and, respectively, through exactly q…

The behavior of solutions of the following nonlinear difference equations \[ x_{n+1}=\displaystyle\frac{q}{p+x_n^{\nu}} \quad \text{and} \quad y_{n+1}=\displaystyle\frac{q}{-p+y_n^{\nu}}, \] where $p, q \in\mathbb{R}^+$ and $\nu\in…

It is shown that there is an absolute constant $C$ such that any rational $\frac bq\in]0, 1[, (b, q)=1$, admits a representation as a finite sum $\frac bq=\sum_\alpha\frac {b_\alpha}{q_\alpha}$ where $\sum_\alpha\sum_ia_i(\frac…

A new $q$-analogue of Appell polynomial sequences and their generalizations are introduced and their main characterizations are proved. As consequences new $q$-analogue of Bernoulli and Euler polynomials and numbers is introduced, their…

Quantum Machine Learning(QML) is developed by combining quantum mechanics principles with classical machine learning techniques in a hybrid framework that can give faster, exponential, more efficient power of quantum computing with the data…

Although quantum circuits have been ubiquitous for decades in quantum computing, the first complete equational theory for quantum circuits has only recently been introduced. Completeness guarantees that any true equation on quantum circuits…

Let $q$ be a prime power, let $\mathbb F_q$ be the finite field with $q$ elements and let $d_1, \ldots, d_k$ be positive integers. In this note we explore the number of solutions $(z_1, \ldots, z_k)\in\overline{\mathbb F}_q^k$ of the…

We consider some $q$-series which depend on a pair of positive integers $(k,m)$. While positivity of these series holds for the first few values of $(k,m)$, the situation is quite unclear for other values of $(k,m)$. In addition, our series…

Motivated by the quantum algorithm in \cite{MN05} for testing commutativity of black-box groups, we study the following problem: Given a black-box finite ring $R=\angle{r_1,...,r_k}$ where $\{r_1,r_2,...,r_k\}$ is an additive generating set…

Quons are particles characterized by the parameter $q$, which permits smooth interpolation between Bose and Fermi statistics; $q=1$ gives bosons, $q=-1$ gives fermions. In this paper we give a heuristic argument for an extension of…

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…

We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…

Several kinds of q-orthogonal polynomials with |q|=1 are constructed as the main parts of the eigenfunctions of new solvable discrete quantum mechanical systems. Their orthogonality weight functions consist of quantum dilogarithm functions,…

Quantification starts with sum and product rules that express combination and partition. These rules rest on elementary symmetries that have wide applicability, which explains why arithmetical adding up and splitting into proportions are…