This work proposes two new approaches to verifying the correctness of quantum programs, based on interactive proofs and foundational results in quantum complexity theory. One approach eliminates the need for making intermediate test measurements by embedding circuit execution into a Hamiltonian, and the other allows classical verification of a quantum program without needing direct access to intermediate states. We also discuss and connect the two meanings of verification within the contexts of quantum program analysis and complexity theory.