Quantum computing

Quantum computing uses superposition and entanglement. Richard Feynman (1982) pointed out that ordinary computers can’t efficiently simulate typical quantum systems, and proposed quantum computers as the fix.

The Quantum, fully entangled rung is worked out for an ordinary classical machine, which has to store 2^(particles) amplitudes. This is the obstacle Feynman described.

Feynman’s point was that a classical computer needs 2^N numbers to describe N entangled particles. The Quantum, fully entangled rung is that number for a whole universe. It’s the one setting that pushes the total off the scale, because the exponent itself needs an exponent.