Equivalence Checking of Quantum Finite-State Machines release_x2m4lqgz5bhajmo56kavahflai

by Qisheng Wang and Junyi Liu and Mingsheng Ying

Released as a article .

2019  

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. They are applied in experiments of equivalence checking of quantum circuits. Moreover, it is shown that the minimisation problem is proved to be in PSPACE.
In text/plain format

Archived Files and Locations

application/pdf  330.9 kB
file_p4e7iuehdndencukrs2obdpx2m
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Archived
Type  article
Stage   submitted
Date   2019-01-08
Version   v1
Language   en ?
arXiv  1901.02173v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 8a0672aa-b676-44ca-9e70-23bf819befb8
API URL: JSON