2006
DOI: 10.1002/prop.200610315
|View full text |Cite
|
Sign up to set email alerts
|

Factorization of numbers with physical systems

Abstract: The periodicity properties of Gauss sums allow us to factor integer numbers. We show that the excitation probability amplitudes of appropriate quantum systems interacting with specific laser fields are determined by Gauss sums. The resulting probabilities are experimentally accessible by measuring the fluorescence from this level. In particular, we discuss a two‐photon transition in a ladder system driven by a chirped laser pulse. In addition, we consider two realizations of laser driven one‐photon transitions… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2007
2007
2016
2016

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 37 publications
(28 citation statements)
references
References 43 publications
0
28
0
Order By: Relevance
“…Here we discuss a different algorithm based on Gauss sums [17]. An NMR implementation with proton spins (spin 1/2) demonstrates this algorithm by applying a series of phase gates in terms of phase shifted π-pulses [14].…”
Section: Number Factorizationmentioning
confidence: 99%
“…Here we discuss a different algorithm based on Gauss sums [17]. An NMR implementation with proton spins (spin 1/2) demonstrates this algorithm by applying a series of phase gates in terms of phase shifted π-pulses [14].…”
Section: Number Factorizationmentioning
confidence: 99%
“…For j = 2, the truncated exponential sum reduces to a truncated Gauss sum. 6 If is a factor of N , all the terms interfere constructively and the modulo squared of the truncated exponential sum assumes its maximum value, i.e. 1.…”
Section: Factorization With Truncated Gauss Sumsmentioning
confidence: 99%
“…In the present section we summarize the key steps of Shor's algorithm 4 . The central idea bases on the connection of the factorization problem to the problem of determining the order r in modular exponentiation n r mod N = 1,…”
Section: A Glimpse On Shor's Algorithmmentioning
confidence: 99%