NMR implementation of Factoring Large Numbers with GaußSums: Suppression of Ghost Factors
arXiv:0803.3396 · doi:10.1209/0295-5075/84/40006
Abstract
Finding the factors of an integer can be achieved by various experimental techniques, based on an algorithm developed by Schleich et al., which uses specific properties of Gaußsums. Experimental limitations usually require truncation of these series, but if the truncation parameter is too small, it is no longer possible to distinguish between factors and so-called "ghost" factors. Here, we discuss two techniques for distinguishing between true factors and ghost factors while keeping the number of terms in the sum constant or only slowly increasing. We experimentally test these modified algorithms in a nuclear spin system, using NMR.
arXiv comment4 pages, 5 figures
References in corpus (8)
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
- Experimental demonstration of Shor's algorithm with quantum entanglement
- Demonstration of Shor's quantum factoring algorithm using photonic qubits
- Disorder Effects in Superconducting Multiple Loop Quantum Interferometers
- NMR experiment factors numbers with Gauss sums
- Factorization of Numbers with the temporal Talbot effect: Optical implementation by a sequence of shaped ultrashort pulses
- Gauss sum factorization with cold atoms
- Factorizing Numbers with the Gauss Sum Technique: NMR Implementations
Cited by in corpus (13)
- Quantum Computing with NMR
- Factoring numbers with a single interferogram
- Prime Number Decomposition using the Talbot Effect
- Factorization of numbers with Gauss sums: I. Mathematical background
- New factorization algorithm based on a continuous representation of truncated Gauss sums
- Quantum speed-up in solving the maximal clique problem
- NMR implementations of Gauss sums
- Factorization of numbers with Gauss sums: II. Suggestions for implementations with chirped laser pulses
- Analogue algorithm for parallel factorization of an exponential number of large integers II. Optical implementation
- Factorization of numbers with truncated Gauss sums at rational arguments
- Analogue algorithm for parallel factorization of an exponential number of large integers I. Theoretical description
- Factorization of numbers with Gauss sums: III. Algorithms with Entanglement
- An Efficient Deterministic Quantum Algorithm for the Integer Square-free Decomposition Problem