Quantum finite state machines as sequential quantum circuits

Lukac Martin, Marek Perkowski

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

9 Citations (Scopus)

Abstract

In this paper we present the synthesis process of quantum finite state machines for sequence detection based on the synthesis of quantum sequential circuits. Such machines have many applications for instance in robotics. We show the relation between the quantum circuit and the natural ability of quantum systems to retain the quantum state. We consider cases where a single qubit in a circuit represents a quantum state and another is used as the input qubit. We analyze some of the well known circuits as sequence detectors and describe their behaviors. We show that the standard quantum logic synthesis can be used for both the synthesis of quantum circuits as well as for quantum finite state machines used as sequence detectors.

Original languageEnglish
Title of host publicationProceedings of The International Symposium on Multiple-Valued Logic
Pages92-97
Number of pages6
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event39th International Symposium on Multiple-Valued Logic, ISMVL 2009 - Naha, Okinawa, Japan
Duration: May 21 2009May 23 2009

Other

Other39th International Symposium on Multiple-Valued Logic, ISMVL 2009
CountryJapan
CityNaha, Okinawa
Period5/21/095/23/09

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Quantum finite state machines as sequential quantum circuits'. Together they form a unique fingerprint.

  • Cite this

    Martin, L., & Perkowski, M. (2009). Quantum finite state machines as sequential quantum circuits. In Proceedings of The International Symposium on Multiple-Valued Logic (pp. 92-97). [5010381] https://doi.org/10.1109/ISMVL.2009.46