4 citations · 6 across the 3 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2013★ 1 cited
On Quantum Algorithm for Binary Search and Its Computational Complexity
S. Iriyama, M. Ohya, I. V. Volovich
A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2^n objects that our algorithm runs in pol…
quant-ph2004★ 4 cited
Generalized Quantum Turing Machine and its Application to the SAT Chaos Algorithm
Satoshi Iriyama, Masanori Ohya, Igor Volovich
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 ge…
quant-ph2003★ 1 cited
Estimation of Complexity for the Ohya-Masuda-Volovich SAT Algorithm
Shigeo Akashi, Satoshi Iriyama
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…