Author: Gregor Overney
Date: 14:04:55 02/29/00
More and more algorithms are presented that would benefit a lot from quantum computers. (Phys. Rev. Letter is full of it.) If you are interested see http://squint.stanford.edu/ Such algorithms include cryptography, Grover's algorithm for searching, factorizing of large numbers, and, of course, simulating quantum-mechanical systems. Well, we do not have a quantum computer (yet). - Anyway, if we map "quantum-state-logic" to positions in Chess, a brute force algorithm could eventually be implement-able for a quantum computer. The number of states that a quantum computer can handle (due to product representations of single quantum states) is enormous. Did anybody think about this seriously? Gregor
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.