A Note on the Ohya-Masuda Quantum Algorithm

DOI10.1023/A:1015644508998MaRDI QIDQ4547076zbMATH OpenOpenAlexFDO

Authors Miroljub Dugić

Publication date 21 August 2002

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

Full work available at URL https://doi.org/10.1023/a:1015644508998

zbMATH Keywords

NP-complete problem of the complexity theoryphysical implementationsatisfiability problem

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum computation (81P68)

Recommendations

• scientific article; zbMATH DE number 1583866
• Rigorous Estimation of Computational Complexity for OMV SAT Algorithm
• On generalized quantum Turing machine and its applications
• On generalized quantum Turing machine and its application
• Language classes defined by generalized quantum Turing machine

Cited in

(3)

• scientific article; zbMATH DE number 1583866 (Why is no real title available?)
• Rigorous Estimation of Computational Complexity for OMV SAT Algorithm
• Quantum digital-to-analog conversion algorithm using decoherence

This page was built for publication: A Note on the Ohya-Masuda Quantum Algorithm

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