Prime factorization is the decomposition of an integer into its prime factors. At present no algorithm is known that can find a factor of a very large integer in polynomial time on a classical computer. The security of codes e.g. the RSA cryptographic scheme relies on this fact, however, it could be broken by the Shor algorithm provided an elaborate quantum computer were available.
We investigate a hypothetical device that could be called a ''quantum analogue computer'' with the only purpose to factor integers. It consists of a non-harmonic trap filled with a fixed number of bosonic atoms that can be excited to a definite energy characterized by the number to be factored. The trap is designed such that after excitation the individual atoms have single particle energies depending exactly on one of the factors.
A simultaneous measurement of all single particle energies then gives the factors. A trap with a single particle spectrum where the energies depend logarithmically on the quantum numbers can be used for this protocol.
A controlled interaction between the bosons that can be switched on and off is needed as well. In recent work several different logarithmic spectra were studied and potentials associated with them were determined. The protocol was refined for traps in one or two dimensions and for the cases of two or more factors. The main results are published in the articles [1-3].