Tag Archives: Guy Kindler

The Argument Against Quantum Computers – A Very Short Introduction

Posted on December 29, 2020 by Gil Kalai

Left: Gowers’s book Mathematics a very short introduction. Right C. elegans; Boson Sampling can be seen as the C. elegans of quantum computing. (See, this paper.) Update (January 6, 2021): Tomorrow January, 7, 8:30 AM Israel time, I give a … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Physics, Probability, Quantum | Tagged , | 10 Comments

Open problem session of HUJI-COMBSEM: Problem #3, Ehud Friedgut – Independent sets and Lionel Levine’s infamous hat problem.

Posted on December 12, 2020 by Gil Kalai

Here are the two problems presented by Ehud Friedgut. The first arose by Friedgut, Kindler, and me in the context of studying  Lionel Levine’s infamous hat problem. The second is Lionel Levine’s infamous hat problem. Ehud Friedgut with a few … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Probability | Tagged , , | 7 Comments

Kelman, Kindler, Lifshitz, Minzer, and Safra: Towards the Entropy-Influence Conjecture

Posted on March 22, 2020 by Gil Kalai

Let me briefly report on a remarkable new paper by Esty Kelman, Guy Kindler, Noam Lifshitz, Dor Minzer, and Muli Safra, Revisiting Bourgain-Kalai and Fourier Entropies. The paper describes substantial progress towards the Entropy-Influence conjecture, posed by Ehud Friedgut and … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Open problems | Tagged , , , , | 1 Comment

My Argument Against Quantum Computers: An Interview with Katia Moskvitch on Quanta Magazine

Posted on February 8, 2018 by Gil Kalai

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 →

Posted in Computer Science and Optimization, Physics, Quantum | Tagged , , , , | 11 Comments

If Quantum Computers are not Possible Why are Classical Computers Possible?

Posted on October 16, 2017 by Gil Kalai

As most of my readers know, I regard quantum computing as unrealistic. You can read more about it in my Notices AMS paper and its extended version (see also this post) and in the discussion of Puzzle 4 from my … Continue reading →

Posted in Computer Science and Optimization, Physics, Quantum | Tagged , | 8 Comments

Quantum computing: achievable reality or unrealistic dream

Posted on January 10, 2015 by Gil Kalai

  Michel Dyakonov’s View on QC                                     My view (based on Michel’s drawing*) Update: Alexander Vlasov’s view (based on Michel and Mikhail’s drawing) … Continue reading →

Posted in Quantum | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 7 Comments

Next Week in Jerusalem: Special Day on Quantum PCP, Quantum Codes, Simplicial Complexes and Locally Testable Codes

Posted on July 16, 2014 by Gil Kalai

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 … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Conferences, Geometry, Quantum | Tagged , , , , , , , , , | 2 Comments

Influence, Threshold, and Noise

Posted on June 14, 2014 by Gil Kalai

  My dear friend Itai Benjamini told me that he won’t be able to make it to my Tuesday talk on influence, threshold, and noise, and asked if I already have  the slides. So it occurred to me that perhaps … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Conferences, Probability, Quantum | Tagged , , , , , , , | 6 Comments