Classical simulability and the significance of modular exponentiation in Shor's algorithm
Quantum Physics
2009-11-13 v1
Abstract
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.
Cite
@article{arxiv.0706.0872,
title = {Classical simulability and the significance of modular exponentiation in Shor's algorithm},
author = {Nadav Yoran and Anthony J. Short},
journal= {arXiv preprint arXiv:0706.0872},
year = {2009}
}