Author: José de Jesús García Ruvalcaba
Date: 03:25:13 10/26/02
Go up one level in this thread
On October 25, 2002 at 13:15:50, Vincent Diepeveen wrote: >On October 25, 2002 at 02:25:37, ERNIE COLLADO wrote: > >>I don't know anything about computers, so forgive me if this sounds like a >>stupid question. >> >>How would todays leading chess programs like Fritz & Junior do on a quantum >>computer? Would they be unbeatable? Thanks <Ernie> > >The problem is. How do you plan to make a computer that only >exists for a 1/10000000000000000 second. Secondly, can you show me >a picture of a quantum. That's the smallest detail you could show of course. > >It's imposible to make a computer from something you don't know what it >looks like IMHO. > >Last but least. Why would this be faster than say a PIII computer. Who >garantuees me that you can make a computer out of 'quantums' within >1/1000000000000 of a second and then also get a result out of it that's >having more information than a PIII can calculate. Hi Vincent, quantum computers are not "faster" than conventional ones, the trick is that quantum algorithms have a smaller computational complexity. It is difficult to design quantum algorithms, I do not know if there is already one to do a chess search, but it is highly non-trivial. One guy one won a big prize just for designing a quantum algorithm to factorize natural numbers into prime factors, just to give an idea. I am not an expert on quantum computers, so sorry if I can not answer very technical questions. José.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.