We make use of the algebraic theory that has been used to study the complexity of constraint satisfaction problems, to investigate tractable quantified boolean formulas. We give a new and simple algebraic proof of the tractability of quantified 2-satisfiability. We also give a purely algebraic characterization of models for quantified Horn formulas that were given by B\"{u}ning, Subramani, and Zhao, and described proof-theoretically.