Author: Janosch Zwerensky
Date: 09:31:44 08/02/05
Go up one level in this thread
>It is claimed that quantum computers can solve the problem in O(n^0.5) and not >in O(n) and it is against my common sense. Who said that quantum theory and its consequences need be in agreement with common sense? ;) A quite accessible description of the quantum algorithm underlying fast unordered database searches can for example be found at http://en.wikipedia.org/wiki/Grover's_algorithm . Regards, Janosch
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.