Program verification for quantum algorithms

Quantum computers are improving fast, with several companies now presenting quantum computers with dozens of qbits. As quantum computers will likely be scarce for the foreseeable future, the correctness of quantum programs is an important consideration. This research investigates a formal approach to the verification of quantum programs, and evaluates the usability of that approach. Three Hoare-style logics for quantum programs are discussed, and one is used for a case study. A proof of Shor's factoring algorithm is presented in the selected logic. We conclude that while the logic is usable and a proof can be completed, several avenues of improvement are possible.