Language classes defined by generalized quantum Turing machine

DOI10.1142/S1230161208000262MaRDI QIDQ3567163zbMATH OpenFDO

Authors Masanori Ohya, S. Iriyama

Publication date 11 June 2010

Published in Open Systems & Information Dynamics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1230161208000262

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• On generalized quantum Turing machine and its application
• On generalized quantum Turing machine and its applications
• REVIEW ON QUANTUM CHAOS ALGORITHM AND GENERALIZED QUANTUM TURING MACHINE
• Computational complexity and applications of quantum algorithm
• Quantum Complexity Theory

Cites work

• scientific article; zbMATH DE number 1530002 (Why is no real title available?)
• Complexities and their applications to characterization of chaos
• Compound channels, transition expectations, and liftings
• New quantum algorithm for studying NP-complete problems
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Rigorous Estimation of Computational Complexity for OMV SAT Algorithm
• Strengths and Weaknesses of Quantum Computing

Cited in

(8)

• A Note on the Ohya-Masuda Quantum Algorithm
• New quantum algorithm solving the NP complete problem
• Computational complexity and applications of quantum algorithm
• On generalized quantum Turing machine and its applications
• On quantum algorithm for binary search and its computational complexity
• REVIEW ON QUANTUM CHAOS ALGORITHM AND GENERALIZED QUANTUM TURING MACHINE
• On generalized quantum Turing machine and its application
• Formal semantics of a classical-quantum language

This page was built for publication: Language classes defined by generalized quantum Turing machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3567163)