Dyakonov seems to overlook Feynman's point that Nature does the computations of how quantum systems like amino acid chains behave and the behavior is quite consistent in spite of having 10^3000 variables. Holevo's theorem shows that an n-bit quantum computer cannot yield more that n bits of information, so in a sense those 2^N are almost all going to cancel out when you look for the answer. I suggest reading Scott Aaronson's blog. He has discussed the problems of quantum computing many times and written a very nice book "Quantum Computing Since Democritus". Brent On 11/21/2018 1:20 PM, Dan Asimov wrote:
I am a complete ignoramus about quantum computing, so this article roughly doubled my knowledge of it.
I will say this: That article by Mikhail Dyakonov is *extremely* clear and well-written.
—Dan
Hans Havermann schrieb: ----- In the IEEE Spectrum last week, Mikhail Dyakonov presented his overview of the field:
https://spectrum.ieee.org/computing/hardware/the-case-against-quantum-comput... -----
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun