Equivalence Checking Paradigms in Quantum Circuit Design: A Case Study
TimeWednesday, July 13th10:30am - 10:53am PDT
Location3005, Level 3
Event Type
Research Manuscript
Quantum Computing
DescriptionAs state-of-the-art quantum computers are capable of running increasingly complex algorithms, the need for automated
methods to design and test potential applications rises. Equivalence checking of quantum circuits is an important, yet
hardly automated, task in the development of the quantum software stack. Recently, new methods have been proposed that tackle this problem from different perspectives. However, there is no established baseline on which to
judge current and future progress in equivalence checking of quantum circuits. To this end we conduct a detailed case
study of two of the most prominent equivalence checking methodologies and compare their strengths and weaknesses.