Related papers: Factorizing numbers with classical interference: s…
Factorization models express a statistical object of interest in terms of a collection of simpler objects. For example, a matrix or tensor can be expressed as a sum of rank-one components. However, in practice, it can be challenging to…
We draw attention to various aspects of number theory emerging in the time evolution of elementary quantum systems with quadratic phases. Such model systems can be realized in actual experiments. Our analysis paves the way to a new,…
We propose three implementations of the Gauss sum factorization schemes discussed in part I of this series: (i) a two-photon transition in a multi-level ladder system induced by a chirped laser pulse, (ii) a chirped one-photon transition in…
We report the first implementation of a Gauss sum factorization algorithm by an internal state Ramsey interferometer using cold atoms. A sequence of appropriately designed light pulses interacts with an ensemble of cold rubidium atoms. The…
Summation formulas, such as the Euler-Maclaurin expansion or Gregory's quadrature, have found many applications in mathematics, ranging from accelerating series, to evaluating fractional sums and analyzing asymptotics, among others. We show…
We give algorithms to factorize large integers in the duality computer. We provide three duality algorithms for factorization based on a naive factorization method, the Shor algorithm in quantum computing, and the Fermat's method in…
The availability of working quantum computers has led to several proposals and claims of quantum advantage. In 2023, this has included claims that quantum computers can successfully factor large integers, by optimizing the search for nearby…
We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…
In this paper, we intend to present a new algorithm to factorize large numbers. According to the algorithm proposed here, we prove that there is a common factor between p and q. With this procedure, the time of factorization considerably…
A generalization of the factorization technique is shown to be a powerful algebraic tool to discover further properties of a class of integrable systems in Quantum Mechanics. The method is applied in the study of radial oscillator, Morse…
We describe a new implementation of the Bernstein-Vazirani algorithm which relies on the fact that the polarization states of classical light beams can be cloned. We explore the possibility of computing with waves and discuss a classical…
We propose an alternative method to factorize an integer by using three harmonic oscillators. These oscillators are coupled together via specific Kerr nonlinear interactions. This method can be applied even if two harmonic oscillators are…
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 will use analytic function theory and Fourier analysis to establish a characterization for some classical umbral calculus, which will focus on the generalization of the evaluation function. Although we cannot cover all the umbral…
We introduce a versatile numerical method for modeling light diffraction in periodically patterned photonic structures containing quadratically nonlinear non-centrosymmetric optical materials. Our approach extends the generalized source…
We construct an analog computer based on light interference to encode the hyperbolic function f({\zeta}) = 1/{\zeta} into a sequence of skewed curlicue functions. The resulting interferogram when scaled appropriately allows us to find the…
The factorization technique for superintegrable Hamiltonian systems is revisited and applied in order to obtain additional (higher-order) constants of the motion. In particular, the factorization approach to the classical anisotropic…
I describe the use of NMR experiments which implement Gauss sums as a method for factoring numbers and discuss whether this approach can be computationally useful.
Nowadays, parallel computing is ubiquitous in several application fields, both in engineering and science. The computations rely on the floating-point arithmetic specified by the IEEE754 Standard. In this context, an elementary brick of…
Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit…