Analysis of Reversible and Quantum Finite State Machines using Homing, Synchronizing and Distinguishing Input Sequences
Martin Lukac , Michitaka Kameyama , Marek Perkowski , Paweł Kerntopf
AbstractWe present an analysis of the Reversible and Quantum Finite State Machines (QFSM) realized as Quantum Circuits using the three well known sequences applied in the analysis of the classical Finite State Machines (FSM). The synchronizing, the homing and the distinguishing sequences are applied to both strictly Reversible FSM (RFSM) and QFSM in order to determine the power of these new techniques in the above mentioned new models of sequential devices. In particular, care is taken to demonstrate these classical techniques on the RFSM and the one-way QFSMs. We show certain properties of the RFSM/QFSM with respect to these sequences and we show what are the restrictions and advantages.
|Publication size in sheets||0.5|
|Book||Guerrero Juan (eds.): Proceedings 2013 IEEE 43rd International Symposium on Multiple-Valued Logic, 2013, IEEE Computer Society, ISBN 978-0-7695-4976-7, 352 p.|
|Score|| = 10.0, 29-02-2020, BookChapterMatConfByIndicator|
= 15.0, 29-02-2020, BookChapterMatConfByIndicator
|Publication indicators||= 1.0|
|Citation count*||1 (2015-04-25)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.