Estimation of Complexity for the Ohya-Masuda-Volovich SAT Algorithm
量子物理
2007-05-23 v1
摘要
Ohya 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.
引用
@article{arxiv.quant-ph/0312074,
title = {Estimation of Complexity for the Ohya-Masuda-Volovich SAT Algorithm},
author = {Shigeo Akashi and Satoshi Iriyama},
journal= {arXiv preprint arXiv:quant-ph/0312074},
year = {2007}
}