On generalized quantum Turing machine and its applications

DOI10.1142/S1230161209000141MaRDI QIDQ3558812zbMATH OpenFDO

Authors Masanori Ohya, S. Iriyama

Publication date 10 May 2010

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

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

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• On generalized quantum Turing machine and its application
• Language classes defined by generalized quantum Turing machine
• Computational complexity and applications of quantum algorithm
• REVIEW ON QUANTUM CHAOS ALGORITHM AND GENERALIZED QUANTUM TURING MACHINE
• Rigorous Estimation of Computational Complexity for OMV SAT Algorithm

Cites work

• Complexities and their applications to characterization of chaos
• Compound channels, transition expectations, and liftings
• scientific article; zbMATH DE number 1530002 (Why is no real title available?)
• Language classes defined by generalized quantum Turing machine
• New quantum algorithm for studying NP-complete problems
• Rigorous Estimation of Computational Complexity for OMV SAT Algorithm

Cited in

(8)

• New quantum algorithm solving the NP complete problem
• Rigorous Estimation of Computational Complexity for OMV SAT Algorithm
• REVIEW ON QUANTUM CHAOS ALGORITHM AND GENERALIZED QUANTUM TURING MACHINE
• Language classes defined by generalized quantum Turing machine
• A Note on the Ohya-Masuda Quantum Algorithm
• On generalized quantum Turing machine and its application
• Generalized Turing quantum machine and its alternative bulk NMR implementation
• Quantum algorithm for SAT problem andquantum mutual entropy

This page was built for publication: On generalized quantum Turing machine and its applications

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