Quantum Computing

Quantum Computing

There may be small ways to access the special quantum properties of the atom and such. But mathematics and creativity may also lend a hand in solving so-called hard problems. The most difficult aspect of any such advanced computing, is the continual problems and limits in precision.

We are trying to enforce our predictable mechanical world and problems on the tiny latent indeterministic one. To then get answers to quantum problems, which only exist (as difficult) because of the limited place we live and think.

So lets consider the NP-Complete problem. This is one that cannot be solved in polynomial, or non-exponential, time. Bitcoin's mining algorithm is supposedly NP-Complete.

Where the difficult problem exists is where we need quantum computing or new thinking. In practice, many typical NP-hard problems are actually almost solvable in polynomial time, because of computer optimization, etc.

But carefully created problems are forcing this issue of precision. Bitcoin for now must be proving this. When so many combinations are really possible, with limited pruning-the -tree available, something special has arrived which allows encryption to work.

I guess part of the genius of Bitcoin and Encryption generally, is that it uses our weakness in the quantum to ensure immutability or security in the present. I suppose harder problems will arise as improvements in computing do.