  This paper summarises the results obtained by the author and his
collaborators in a program logic approach to the verification of quantum
programs, including quantum Hoare logic, invariant generation and termination
analysis for quantum programs. It also introduces the notion of proof outline
and several auxiliary rules for more conveniently reasoning about quantum
programs. Some problems for future research are proposed at the end of the
paper.
