Generalized Quantum Turing Machine and its Application to the SAT Chaos Algorithm
classification
🪐 quant-ph
keywords
quantumalgorithmmachineturingamplificationapplicationbeyondchaos
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.