Developing structured testing methodologies for quantum programs.

Quantum computing is currently, and has been a steadily growing field for many years, recently experiencing rapid growth. The field is drawing a lot of attention with many interested in discovering how quantum computers can be utilised to solve tough classical problems.

Quantum programs and algorithms require the programmer to define a quantum circuit and populate it with gates and a certain level of knowledge in quantum mechanics and linear algebra is necessary to understand how these programs work. These 'quantum properties' like superposition and entanglement that make quantum computers distinct from classical computers, also make them particularly challenging to test when compared to classical programs, posing a novel problem for researchers to solve.

It is agreed within the research community that the software testing methodologies for contemporary quantum programs are insufficient. Adequate testing methodologies need to be discovered for the increasingly complex quantum algorithms that will be developed in the future. With our research we aim to develop and make it easier to develop or modify classical testing methodologies that are well suited for testing quantum programs.

There are comparatively few examples of quantum programs and defects in quantum programs that can be used to evaluate the efficacy of testing methodologies. To that end, we begin by gathering a varied set of benchmark programs and develop a framework around them to select, execute, measure and execute tests on quantum programs by relevant criteria.