Re: How long would it take a computer to completely "solve" chess?

From: David Bandel (dwb1729_at_yahoo.com)
Date: 09/10/04 

Date: 10 Sep 2004 14:50:29 -0700

kramsay@aol.com (Keith Ramsay) wrote in message news:<17a4a089.0409091643.604cb291@posting.google.com>...
> I think you may have an exaggerated view of the advantages of
> quantum computers over "classical" ones. For certain problems
> such as factoring integers into primes, there are known "quantum
> algorithms" that solve them relatively fast, even though the
> known ordinary algorithms are not so fast.
> ...
> Moore's law will surely break down before we get to the point where
> it would say we could search all the possibilities in a few minutes.
> One can fantasize about developing quantum computers where the number
> of qubits is on the order of the number of atoms, but somewhat hard
> to believe that we'll be going way beyond that point during this
> century.
>
> Keith Ramsay

I agree. I've given the problem some thought during the past few days
and I don't really see a way in which a computation which involves a
tree could be executed significantly faster on a quantum computer.

Relevant Pages

  • Re: PhD in cryptography sufficient for research in quantum computers
    ... mostly algorithms). ... Learn quantum mechanics. ... (better than what the quantum computing books teach) ...
    (sci.crypt)
  • Re: Size of RN vs USN (Was: Germany Still Loses BB...) [OFFTOPIC, BUT INTERESTING]
    ... >>That would be news to the cryptography world. ... algorithms exist which would solve these problems in polynomial time ... Sometimes it takes a lot of machines working together, ... there is this hype about quantum computes. ...
    (soc.history.war.world-war-ii)
  • Re: Quantum computer using using artificial atoms.
    ... That betrays a mystical belief about quantum mechanics, ... You can write algorithms for using an abacus, which require, an abacus. ... But you can mathematicize the operations, and a gp device can model an ... >> algorithms that make them behave like quantum computers, ...
    (sci.crypt)
  • Re: Quantum algorithm example
    ... quantum computers have over classical ones; but it should really be an ... life) Deutsch's function characterization problem is simple to explain ... The simplest realistic algorithm is probably Lov K. Grover's search ...
    (comp.theory)
  • Re: Quantum Computation
    ... >Also, note that complexity is a property of *problems*, not algorithms, ... Your last remark assumes that machines are being treated as black ... >which Quantum Computing is better than classical, ...
    (sci.physics.research)