Automata with Quantum and Classical Resources

情報処理学会 Web Site

書誌事項

タイトル別名
  • 招待論文

この論文をさがす

説明

Quantum automata have been studied as simple quantum computation models. They can be considered models of small (or restricted) quantum computers. In this paper we give descriptions of several kinds of quantum automata and show their power in comparison to their classical counterparts. We also give descriptions of quantum automata that have additional classical computational resources. Introducing classical computational resources can enhance the power of quantum automata since this approach relaxes such restrictions as reversible state transitions.

Quantum automata have been studied as simple quantum computation models. They can be considered models of small (or restricted) quantum computers. In this paper, we give descriptions of several kinds of quantum automata and show their power in comparison to their classical counterparts. We also give descriptions of quantum automata that have additional classical computational resources. Introducing classical computational resources can enhance the power of quantum automata, since this approach relaxes such restrictions as reversible state transitions.

収録刊行物

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ