Title: Polynomial Time Quantum Algorithm for Search Problem and Its Application
Abstract: The well known quantum algorithm for search problem is Grover’s one. However, its computational complexity is not a polynomial in the input. In this study, we propose a polynomial time quantum algorithm for it based on quantum binary search and an amplification process. This process can be written as a quantum Turing machine form, a so called generalized quantum Turing machine (GQTM). We introduce the definition of GQTM and its language classes.
Publication Year: 2014
Publication Date: 2014-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot