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 of The International Symposium on Multiple-Valued Logic
Pages322-327
Number of pages6
DOIs
Publication statusPublished - 2013
Externally publishedYes
Event2013 IEEE 43rd International Symposium on Multiple-Valued Logic, ISMVL 2013 - Toyama, Japan
Duration: May 22 2013May 24 2013

Other

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

Fingerprint

Finite automata
State Machine
Quantum Circuits
Strictly
Restriction
Networks (circuits)
Demonstrate

Keywords

  • Design For Test
  • Quantum FSM
  • Reversible FSM

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

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 of The International Symposium on Multiple-Valued Logic (pp. 322-327). [6524684] https://doi.org/10.1109/ISMVL.2013.15

Analysis of reversible and quantum finite state machines using homing, synchronizing and distinguishing input sequences. / Lukac, Martin; Kameyama, Michitaka; Perkowski, Marek; Kerntopf, Pawel.

Proceedings of The International Symposium on Multiple-Valued Logic. 2013. p. 322-327 6524684.

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

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 of The International Symposium on Multiple-Valued Logic., 6524684, pp. 322-327, 2013 IEEE 43rd International Symposium on Multiple-Valued Logic, ISMVL 2013, Toyama, Japan, 5/22/13. https://doi.org/10.1109/ISMVL.2013.15
Lukac M, Kameyama M, Perkowski M, Kerntopf P. Analysis of reversible and quantum finite state machines using homing, synchronizing and distinguishing input sequences. In Proceedings of The International Symposium on Multiple-Valued Logic. 2013. p. 322-327. 6524684 https://doi.org/10.1109/ISMVL.2013.15
Lukac, Martin ; Kameyama, Michitaka ; Perkowski, Marek ; Kerntopf, Pawel. / Analysis of reversible and quantum finite state machines using homing, synchronizing and distinguishing input sequences. Proceedings of The International Symposium on Multiple-Valued Logic. 2013. pp. 322-327
@inproceedings{2a68eff7d1b24feaaf1004b1944ae9eb,
title = "Analysis of reversible and quantum finite state machines using homing, synchronizing and distinguishing input sequences",
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.",
keywords = "Design For Test, Quantum FSM, Reversible FSM",
author = "Martin Lukac and Michitaka Kameyama and Marek Perkowski and Pawel Kerntopf",
year = "2013",
doi = "10.1109/ISMVL.2013.15",
language = "English",
isbn = "9780769549767",
pages = "322--327",
booktitle = "Proceedings of The International Symposium on Multiple-Valued Logic",

}

TY - GEN

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

AU - Lukac, Martin

AU - Kameyama, Michitaka

AU - Perkowski, Marek

AU - Kerntopf, Pawel

PY - 2013

Y1 - 2013

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

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

KW - Design For Test

KW - Quantum FSM

KW - Reversible FSM

UR - http://www.scopus.com/inward/record.url?scp=84880709998&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880709998&partnerID=8YFLogxK

U2 - 10.1109/ISMVL.2013.15

DO - 10.1109/ISMVL.2013.15

M3 - Conference contribution

AN - SCOPUS:84880709998

SN - 9780769549767

SP - 322

EP - 327

BT - Proceedings of The International Symposium on Multiple-Valued Logic

ER -