An Efficient Deterministic Quantum Algorithm for the Integer Square-free Decomposition Problem

Details An Efficient Deterministic Quantum Algorithm for the Integer Square-free Decomposition Problem An Efficient Deterministic Quantum Algorithm for the Integer Square-free Decomposition Problem

2011-08-30

arxiv.org/abs/1108.5848v1

Physics

Quantum Physics

19 pages, 9 figures

Scientific paper

Quantum computers are known to be qualitatively more powerful than classical computers, but so far only a small number of different algorithms have been discovered that actually use this potential. It would therefore be highly desirable to develop other types of quantum algorithms that widen the range of possible applications. Here we propose an efficient and deterministic quantum algorithm for finding the square-free part of a large integer - a problem for which no efficient classical algorithm exists. The algorithm relies on properties of Gauss sums and uses the quantum Fourier transform. We give an explicit quantum network for the algorithm. Our algorithm introduces new concepts and methods that have not been used in quantum information processing so far and may be applicable to a wider class of problems.

Affiliated with

Also associated with

No associations

Rating

An Efficient Deterministic Quantum Algorithm for the Integer Square-free Decomposition Problem 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 An Efficient Deterministic Quantum Algorithm for the Integer Square-free Decomposition Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Efficient Deterministic Quantum Algorithm for the Integer Square-free Decomposition Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-728817