We show that there are 0-1 and unbounded knapsack polytopes with super-polynomial extension complexity. More specifically, for each $n \in N$ we exhibit 0-1 and unbounded knapsack polytopes in dimension $n$ with extension complexity $\Omega(2^{\sqrt{n}})$.
Pokutta, S., & Van Vyve, M. (2013). A note on the extension complexity of the knapsack polytope. Operations Research Letters, 41(4), 347-350. https://doi.org/10.1016/j.orl.2013.03.010 (Original work published 2013)