Quantum search in a possible three-dimensional complex subspace |
| |
Authors: | Wenliang Jin |
| |
Affiliation: | 1. School of Information Science and Technology, Southwest Jiaotong University, Chengdu, Sichuan, 610031, People??s Republic of China
|
| |
Abstract: | Suppose we are given an unsorted database with N items and N is sufficiently large. By using a simpler approximate method, we re-derive the approximate formula cos2
Φ, which represents the maximum success probability of Grover’s algorithm corresponding to the case of identical rotation angles
f = q{\phi=\theta} for any fixed deflection angle F ? 0,p/2){\Phi \in\left0,\pi/2\right)}. We further show that for any fixed F ? 0,p/2){\Phi \in\left0,\pi/2\right)}, the case of identical rotation angles f = q{\phi=\theta} is energetically favorable compared to the case |q- f| >> 0{\left|{\theta - \phi}\right|\gg 0} for enhancing the probability of measuring a unique desired state. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|