Recent Comments

Recent Posts
 Polymath10, Post 2: Homological Approach
 Polymath10: The Erdos Rado Delta System Conjecture
 Convex Polytopes: Seperation, Expansion, Chordality, and Approximations of Smooth Bodies
 Igor Pak’s collection of combinatorics videos
 EDP Reflections and Celebrations
 Séminaire N. Bourbaki – Designs Exist (after Peter Keevash) – the paper
 Important formulas in Combinatorics
 Updates and plans III.
 NogaFest, NogaFormulas, and Amazing Cash Prizes
Top Posts & Pages
 The KadisonSinger Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
 Polymath10, Post 2: Homological Approach
 Polymath10: The Erdos Rado Delta System Conjecture
 New Ramanujan Graphs!
 Four Derandomization Problems
 Why is Mathematics Possible: Tim Gowers's Take on the Matter
 Extremal Combinatorics III: Some Basic Theorems
 The Mystery PianoPlayer at the MittagLeffler Institute
 Why Quantum Computers Cannot Work: The Movie!
RSS
Category Archives: Computer Science and Optimization
My Quantum Debate with Aram II
This is the second of three posts giving few of the nontechnical 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
My Quantum Debate with Aram Harrow: Timeline, Nontechnical Highlights, and Flashbacks I
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
A Few Slides and a Few Comments From My MIT Lecture on Quantum Computers
I gathered a few of the comments made by participants of my lecture “Why quantum computers cannot work and how”, and a few of my answers. Here they are along with some of the lecture’s slides. Here is the link … Continue reading
Meeting with Aram Harrow, and my Lecture on Why Quantum Computers Cannot Work.
Last Friday, I gave a lecture at the quantum information seminar at MIT entitled “Why quantum computers cannot work and how.” It was a nice event with lovely participation during the talk, and a continued discussion after it. Many very … Continue reading
Ann Lehman’s Sculpture Based on Herb Scarf’s Maximal Lattice Free Convex Bodies
Maximal latticefree convex bodies introduced by Herb Scarf and the related complex of maximal lattice free simplices (also known as the Scarf complex) are remarkable geometric constructions with deep connections to combinatorics, convex geometry, integer programming, game theory, fixed point computations, … Continue reading
Posted in Art, Computer Science and Optimization, Economics, Games
Tagged Ann Lehman, Herb Scarf
3 Comments
Symplectic Geometry, Quantization, and Quantum Noise
Over the last two meetings of our HU quantum computation seminar we heard two talks about symplectic geometry and its relations to quantum mechanics and quantum noise. Yael Karshon: Manifolds, symplectic manifolds, Newtonian mechanics, quantization, and the non squeezing theorem. … Continue reading
Lionel Pournin found a combinatorial proof for SleatorTarjanThurston diameter result
I just saw in Claire Mathieu’s blog “A CS professor blog” that a simple proof of the SleatorTarjanThurston’s diameter result for the graph of the associahedron was found by Lionel Pournin! Here are slides of his lecture “The diameters of associahedra” … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Convex polytopes
Tagged Associahedron, Lionel Pournin
1 Comment
The Quantum Debate is Over! (and other Updates)
Quid est noster computationis mundus? Nine months after is started, (much longer than expected,) and after eight posts on GLL, (much more than planned,) and almost a thousand comments of overall good quality, from quite a few participants, my … Continue reading
The Quantum FaultTolerance Debate Updates
In a couple of days, we will resume the debate between Aram Harrow and me regarding the possibility of universal quantum computers and quantum fault tolerance. The debate takes place over GLL (Godel’s Lost Letter and P=NP) blog. The Debate Where were … Continue reading
Greg Kuperberg: It is in NP to Tell if a Knot is Knotted! (under GRH!)
Wolfgang Haken found an algorithm to tell if a knot is trivial, and, more generally with Hemion, if two knots are equivalent. Joel Hass, Jeff Lagarias and Nick Pippinger proved in 1999 that telling that a knot is unknotted is … Continue reading