正在加载视频...

视频加载失败

This is a breaking podcast. We're premiering a new paradigm for quantizing 4D gravity here first, without strings. Neil Turok — inaugural Higgs Chair at Edinburgh, former director of Perimeter Institute, and 2026 Fellow of the Royal Society — believes quantum gravity may not require strings, extra dimensions, or...

42,877 次观看 • 4 个月前 •via X (Twitter)

0 条评论

暂无评论

原始帖子的评论将显示在这里

相关视频

OpenAI cracked a batch of supposedly quantum-only problems on a regular laptop, and the promised advantage disappeared with them. Speed had nothing to do with it. The model hunted for hidden structure that lets an ordinary machine take the same shortcut. > CLAIM - every published problem pitched as beyond classical reach, gathered in one place > STRIP - each one reduced to the math it actually asks for, with the pitch removed > HUNT - the model searches for low-rank and sampling structure a laptop can exploit > BUILD - a classical algorithm written for every problem where that structure turned up > RACE - both approaches run on the same instance sizes and timed side by side > KEEP - only the problems that survive the race stay on the quantum list A surprising share of the list did not make it through. Several fell to careful sampling on one ordinary CPU. Their speedup leaned on an assumption, not on physics: that the classical side could only read data one entry at a time. Give the laptop the same access the quantum machine was granted, and the gap closes. None of this makes quantum computing hype. The problems that survived are now the honest ones, with the shortcut ruled out. Every survivor is a stronger case than before, because something tried hard to kill it and failed. The field rarely runs this audit on itself. Nobody gets funded for proving their own speedup was never there. Read on for the surviving problems and every one a laptop took back.

wast3

13,440 次观看 • 1 个月前