Language Classes Defined by Generalized Quantum Turing Machine
From MaRDI portal
Publication:3567163
DOI10.1142/S1230161208000262zbMath1188.81046MaRDI QIDQ3567163
Masanori Ohya, Satoshi Iriyama
Publication date: 11 June 2010
Published in: Open Systems & Information Dynamics (Search for Journal in Brave)
Related Items (4)
On Quantum Algorithm for Binary Search and Its Computational Complexity ⋮ Computational complexity and applications of quantum algorithm ⋮ On Generalized Quantum Turing Machine and Its Applications ⋮ New quantum algorithm solving the NP complete problem
Cites Work
- Unnamed Item
- Complexities and their applications to characterization of chaos
- Compound channels, transition expectations, and liftings
- New quantum algorithm for studying NP-complete problems
- Rigorous Estimation of Computational Complexity for OMV SAT Algorithm
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Strengths and Weaknesses of Quantum Computing
This page was built for publication: Language Classes Defined by Generalized Quantum Turing Machine
