Recent Comments
-
Recent Posts
- My Notices AMS Paper on Quantum Computers – Eight Years Later, a Lecture by Dorit Aharonov, and a Toast to Michael Ben-Or
- Arturo Merino, Torsten Mütze, and Namrata Apply Gliders for Hamiltonicty!
- Updates from Cambridge
- Random Circuit Sampling: Fourier Expansion and Statistics
- Plans and Updates: Complementary Pictures
- Updates and Plans IV
- Three Remarkable Quantum Events at the Simons Institute for the Theory of Computing in Berkeley
- Yair Shenfeld and Ramon van Handel Settled (for polytopes) the Equality Cases For The Alexandrov-Fenchel Inequalities
- On the Limit of the Linear Programming Bound for Codes and Packing
Top Posts & Pages
- My Notices AMS Paper on Quantum Computers - Eight Years Later, a Lecture by Dorit Aharonov, and a Toast to Michael Ben-Or
- Arturo Merino, Torsten Mütze, and Namrata Apply Gliders for Hamiltonicty!
- Amazing: Justin Gilmer gave a constant lower bound for the union-closed sets conjecture
- Navier-Stokes Fluid Computers
- To cheer you up in difficult times 23: the original hand-written slides of Terry Tao's 2015 Einstein Lecture in Jerusalem
- An Aperiodic Monotile
- Can Category Theory Serve as the Foundation of Mathematics?
- Taking balls away: Oz' Version
- Lovasz's Two Families Theorem
RSS
Author Archives: Gil Kalai
My Notices AMS Paper on Quantum Computers – Eight Years Later, a Lecture by Dorit Aharonov, and a Toast to Michael Ben-Or
The first part of the post is devoted to eight-year anniversary of my 2016 paper. I will go on to describe a recent lecture by Dorit Aharonov and conclude with my toast to Michael Ben-Or. The Quantum Computer Puzzle, Notices … Continue reading
Arturo Merino, Torsten Mütze, and Namrata Apply Gliders for Hamiltonicty!
Happy Passover to all our readers On the way from Cambridge to Tel Aviv I had a splendid three hour visit to London (from Kings Cross to UCL and back), where I met my graduate student Gabriel Gendler and Freddie … Continue reading
Updates from Cambridge
I am writing from Cambridge, UK, where I participated in an impressive conference celebrating Tim Gowers’s 60 birthday and I am about to take part in a satellite workshop of Theoretical computer science. Coming here was the first time I … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Conferences
Tagged Avi Wigderson, Tim Gowers
7 Comments
Random Circuit Sampling: Fourier Expansion and Statistics
Update: In the comment section, Kodlu asked me about my overall review of the Google 2019 supremacy claim and my response is here. Update 2 (04/04/34): See the end of the post for quantum computers news from Microsoft and Quantinuum: … Continue reading
Posted in Physics, Quantum, Statistics
Tagged quantum supremacy, Tomer Shoham, Yosi Rinott
8 Comments
Plans and Updates: Complementary Pictures
Jerusalem October 4, 2023 The picture on the right is from ~ 60 years ago. Tel Aviv, five sunsets and a horse
Updates and Plans IV
A carpet of flowers in Shokeda, near Gaza, a few years ago. This is the fourth post of this type (I (2008); II(2011); III(2015).) I started planning this post in 2019 but as it turned out, earlier drafts have quickly … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Geometry, People, personal, Updates
Tagged Combinatorics, Updates
1 Comment
Three Remarkable Quantum Events at the Simons Institute for the Theory of Computing in Berkeley
In the picture (compare it to this picture in this post) you can see David DiVincenzo’s famous 7-steps road map (from 2000) to quantum computers, with one additional step “quantum supremacy on NISQ computers” that has proposed around 2010. Step … Continue reading
Posted in Computer Science and Optimization, Physics, Quantum
Tagged Dolev Bluvstein, Michael Ben-Or, Oded Regev
5 Comments
Yair Shenfeld and Ramon van Handel Settled (for polytopes) the Equality Cases For The Alexandrov-Fenchel Inequalities
Two weeks ago, I participated (remotely) in the discrete geometry Oberwolfach meeting, and Ramon van Handel gave a beautiful lecture about the equality cases of Alexandrov-Fenchel inequalities which is among the most famous problems in convex geometry. In the top … Continue reading
Posted in Combinatorics, Convexity, Geometry
Tagged Igor Pak, Ramon van Handel, Rolf Schneider, Swee Hong Chan, Yair Shenfeld
2 Comments
On the Limit of the Linear Programming Bound for Codes and Packing
Alex Samorodnitsky The most powerful general method for proving upper bounds for the size of error correcting codes and of spherical codes (and sphere packing) is the linear programming method that goes back to Philippe Delsarte. There are very interesting … Continue reading
Posted in Combinatorics, Convexity, Geometry
Tagged Alex Samorodnitsky, error-correcting codes, Philippe Delsarte, spherical codes
2 Comments
TYI 54: A Variant of Elchanan Mossel’s Amazing Dice Paradox
The following question was inspired by recent comments to the post on Elchanan Mossel’s amazing Dice Paradox. A fair dice is a dice that when thrown you get each of the six possibilities with probability 1/6. A random dice is … Continue reading