Related papers: Factorizing numbers with classical interference: s…
We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…
We propose a semiclassical version of Shor's quantum algorithm to factorize integer numbers, based on spin-1/2 SU(2) generalized coherent states. Surprisingly, we find evidences that the algorithm's success probability is not too severely…
We demonstrate that a modification of the classical index calculus algorithm can be used to factor integers. More generally, we reduce the factoring problem to finding an overdetermined system of multiplicative relations in any factor base…
We analyze effective approximation of unitary matrices. In our formulation, a unitary matrix is represented as a product of rotations in two-dimensional subspaces, so-called Givens rotations. Instead of the quadratic dimension dependence…
With the recent success of representation learning methods, which includes deep learning as a special case, there has been considerable interest in developing techniques that incorporate known physical constraints into the learned…
The aim of this note is to survey the factorizations of the Fibonacci infinite word that make use of the Fibonacci words and other related words, and to show that all these factorizations can be easily derived in sequence starting from…
We offer multiplication method for factoring big natural numbers which extends the group of the Fermat's and Lehman's factorization algorithms and has run-time complexity $O(n^{1/3})$. This paper is argued the finiteness of proposed…
Due to recent technological advances, actual quantum devices are being constructed and used to perform computations. As a result, many classical problems are being restated so as to be solved on quantum computers. Some examples include…
We apply general difference calculus in order to obtain solutions to the functional equations of the second order. We show that factorization method can be successfully applied to the functional case. This method is equivariant under the…
We provide an algebraic setting for cumulants and factorial moments through the classical umbral calculus. Main tools are the compositional inverse of the unity umbra, connected with the logarithmic power series, and a new umbra here…
Unitary Fourier transform lies at the core of the multitudinous computational and metrological algorithms. Here we show experimentally how the unitary Fourier transform-based phase estimation protocol, used namely in quantum metrology, can…
We construct linear operators factorizing the three bases of symmetric polynomials: monomial symmetric functions m(x), elementary symmetric polynomials E(x), and Schur functions s(x), into products of univariate polynomials.
To factor an integer N, given that it is equal to the product of two primes, it suffices to find an integer d satisfying a certain simple numerical test. In this approach, the factorization problem equates to the problem of designing an…
Our objective is to calculate the derivatives of data corrupted by noise. This is a challenging task as even small amounts of noise can result in significant errors in the computation. This is mainly due to the randomness of the noise,…
Optical computing harnesses the speed of light to perform vector-matrix operations efficiently. It leverages interference, a cornerstone of quantum computing algorithms, to enable parallel computations. In this work, we interweave quantum…
In this paper we will argue that the superposition of waves can be calculated and taught in a simple way. We show, using the Gauss's method to sum an arithmetic sequence, how we can construct the superposition of waves - with different…
A detailed analysis of the remainder obtained by truncating the Euler series up to the $n$th-order term is presented. In particular, by using an approach recently proposed by Weniger, asymptotic expansions of the remainder, both in inverse…
We introduce a new factorial function which agrees with the usual Euler gamma function at both the positive integers and at all half-integers, but which is also entire. We describe the basic features of this function.
We report an experimental demonstration of a complied version of Shor's algorithm using four photonic qubits. We choose the simplest instance of this algorithm, that is, factorization of N=15 in the case that the period $r=2$ and exploit a…
Let n be any odd natural number other than a perfect square, in this article it is demonstrated that this new factorization algorithm is much more efficient than the implementation technique [2,3 p.1470], described in this article, of the…