- To cheer you up in difficult times 6: Play Rani Sharim’s two-player games of life, read Maya Bar-Hillel presentation on catching lies with statistics, and more.
- To cheer you up in difficult times 5: A New Elementary Proof of the Prime Number Theorem by Florian K. Richter
- To cheer you up in difficult times 4: Women In Theory present — I will survive
- To cheer you up in difficult times 3: A guest post by Noam Lifshitz on the new hypercontractivity inequality of Peter Keevash, Noam Lifshitz, Eoin Long and Dor Minzer
- Harsanyi’s Sweater
- To cheer you up in difficult times II: Mysterious matching news by Gal Beniamini, Naom Nisan, Vijay Vazirani and Thorben Tröbst!
- Trees not Cubes! Memories of Boris Tsirelson
- A small update from Israel and memories from Singapore: Partha Dasgupta, Robin Mason, Frank Ramsey, and 007
- Game Theory – on-line Course at IDC, Herzliya
Top Posts & Pages
- Game Theory 2020
- 'Gina Says'
- TYI 30: Expected number of Dice throws
- The seventeen camels riddle, and Noga Alon's camel proof and algorithms
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Dan Romik on the Riemann zeta function
- To cheer you up in difficult times 6: Play Rani Sharim's two-player games of life, read Maya Bar-Hillel presentation on catching lies with statistics, and more.
- The story of Poincaré and his friend the baker
- Why is mathematics possible?
Tag Archives: Quantum error-correction
Quanta Magazine published an interview with me about quantum computers. It was a pleasure discussing this issue with Katia Moskvitch and I enjoyed also the photo session with David Vaaknin who also took a video of me explaining the importance of … Continue reading
One of my main research directions in the last decade is quantum information theory and quantum computers. (See this post and this one.) It is therefore a pleasure to report and give many links on the massive efforts carried out these … Continue reading
Next Week in Jerusalem: Special Day on Quantum PCP, Quantum Codes, Simplicial Complexes and Locally Testable Codes
Special Quantum PCP and/or Quantum Codes: Simplicial Complexes and Locally Testable CodesDay בי”ס להנדסה ולמדעי המחשב 24 Jul 2014 – 09:30 to 17:00 room B-220, 2nd floor, Rothberg B Building On Thursday, the 24th of July we will host a SC-LTC (simplicial complexes … Continue reading
This is the third and last post giving a timeline and some non technical highlights from my debate with Aram Harrow. Where were we After Aram Harrow and I got in touch in June 2011, and decided to have … Continue reading
This is the second of three posts giving few of the non-technical highlights of my debate with Aram Harrow. (part I) After Aram Harrow and I got in touch in June 2011, and decided to have a blog debate about … Continue reading
How the debate came about (Email from Aram Harrow, June 4, 2011) Dear Gil Kalai, I am a quantum computing researcher, and was wondering about a few points in your paper… (Aram’s email was detailed and thoughtful and at the … Continue reading
Heavier than air flight of the 21 century? The very first post on this blog entitled “Combinatorics, Mathematics, Academics, Polemics, …” asked the question “Are mathematical debates possible?” We also had posts devoted to debates and to controversies. A few days ago, … Continue reading
I wrote a short paper entitled “when noise accumulates” that contains the main conceptual points (described rather formally) of my work regarding noisy quantum computers. Here is the paper. (Update: Here is a new version, Dec 2010.) The new exciting innovation in computer … Continue reading
“Imagine there’s no heaven, it’s easy(?) if you try,” John Lennon Disclaimer: It is a reasonable belief (look here, and here), and an extremely reasonable working assumption (look here) that computationally superior quantum computers can be built. (This post and the draft … Continue reading