Computer Science Proof Unveils Unexpected Form of Entanglement - Nautilus Magazine

Three computer scientists have posted a proof of the NLTS conjecture, showing that systems of entangled particles can remain difficult to analyze even away from extremes.

A striking new proof in quantum computational complexity might best be understood with a playful thought experiment. Run a bath, then dump a bunch of floating bar magnets into the water. Each magnet … [+8478 chars]

full article...