1) The document discusses whether quantum computing needs a formal logic in the same way that classical computing is understood through classical logic. It examines previous proposals for "quantum logics" and focuses on Sequential Quantum Logic (SQL). 2) SQL models sequences of quantum measurements and operations through projection operators and sequential conjunction. The document proposes testing SQL propositions through a quantum algorithm that prepares an encoded "history state" and applies renormalization operations. 3) The proposed algorithm could test SQL propositions with exponentially small probability of success. Several open questions are raised about generalizing and improving SQL as a logic for quantum computing.