相关论文: Quadratic Frobenius probable prime tests costing t…
It is known that difference equations generated as the Newton-Raphson iteration for quadratic equations are solvable in closed form, and the solution can be constructed from linear three-term recurrence relations with constant coefficients.…
Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab+cd of two ordered products ab and cd such that min(a, b) > max(c, d). An easy corollary is a proof of Fermat's Theorem expressing primes in 1 + 4N as sums of two…
Given a large positive integer $N$, how quickly can one construct a prime number larger than $N$ (or between $N$ and 2N)? Using probabilistic methods, one can obtain a prime number in time at most $\log^{O(1)} N$ with high probability by…
This article study the average conditioning for a random underdetermined polynomial system. The expected value of the moments of the condition number are compared to the moments of the condition number of random matrices. An expression for…
Previously, a formula, incorporating a $5F4$ hypergeometric function, for the Hilbert-Schmidt-averaged determinantal moments $\left\langle \left\vert \rho^{PT}\right\vert ^{n}\left\vert \rho\right\vert ^{k}\right\rangle /\left\langle…
Let $1<c<832/825$. For large real numbers $N>0$ and a small constant $\vartheta>0$, the inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\vartheta \end{equation*} has a solution in prime numbers $p_1,\,p_2,\,p_3,\,p_4$ such that,…
We present an algorithm that, on input of a positive integer N together with its prime factorization, constructs a finite field F and an elliptic curve E over F for which E(F) has order N. Although it is unproved that this can be done for…
The geometric separability probability of composite quantum systems is extensively studied in the last decades. One of most simple but strikingly difficult problem is to compute the separability probability of qubit-qubit and rebit-rebit…
It is shown that if the ring of constants of a restricted differential Lie algebra with a quasi-Frobenius inner part satisfies a polynomial identity (PI) then the original prime ring has a generalized polynomial identitiy (GPI). If…
An (association) scheme is said to be Frobenius if it is the scheme of a Frobenius group. A scheme which has the same tensor of intersection numbers as some Frobenius scheme is said to be pseudofrobenius. We establish a necessary and…
We survey results about prime number races, that is, results about the relative sizes of prime counting functions $\pi_{q,a}(x)$, with $q$ fixed and $a$ varying. In particular, we describe recent work by the authors on these problems.
We estimate the number of primes represented by a general quadratic polynomial with discriminant $\Delta$, assuming that the corresponding real character is exceptional.
Most quantum gate errors can be characterized by two error models, namely the probabilistic error model and the Kraus error model. We proved that for a quantum circuit with either of those two models or a mix of both, the propagation error…
Given a map f:Z-->Z and an initial argument alpha, we can iterate the map to get a finite set of iterates modulo a prime p. In particular, for a quadratic map f(z)=z^2 +c, c constant, work by Pollard suggests that this set should have…
We established a physically utilizable Bell inequality based on the Peres-Horodecki criterion. The new quadratic probabilistic Bell inequality naturally provides us a necessary and sufficient way to test all entangled two-qubit or…
Many applications, including rank aggregation and crowd-labeling, can be modeled in terms of a bivariate isotonic matrix with unknown permutations acting on its rows and columns. We consider the problem of estimating such a matrix based on…
The best deterministic unconditionally proven integer factorization algorithms have exponential running time complexities of O(N^(1/4)) arithmetic operations, and conditional on the Riemann hypothesis, there is a deterministic algorithm of…
Polynomial time primality tests for specific classes of numbers of the form $k\cdot 2^m \pm 1$ are introduced.
The computer simulations of the process of single pulse readout from the flux-biased phase qubit is performed in the frame of one-dimensional Schroedinger equation. It has been demonstrated that the readout error can be minimized by…
Shor's algorithm for factoring in polynomial time on a quantum computer\cite{Shor} gives an enormous advantage over all known classical factoring algorithm. We demonstrate how to factor products of large prime numbers using a compiled…