Implementation of an iterative quantum order finding algorithm

Details Implementation of an iterative quantum order finding algorithm Implementation of an iterative quantum order finding algorithm

2011-11-17

arxiv.org/abs/1111.4147v1

Physics

Quantum Physics

5 pages, 3 figures

Scientific paper

Quantum algorithms are computational routines that exploit quantum mechanics to solve problems exponentially faster than the best classical algorithms. The quantum order finding algorithm is a key example---it is the subroutine that delivers the exponential speed-up in Shor's factoring algorithm. To date, the demand on quantum resources---qubits and logic gates---even for small instances, has meant that there have been only four experimental realisations. We demonstrate a scalable, iterative order finding algorithm that uses one third the number of qubits in a scalable way. Encoding in higher-dimensional states, we implement a two-photon compiled algorithm for which the algorithmic output exhibits structure that is sensitive to noise, in contrast to previous demonstrations. These results point to larger-scale implementations of Shor's algorithm by harnessing substantial but scalable resource reductions applicable to all physical architectures.

Affiliated with

Also associated with

No associations

Rating

Implementation of an iterative quantum order finding algorithm 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 Implementation of an iterative quantum order finding algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Implementation of an iterative quantum order finding algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-350243