Classical simulability and the significance of modular exponentiation in Shor's algorithm

Details Classical simulability and the significance of modular exponentiation in Shor's algorithm Classical simulability and the significance of modular exponentiation in Shor's algorithm

2007-06-06

arxiv.org/abs/0706.0872v1

Phys. Rev. A 76, 060302(R) (2007).

Physics

Quantum Physics

4 pages, 2 figures

Scientific paper

10.1103/PhysRevA.76.060302

We show that a classical algorithm efficiently simulating the modular exponentiation circuit, for certain product state input and with measurements in a general product state basis at the output, can efficiently simulate Shor's factoring algorithm. This is done by using the notion of the semi-classical Fourier transform due to Griffith and Niu, and further discussed in the context of Shor's algorithm by Browne.

Affiliated with

Also associated with

No associations

Rating

Classical simulability and the significance of modular exponentiation in Shor's 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 Classical simulability and the significance of modular exponentiation in Shor's algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classical simulability and the significance of modular exponentiation in Shor's algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-357303