Live Breaking News & Updates on Craig Gidney

Stay updated with breaking news from Craig gidney. Get real-time updates on events, politics, business, and more. Visit us for reliable news and exclusive interviews.

Quanta Magazine

Quanta Magazine
quantamagazine.org - get the latest breaking news, showbiz & celebrity photos, sport news & rumours, viral videos and top stories from quantamagazine.org Daily Mail and Mail on Sunday newspapers.

United States , Vinod Vaikuntanathan , Craig Gidney , Daniel Simon , Greg Kuperberg , Seyoon Ragavan , University Of California , Princeton University ,

Shtetl-Optimized » Blog Archive » GPT-4 gets a B on my quantum computing final exam!

[Warning: This might be the longest Shtetl-Optimized post of all time! But that's OK; I expect most people will only want to read the introductory part anyway.] As I've mentioned before, economist, blogger, and friend Bryan Caplan was unimpressed when ChatGPT got merely a D on his Labor Economics midterm. So on Bryan's blog, appropriately… ....

Justin Yirka , Brendan Mckay , Andrew Tate , Scott Aaronson , Bryan Caplan , Craig Gidney , International Math Olympiad , Committee Of Guardians , Labor Economics , Quantum Information Science , Extra Credit , Graph Isomorphism , Laszlo Babai , Suppose Alice , Assume Alice , Gidney Says , Boy Says , Computer Says , Blog Archive , Varadharajan Says , Shtetl Optimized Committee ,

Shtetl-Optimized » Blog Archive » Doubts about teapot supremacy: my reply to Richard Borcherds


Richard Borcherds is a British mathematician at Berkeley, who won the 1998 Fields Medal for the proof of the monstrous moonshine conjecture among many other contributions. A couple months ago, Borcherds posted on YouTube a
self-described “rant” about quantum computing, which was recently making the rounds on Facebook and which I found highly entertaining.
Borcherds points out that the term “quantum supremacy” means only that quantum computers can outperform existing classical computers on
some benchmark, which can be chosen to show maximum advantage for the quantum computer. He allows that BosonSampling could have some value, for example in calibrating quantum computers or in comparing one quantum computer to another, but he decries the popular conflation of quantum supremacy with the actual construction of a scalable quantum computer able (for example) to run Shor’s algorithm to break RSA. ....

United Kingdom , United States , Gil Kalai , Ernest Davis , Scott Aaronson , Ewin Tang , Des Smith , Sergio Boixo , Richard Borcherds , Radford Neal , James Gallagher , Terry Rudolph , Craig Gidney , Physics Stack Exchange , Stack Exchange , Extended Church Turing Thesis , John Horgan , Scientific American , Barak Says , Awbrey Says , Stone Soup Fallacy , Gidney Says , Neal Says , Zelinsky Says , Boixo Says , Gallagher Says ,