Quantum Computing and the Hunt for Hidden Symmetry.
Gorjan Alagic, Alexander C. Russell · 2007
In 1994, Peter Shor gave e cient quantum algorithms for factoring integers and extracting discrete logarithms [20]. If we believe that nature will permit us to faithfully implement our current model of quantum computation, then these algorithms dramatically contradict the Strong Church-Turing thesis. 1