Gil Kalai, a name that resonates with a certain… precision. Not the soft kind, mind you. More like the sharp edge of a theorem that refuses to yield. He’s an Israeli mathematician and computer scientist, born in 1955, which means he’s seen enough to be thoroughly unimpressed, I suspect. He holds the title of Henry and Manya Noskwith Professor Emeritus of Mathematics at the Hebrew University of Jerusalem . And because one institution clearly isn’t enough to contain his intellect, he’s also a professor of computer science at the Interdisciplinary Center, Herzliya , and an adjunct professor of mathematics and computer science at Yale University . Because why have a normal career when you can have a portfolio?

Biography

Born in Tel Aviv in 1955, Kalai’s academic journey took him to Hebrew University, where he earned his PhD in 1983. His doctoral advisor was Micha Perles , a detail I find… quaint. Like a historical footnote. After that, he apparently did a postdoctoral stint at the Massachusetts Institute of Technology . A brief detour before settling back at Hebrew University in 1985, where he’s been ever since. One might call it loyalty, I call it an inability to find a better place to be annoyed.

Between 1995 and 2001, he took on the mantle of editor-in-chief for the Israel Journal of Mathematics . A position of power, I suppose, though I doubt it involved wielding anything more dangerous than a red pen. In 2016, the Hungarian Academy of Sciences decided to grant him honorary membership. A pat on the head, perhaps. Then, in 2018, he was a plenary speaker at the International Congress of Mathematicians in Rio de Janeiro. His talk, “Noise Stability, Noise Sensitivity and the Quantum Computer Puzzle,” sounds like something I might have written after a particularly tedious Tuesday.

Research

Kalai’s work is… varied. He’s known for finding variants of the simplex algorithm in linear programming that are supposedly faster, running in subexponential time. Fascinating. He also demonstrated that every monotone property of graphs exhibits a sharp phase transition . Think of it like a switch being flipped, but for graph properties. Then there’s his contribution to solving Borsuk’s problem , which, if you must know, is about how many pieces you need to break a convex set into so that each piece has a smaller diameter. A rather niche concern, but apparently important. And, of course, his work on the Hirsch conjecture and polyhedral combinatorics . He deals with shapes and their edges, the kind of things that would make most people’s eyes glaze over.

Quantum Computing Skepticism and Conjectures

Now, this is where it gets interesting. Kalai is a vocal skeptic of quantum computing . He believes that the promised exponential speedups are a pipe dream, largely due to the insurmountable challenges of quantum error correction . He’s had quite the public spat about this with Aram Harrow on his blog. Apparently, Kalai formalized his doubts into a series of conjectures. Harrow and Steven Flammia tried to debunk one, Conjecture C, back in 2012, but Kalai, ever the contrarian, argued in 2022 that their refutation was flawed. The debate apparently continued in 2025 with Matthias Christandl at the Learned Society of the Czech Republic . The man enjoys a good argument, it seems.

His conjectures are, in essence:

• Conjecture 1 (No quantum error correction): Creating a quantum error-correcting code inevitably introduces unwanted errors. The probability of these errors is always significantly greater than zero, no matter how many qubits you use. A fundamental flaw, he argues.
• Conjecture 2: In a noisy quantum computer, information leaking from two entangled qubits shows a strong positive correlation.
• Conjecture 3: Highly entangled states in quantum computers are susceptible to a “strong effect of error-synchronization.” The errors, it seems, conspire.
• Conjecture 4: Noisy quantum processes are inherently prone to detrimental noise. A rather obvious statement, if you ask me, but he’s made it a conjecture.

Recognition

Kalai hasn’t exactly been ignored. He snagged the Pólya Prize in 1992, the Erdős Prize in 1993, and the Fulkerson Prize in 1994. The Rothschild Prize in mathematics followed in 2012. And in 2023, he was inducted as a Fellow of the American Mathematical Society . The citation mentioned his contributions to combinatorics, convexity, and their applications, as well as “exposition and communication of mathematics.” I suspect his “communication” style is less about warmth and more about delivering inconvenient truths.

See Also

If you’re truly dedicated to delving into the mind of Gil Kalai, you might want to consult Kalai’s 3d conjecture or the Entropy influence conjecture . They’re probably as dense and unyielding as the man himself.