On Sun, Apr 19, 2020, 10:28 AM James Bowery <[email protected]> wrote:
> > > On Sun, Apr 19, 2020 at 6:47 AM John Rose <[email protected]> wrote: > "... Indeed the fact that quantum computers can outperform classical > computers for certain problems..." > > Is this a fact, distinct from the demonstration that classical > digital-analogue annealing systems outperform classical computers for > certain problems? > Quantum computers have used Shor's algorithm to factor numbers as large as 21. (The factors are 3 x 7). In theory, that and Grover's algorithm could break most crypto, but we haven't been able to build one that powerful yet. It should be possible, in principle, to predict chemistry by modeling the movements and forces on atoms and electrons. For example, I put in H2O and it gives me the density and freezing point if water. But that requires solving Schrodinger's wave equation. Approximating solutions numerically on a classical computer takes exponential time in the number of particles. Somehow nature solved it linearly. These aren't proofs that quantum computing is faster. It might be that P = NP. ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/T117bc2d94b89dd03-M7db7e7c0157609879385e0b3 Delivery options: https://agi.topicbox.com/groups/agi/subscription
