Recent Comments
-
Recent Posts
- The Trifference Problem
- Greatest Hits 2015-2022, Part II
- Greatest Hits 2015-2022, Part I
- Tel Aviv University Theory Fest is Starting Tomorrow
- Alef’s Corner
- A Nice Example Related to the Frankl Conjecture
- Amazing: Justin Gilmer gave a constant lower bound for the union-closed sets conjecture
- Barnabás Janzer: Rotation inside convex Kakeya sets
- Inaugural address at the Hungarian Academy of Science: The Quantum Computer – A Miracle or Mirage
Top Posts & Pages
- TYI 30: Expected number of Dice throws
- Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
- The Trifference Problem
- Amazing: Justin Gilmer gave a constant lower bound for the union-closed sets conjecture
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- To cheer you up in difficult times 11: Immortal Songs by Sabine Hossenfelder and by Tom Lehrer
- Test your intuition 29: Diameter of various random trees
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- Colorful Caratheodory Revisited
RSS
Monthly Archives: October 2019
Amazing! Keith Frankston, Jeff Kahn, Bhargav Narayanan, Jinyoung Park: Thresholds versus fractional expectation-thresholds
This post describes a totally unexpected breakthrough about expectation and thresholds. The result by Frankston, Kahn, Narayanan, and Park has many startling applications and it builds on the recent breakthrough work of Alweiss, Lovett, Wu and Zhang on the sunflower … Continue reading
Posted in Combinatorics, Probability
Tagged Bhargav Narayanan, Jeff Kahn, Jinyoung Park, Keith Frankston
7 Comments
Starting today: Kazhdan Sunday seminar: “Computation, quantumness, symplectic geometry, and information”
Sunday, 27 October, 2019 – 14:00 to 16:00 Repeats every week every Sunday until Sat Feb 01 2020 Location: Ross 70 See also: Seminar announcement; previous post Symplectic Geometry, Quantization, and Quantum Noise. The Google supremacy claims are discussed (with … Continue reading
The story of Poincaré and his friend the baker
Update: After the embargo update (Oct 25): Now that I have some answers from the people involved let me make a quick update: 1) I still find the paper unconvincing, specifically, the few verifiable experiments (namely experiments that can be … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Probability, Quantum, Statistics
Tagged Google, Henri Poincaré, quantum supremacy
28 Comments
Gérard Cornuéjols’s baker’s eighteen 5000 dollars conjectures
Gérard Cornuéjols Gérard Cornuéjols‘s beautiful (and freely available) book from 2000 Optimization: Packing and Covering is about an important area of combinatorics which is lovely described in the preface to the book The integer programming models known as set packing … Continue reading
Noisy quantum circuits: how do we know that we have robust experimental outcomes at all? (And do we care?)
In a recent post we discussed Google’s claim of achieving “quantum supremacy” and my reasons to think that these claims will not stand. (See also this comment for necessary requirements from a quantum supremacy experiment.) This debate gives a good … Continue reading
Posted in Computer Science and Optimization, Quantum
Tagged chaos, chaos and computation, quantum supremacy
10 Comments