Super-linear time lower bound for QBF

Prove that the quantified Boolean formula (QBF) problem requires super-linear time (i.e., n^{1+ε} time for some ε > 0) on robust machine models such as multitape Turing machines.

Background

Improving alternating-time simulations would imply meaningful lower bounds, including a super-linear time lower bound for QBF, a central problem in complexity and proof systems.

The authors explicitly note that such a super-linear lower bound for QBF remains open, despite significant related work.