A note on the circuit complexity of PP

In this short note, we show that for any integer k, there are languages in the complexity class PP that do not have Boolean circuits of size nk.