42 citations · 175 across the 47 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
quant-ph2019★ 2 cited
The Argument against Quantum Computers
Gil Kalai
We give a computational complexity argument against the feasibility of quantum computers. We identify a very low complexity class of probability distributions described by noisy in…
math.CO2019★ 1 cited
Intersection patterns of planar sets
Gil Kalai, Zuzana Patáková
Let be a family of sets in the plane. For , denote by the number of subsets of of cardinality that sa…