Analysis of reversible and quantum finite state machines using homing, synchronizing and distinguishing input sequences

Martin Lukac, Michitaka Kameyama, Marek Perkowski, Pawel Kerntopf

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We 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.

Original languageEnglish
Title of host publicationProceedings - 2013 IEEE 43rd International Symposium on Multiple-Valued Logic, ISMVL 2013
Pages322-327
Number of pages6
DOIs
Publication statusPublished - Aug 1 2013
Event2013 IEEE 43rd International Symposium on Multiple-Valued Logic, ISMVL 2013 - Toyama, Japan
Duration: May 22 2013May 24 2013

Publication series

NameProceedings of The International Symposium on Multiple-Valued Logic
ISSN (Print)0195-623X

Other

Other2013 IEEE 43rd International Symposium on Multiple-Valued Logic, ISMVL 2013
CountryJapan
CityToyama
Period5/22/135/24/13

Keywords

  • Design For Test
  • Quantum FSM
  • Reversible FSM

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Analysis of reversible and quantum finite state machines using homing, synchronizing and distinguishing input sequences'. Together they form a unique fingerprint.

  • Cite this

    Lukac, M., Kameyama, M., Perkowski, M., & Kerntopf, P. (2013). Analysis of reversible and quantum finite state machines using homing, synchronizing and distinguishing input sequences. In Proceedings - 2013 IEEE 43rd International Symposium on Multiple-Valued Logic, ISMVL 2013 (pp. 322-327). [6524684] (Proceedings of The International Symposium on Multiple-Valued Logic). https://doi.org/10.1109/ISMVL.2013.15