Estimation of Complexity for the Ohya-Masuda-Volovich SAT Algorithm

Simple item page
dc.creatorAkashi, Shigeo
dc.creatorIriyama, Satoshi
dc.date2003-12-09
dc.date.accessioned2026-07-07T06:08:33Z
dc.date.available2026-07-07T06:08:33Z
dc.descriptionOhya and Volovich have been proposed a new quantum computation model with chaos amplification to solve the SAT problem, which went beyond usual quantum algorithm. In this paper we study the complexity of the SAT algorithm by counting the steps of computation algorithm rigorously, which was mentioned in the paper [1,2,3,5,7]For this purpose, we refine the quantum gates treating the SAT problem step by step.
dc.identifierhttps://arxiv.org/abs/quant-ph/0312074
dc.identifierhttp://arxiv.org/abs/quant-ph/0312074
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91670
dc.subjectQuantum Physics
dc.titleEstimation of Complexity for the Ohya-Masuda-Volovich SAT Algorithm
dc.typetext

Files

Collections

arXiv