We provide a theoretical study of frequency-shifted feedback (FSF) lasers, ie, lasers with an
internal frequency shifter, seeded with a monochromatic wave. The resulting spectrum …

Determining the prime factors of a given number N is a problem that requires super-
polynomial time for conventional digital computers. A polynomial-time algorithm was …

We construct an analog computer based on light interference to encode the hyperbolic
function f (ζ)≡ 1/ζ into a sequence of skewed curlicue functions. The resulting interferogram …

In this work, we describe the capabilities of Magnonic Holographic Memory (MHM) for
parallel database search and prime factorization. MHM is a type of holographic device …

Factorization of numbers with Gauss sums: I. Mathematical background Page 1 OPEN ACCESS
Factorization of numbers with Gauss sums: I. Mathematical background To cite this article: S …

We report a detailed analysis of the optical realization of the analogue algorithm described
in the first paper of this series (Tamma in Quantum Inf Process 11128: 1190, 2015) for the …

We describe a novel analogue algorithm that allows the simultaneous factorization of an
exponential number of large integers with a polynomial number of experimental runs. It is …

The phase φ of any wave is determined by the ratio x/λ consisting of the distance x
propagated by the wave and its wavelength λ. Hence, the dependence of φ on λ constitutes …

In this paper, we will describe a new factorization algorithm based on the continuous
representation of Gauss sums, generalizable to orders j> 2. Such an algorithm allows one …

A challenge in the Gauss-sum factorization scheme is the presence of ghost factors,
nonfactors that behave similarly to actual factors of an integer, which might lead to the …