Asserting the Correctness of Short Implementations using Metamorphic Testing
An increasing sense of anticipation and enthusiasm surrounds quantum computing. However, several obstacles need to be overcome before quantum computing can be widely adopted. One of these is determining whether or not a quantum program is behaving according to the expectation. There are several tried-and-true methods for identifying program flaws in the traditional world, but it is far from simple to adapt them to the quantum realm. In this paper, we explore Metamorphic Testing as a promising avenue for this transition. We explore this avenue on the well-known Shor’s Algorithm, and show how it can be used to verify the validity of this testing approach on quantum algorithms.
Fri 18 NovDisplayed time zone: Beijing, Chongqing, Hong Kong, Urumqi change
22:00 - 23:00
|Automatic generation of test circuits for the verification of quantum deterministic algorithms |
|Asserting the Correctness of Short Implementations using Metamorphic Testing|
|Using Quantum Computers to Speed Up Dynamic Testing of Software|
A: Andriy Miranskyy Toronto Metropolitan University (formerly Ryerson University)Pre-print