Equivalence Checking of Quantum Finite-State Machines

8 Jan 2019 · Qisheng Wang, Junyi Liu, Mingsheng Ying ·

In this paper, we introduce the model of quantum Mealy machines and study the equivalence checking and minimisation problems of them. Two efficient algorithms are developed for checking equivalence of two states in the same machine and for checking equivalence of two machines. As an application, they are used in equivalence checking of quantum circuits. Moreover, the minimisation problem is proved to be in $\textbf{PSPACE}$.

PDF Abstract

Code

Add Remove Mark official

wangqs13/qmm-benchmark official

Datasets

Add Datasets introduced or used in this paper

Edit Social Preview

Equivalence Checking of Quantum Finite-State Machines

Code Edit Add Remove Mark official

Categories

Datasets Edit

Code

Add Remove Mark official

Datasets