When arbitrary phase rotations are used instead of inversions in Grover's quantum algorithm, they must satisfy a matching condition. When phase matching is satisfied, the quantum search is an approximate rotation in 2-dimensional space. An approximate formula for the amplitude is derived. A simple e
Quantum Pattern Search with Closed Match
โ Scribed by Ri-Gui Zhou, Chen-Yi Shen, Tian-ru Xiao, Yan-cheng Li
- Book ID
- 120964302
- Publisher
- Springer
- Year
- 2013
- Tongue
- English
- Weight
- 444 KB
- Volume
- 52
- Category
- Article
- ISSN
- 0020-7748
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let a text string T of n symbols and a pattern string P of m symbols from alphabet be given. A swapped version T of T is a length n string derived from T by a series of local swaps (i.e., t โ t +1 and t +1 โ t ), where each element can participate in no more than one swap. The pattern matching with
We present a continuous time quantum search algorithm analogous to Grover's. In particular, the optimal search time for this algorithm is proportional to ffiffiffiffi ffi N p , where N is the database size. This search algorithm can be implemented using any Hamiltonian with a discrete energy spectru