Generalized Quantum Turing Machine and its Application to the SAT Chaos Algorithm
量子物理
2007-05-23 v1
摘要
Ohya 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.
引用
@article{arxiv.quant-ph/0405191,
title = {Generalized Quantum Turing Machine and its Application to the SAT Chaos Algorithm},
author = {Satoshi Iriyama and Masanori Ohya and Igor Volovich},
journal= {arXiv preprint arXiv:quant-ph/0405191},
year = {2007}
}
备注
19 pages