Related papers: Note on Integer Factoring Algorithms II
Probabilistic approach to Boolean matrix factorization can provide solutions robustagainst noise and missing values with linear computational complexity. However,the assumption about latent factors can be problematic in real world…
Considering its relevance in the field of cryptography, integer factorization is a prominent application where Quantum computers are expected to have a substantial impact. Thanks to Shor's algorithm this peculiar problem can be solved in…
We recently introduced the Fast Newton Transform (FNT), an hierarchical algorithm for performing multivariate Newton interpolation in arbitrary downward closed polynomial spaces of spatial dimension $m$. Here, we analyze the FNT in the…
A precise estimation of the computational complexity in Shor's factoring algorithm under the condition that the large integer we want to factorize is composed by the product of two prime numbers, is derived by the results related to number…
In this paper, we present an approach to integer factorization using distributed representations formed with Vector Symbolic Architectures. The approach formulates integer factorization in a manner such that it can be solved using neural…
We prove some polynomial identities from which we deduce congruences modulo $p^2$ for the Fermat quotient $\frac{2^p-2}{p}$ for any odd prime $p$ (Proposition 1 and Theorem 1). These congruences are simpler than the one obtained by…
We study the parameterized complexity of algorithmic problems whose input is an integer set $A$ in terms of the doubling constant $C := |A + A|/|A|$, a fundamental measure of additive structure. We present evidence that this new…
A method of determining two factors of an odd integer without need of multiplication or division operation in iterative portion of computation is presented. It is feasible for an implementing algorithm to use only integer addition and…
We give a {\em deterministic} algorithm for approximately computing the fraction of Boolean assignments that satisfy a degree-$2$ polynomial threshold function. Given a degree-2 input polynomial $p(x_1,\dots,x_n)$ and a parameter $\eps >…
Quantum processors are potentially superior to their classical counterparts for many computational tasks including factorization. Circuit methods as well as adiabatic methods have already been proposed and implemented for finding the…
We report a proof-of-concept demonstration of a quantum order-finding algorithm for factoring the integer 21. Our demonstration involves the use of a compiled version of the quantum phase estimation routine, and builds upon a previous…
Two novel measurement-based, quantum clustering algorithms are proposed based on quantum parallelism and entanglement. The first algorithm follows a divisive approach. The second algorithm is based on unsharp measurements, where we…
In this paper we present a new efficient algorithm for factoring the RSA and the Rabin moduli in the particular case when the difference between their two prime factors is bounded. As an extension, we also give some theoretical results on…
This paper presents two algorithms on certain computations about Pisot numbers. Firstly, we develop an algorithm that finds a Pisot number $\alpha$ such that $\Q[\alpha] = \F$ given a real Galois extension $\F$ of $\Q$ by its integral…
We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and…
Factoring large integers using a quantum computer is an outstanding research problem that can illustrate true quantum advantage over classical computers. Exponential time order is required in order to find the prime factors of an integer by…
In our preceding paper, we have proposed an algorithm for obtaining finite-norm solutions of higher-order linear ordinary differential equations of the Fuchsian type [\sum_m p_m (x) (d/dx)^m] f(x) = 0 (where p_m is a polynomial with…
We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…
This paper proposes a class of power-of-two FFT (Fast Fourier Transform) algorithms, called AM-QFT algorithms, that contains the improved QFT (Quick Fourier Transform), an algorithm recently published, as a special case. The main idea is to…
We introduce two classes of $(p,q)$-It\^o--Hermite polynomials, the post-quantum analogs of the $q$-It\^o--Hermite polynomials introduced recently by Ismail and Zhang. We study their basic properties such as their operational formulas of…