Related papers: Quantum integers and cyclotomy
The series of some new estimates for the sums of the type \[ S_{q}(x;f)\,=\,\mathop{{\sum}'}\limits_{n\leqslant x}f(n)e_{q}(an^{*}+bn) \] is obtained. Here $q$ is a sufficiently large integer, $\sqrt{q}(\log{q})\!\ll\!x\leqslant q$, $a,b$…
While in general there is no one-to-one correspondence between complex and quaternion quantum mechanics (QQM), there exists at least one version of QQM in which a {\em partial} set of {\em translations} may be made. We define these…
Quantum signal processing is a framework for implementing polynomial functions on quantum computers. To implement a given polynomial $P$, one must first construct a corresponding complementary polynomial $Q$. Existing approaches to this…
The solution of some equations involving functional derivatives is given as a series indexed by planar binary trees. The terms of the series are given by an explicit recursive formula. Some algebraic properties of these series are…
This note describes a conjecture involving cyclotomic polynomials and some initial thoughts towards a solution. Given positive integers $m,n$, the conjecture is that either $\Phi_m(q)\leqslant\Phi_n(q)$ or $\Phi_m(q)\geqslant\Phi_n(q)$…
According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…
The main features of quantum computing are described in the framework of spin resonance methods. Stress is put on the fact that quantum computing is in itself nothing but a re-interpretation (fruitful indeed) of well-known concepts. The…
We express some general type of infinite series such as $$ \sum^\infty_{n=1}\frac{F(H_n^{(m)}(z),H_n^{(2m)}(z),\ldots,H_n^{(\ell m)}(z))} {(n+z)^{s_1}(n+1+z)^{s_2}\cdots (n+k-1+z)^{s_k}}, $$ where $F(x_1,\ldots,x_\ell)\in\mathbb…
Inspired by the work of Feynman, Deutsch, We formally propose the theory of physical computability and accordingly, the physical complexity theory. To achieve this, a framework that can evaluate almost all forms of computation using various…
Let $k$ be a positive real number, and let $M_k(q)$ be the sum of $|L(\tfrac12,\chi)|^{2k}$ over all non-principal characters to a given modulus $q$. We prove that $M_k(q)\ll_k \phi(q)(\log q)^{k^2}$ whenever $k$ is the reciprocal $n^{-1}$…
For each $q\in{\mathbb{N}}_0$, we construct positive linear polynomial approximation operators $M_n$ that simultaneously preserve $k$-monotonicity for all $0\leq k\leq q$ and yield the estimate \[ |f(x)-M_n(f, x)| \leq c…
Quantum machine learning (QML) seeks to exploit the intrinsic properties of quantum mechanical systems, including superposition, coherence, and quantum entanglement for classical data processing. However, due to the exponential growth of…
Quantum computers can solve many number theory problems efficiently. Using the efficient quantum algorithm for order finding as an oracle, this paper presents an algorithm that computes the Carmichael function for any integer $N$ with a…
Let Q be a non-singular quadratic form with integer coefficients. When Q is indefinite we provide new upper bounds for the least non-trivial integral solution to the equation Q=0. When Q is positive definite we provide improved upper bounds…
In this paper we study the following type of functions $f: \mathcal{Q}_{\mathbb{R}_{3}} \to \mathbb{R}_{3}$, where $ \mathcal{Q}_{\mathbb{R}_3}$ is the quadratic cone of the algebra $\mathbb{R}_{3}$. From the fact that it is possible to…
Quantum neural networks (QNNs) are an analog of classical neural networks in the world of quantum computing, which are represented by a unitary matrix with trainable parameters. Inspired by the universal approximation property of classical…
Given the growing quantity of proposals and works of basic hypergeometric functions in the scope of $q$-calculus, it is important to introduce a systematic classification of $q$-calculus. Our aim in this article is to investigate certain…
The divide-and-conquer framework, used extensively in classical algorithm design, recursively breaks a problem of size $n$ into smaller subproblems (say, $a$ copies of size $n/b$ each), along with some auxiliary work of cost…
The method of rational function certification for proving terminating hypergeometric identities is extended from single sums or integrals to multi-integral/sums and ``$q$'' integral/sums.
Let $K$ be a totally real number field with Galois closure $L$. We prove that if $f \in \mathbb Q[x_1,...,x_n]$ is a sum of $m$ squares in $K[x_1,...,x_n]$, then $f$ is a sum of \[4m \cdot 2^{[L: \mathbb Q]+1} {[L: \mathbb Q] +1 \choose…