Equivalence Checking of Quantum Finite-State Machines
Formal Languages and Automata Theory
2022-09-13 v3 Quantum Physics
Abstract
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 .
Keywords
Cite
@article{arxiv.1901.02173,
title = {Equivalence Checking of Quantum Finite-State Machines},
author = {Qisheng Wang and Junyi Liu and Mingsheng Ying},
journal= {arXiv preprint arXiv:1901.02173},
year = {2022}
}
Comments
Minor corrections. 29 pages, 2 figures, 3 tables, 2 algorithms