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 when scaled appropriately allows us to find the prime number decompositions of integers. We implement this idea exploiting polychromatic optical interference in a multipath interferometer and factor seven-digit numbers. We give an estimate for the largest number that can be factored by this scheme.
Factoring numbers with a single interferogram
GARUCCIO, Augusto;
2011-01-01
Abstract
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 when scaled appropriately allows us to find the prime number decompositions of integers. We implement this idea exploiting polychromatic optical interference in a multipath interferometer and factor seven-digit numbers. We give an estimate for the largest number that can be factored by this scheme.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.