21 Nov
2018
21 Nov
'18
5:52 p.m.
On Nov 21, 2018, at 3:05 PM, Adam P. Goucher <apgoucher@gmx.com> wrote:
Every argument in Dyakonov's article seems to also apply to the probabilistic classical computing model. In order to be a valid criticism against quantum computers, it would need to explain why unitary matrices are inherently different from doubly stochastic matrices.
I agree. This point is often lost (and Scott Aaronson is right to emphasize it): the “state” of classical probabilistic computers with n bits is also a 2^n-dimensional vector. - Cris