Infinite Dimensional Analysis Quantum Probability and Related Topics
A COMBINED QUANTUM ALGORITHM AND ITS COMPUTATIONAL COMPLEXITY
Satoshi Iriyama
Abstract
A quantum algorithm for the general search problem is proposed by Ohya et al . in 2015. An NP-hard problem can be solved in polynomial steps with high probability by the quantum algorithm which implicates multiple quantum computation. Each quantum algorithm amplifies the success probability using the special dynamics, so called the Chaos amplifier, which is defined by the logistic map. In 2017, we showed that the Chaos amplifier and more general amplification process can be represented by the GKSL master equation in a two-qubit system. In this study, we explain our notion of combined quantum algorithm, and discuss on its computational complexity for the difficult problem.