| Journal of Global Research in Computer Sciences | |
| A SIMPLE EXPLANATION OF SEARCH TECHNIQUE IN QUANTUM FRAMEWORK | |
| article | |
| Shaktikanta Nayak1  Sitakanta Nayak1  J.P.Singh1  | |
| [1] Department of Management Studies, Indian Institute of Technology | |
| 关键词: Database search; Quantum computing; Quantum algorithm; Grover’s search algorithm; | |
| 来源: Research & Reviews | |
PDF
|
|
【 摘 要 】
The quantum search takes advantage of quantum parallelism to construct superposition of all possible states and then increase the probability amplitude of the solution state. This is the distinguishing characteristics of quantum search strategy. The objective of a classical search algorithm is to diminish the amplitude of target state where as a quantum search algorithm tries to amplify the amplitude of the target state. The term amplification indicates to increase the probability of the target state. This paper attempts to explain two central ideas of Grover’s quantum search algorithm that amplify the probability of the target state, the inversion about the mean and phase inversion, in a simplified way with a concrete example.
【 授权许可】
Unknown
【 预 览 】
| Files | Size | Format | View |
|---|---|---|---|
| RO202307140002555ZK.pdf | 209KB |
PDF