A Re-evaluation of Shor's Algorithm — mentioned by smaddox

Thu, 08 Feb 2018 06:15:14 GMT

Perhaps I don't, but your description doesn't seem to contradict my point that scalability is distinct from competitive with classical computing. Perhaps people also implicitly mean "scales faster than a classical computer", in which case I did indeed misunderstand. On the topic of whether or not the need for averaging is already accounted for in algorithmic complexity, my understanding is that it is not. This [1] preprint from 2006 seems to support my understanding. If you have evidence to the contrary, I would greatly appreciate a link. [1] https://arxiv.org/pdf/quant-ph/0612077

Paper and discussion history. A mention is not an endorsement.

A Re-evaluation of Shor's Algorithm · HackerPapers discussions

A Re-evaluation of Shor's Algorithm — mentioned by smaddox