Automata with Quantum and Classical Resources (特集:量子計算と量子情報)
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 一般社団法人情報処理学会の論文
- 2005-10-15
著者
-
NAKANISHI Masaki
Nara Institute of Science and Technology
-
Nakanishi Masaki
Nara Inst. Sci. And Technol. Ikoma‐shi Jpn
関連論文
- Bit Length Optimization of Fractional Part on Floating to Fixed Point Conversion for High-Level Synthesis(Logic and High Synthesis)(VLSI Design and CAD Algorithms)
- Look Up Table Compaction Based on Folding of Logic Functions(Special Section on VLSI Design and CAD Algorithms)
- Robust Quantum Algorithms Computing OR with ε-Biased Oracles(Quantum Computing,Foundations of Computer Science)
- Bit-Length Optimization Method for High-Level Synthesis Based on Non-linear Programming Technique(System Level Design,VLSI Design and CAD Algorithms)
- An Efficient and Effective Algorithm for Online Task Placement with I/O Communications in Partially Reconfigurable FPGAs(System Level Design,VLSI Design and CAD Algorithms)
- Quantum versus Classical Pushdown Automata in Exact Computation (特集:量子計算と量子情報)
- An efficient middle-level framework for quantum circuit simulation on multiple simulator platforms (コンピュータシステム)
- Automatic Generation of Java-Based, Database-Independent Query API
- Automatic Generation of Java-Based, Database-Independent Query API
- Secure Processor Architecture for High-Speed Verification of Memory Integrity
- Automata with Quantum and Classical Resources (特集:量子計算と量子情報)
- Quantum Walks on the Line with Phase Parameters
- Quantum versus Classical Pushdown Automata in Exact Computation