Landmark computer science proof cascades through physics and math (quantamagazine.org)

Article summary

A new proof in computer science has implications for quantum mechanics and pure mathematics, combining ideas from Alan Turing and Albert Einstein. The proof establishes that quantum computers can theoretically be used to verify answers to a vast set of problems. It also settles two other questions: Tsirelson's problem in physics and the Connes embedding conjecture in mathematics. The results have significant implications for our understanding of entanglement and computational complexity.

Main themes

• quantum computing
• entanglement
• computational complexity
• mathematics
• physics
• Turing's halting problem

What commenters say

• The article fails to explain the distinction between sharing an entangled particle pair and sharing a seed to a random number generator.
• The use of entangled particles in the nonlocal game allows for a 100% win rate, which cannot be achieved with classical communication.
• The article's explanation of the nonlocal game is unclear and requires additional context to understand.
• Sharing a classical seed is not enough to always win the game, and the article does not provide a clear explanation of why entangled particles are different.
• The problem of distinguishing between a true quantum random number generator and a pseudorandom number generator is related to the halting problem.
• The article's simplification of the nonlocal game makes it difficult to understand the significance of the results.
• The use of entangled particles in the game is not equivalent to communication, but rather a correlation between the particles that cannot be explained by classical physics.