๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Phase matching in quantum searching
โœ Gui Lu Long; Yan Song Li; Wei Lin Zhang; Li Niu ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 285 KB

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

Juggling with Pattern Matching
โœ Jean Cardinal; Steve Kremer; Stefan Langerman ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Springer ๐ŸŒ English โš– 235 KB
Pattern Matching with Swaps
โœ Amihood Amir; Yonatan Aumann; Gad M. Landau; Moshe Lewenstein; Noa Lewenstein ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 146 KB

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

Quantum search with resonances
โœ A. Romanelli; A. Auyuanet; R. Donangelo ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 331 KB

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