Generalized Quantum Turing Machine and its Application to the SAT Chaos Algorithm

Simple item page
dc.creatorIriyama, Satoshi
dc.creatorOhya, Masanori
dc.creatorVolovich, Igor
dc.date2004-05-31
dc.date.accessioned2026-07-07T06:09:50Z
dc.date.available2026-07-07T06:09:50Z
dc.descriptionOhya and Volovich have proposed a new quantum computation model with chaotic amplification to solve the SAT problem, which went beyond usual quantum algorithm. In this paper, we generalize quantum Turing machine, and we show in this general quantum Turing machine (GQTM) that we can treat the Ohya-Volovich (OV) SAT algorithm.
dc.description19 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0405191
dc.identifierhttp://arxiv.org/abs/quant-ph/0405191
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/92093
dc.subjectQuantum Physics
dc.titleGeneralized Quantum Turing Machine and its Application to the SAT Chaos Algorithm
dc.typetext

Files

Collections

arXiv