Factorization of numbers with Gauss sums: III. Algorithms with entanglement

Details Factorization of numbers with Gauss sums: III. Algorithms with entanglement Factorization of numbers with Gauss sums: III. Algorithms with entanglement

Jan 2012

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2012njph...14a3049w&link_type=abstract

New Journal of Physics, Volume 14, Issue 1, pp. 013049 (2012).

Physics

Scientific paper

We propose two algorithms to factor numbers using Gauss sums and entanglement: (i) in a Shor-like algorithm we encode the standard Gauss sum in one of two entangled states and (ii) in an interference algorithm we create a superposition of Gauss sums in the probability amplitudes of two entangled states. These schemes are rather efficient provided that there exists a fast algorithm that can detect a period of a function hidden in its zeros.

Affiliated with

Also associated with

No associations

Rating

Factorization of numbers with Gauss sums: III. Algorithms with entanglement does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Factorization of numbers with Gauss sums: III. Algorithms with entanglement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Factorization of numbers with Gauss sums: III. Algorithms with entanglement will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1641658