2010
DOI: 10.1103/physreva.82.012305
|View full text |Cite
|
Sign up to set email alerts
|

Quantum-walk approach to searching on fractal structures

Abstract: We study continuous-time quantum walks mimicking the quantum search based on Grover's procedure. This allows us to consider structures, that is, databases, with arbitrary topological arrangements of their entries. We show that the topological structure of the database plays a crucial role by analyzing, both analytically and numerically, the transition from the ground to the first excited state of the Hamiltonian associated with different (fractal) structures. Additionally, we use the probability of successfull… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

4
90
0
1

Year Published

2012
2012
2020
2020

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 91 publications
(95 citation statements)
references
References 34 publications
4
90
0
1
Order By: Relevance
“…Finally, in addition to the aforementioned dynamics, we expect that the obtained eigenvalues and eigenvectors can be adaptable to other dynamics in the smallworld networks, e.g., quantum walks. [57][58][59][60][61] …”
Section: Discussionmentioning
confidence: 99%
“…Finally, in addition to the aforementioned dynamics, we expect that the obtained eigenvalues and eigenvectors can be adaptable to other dynamics in the smallworld networks, e.g., quantum walks. [57][58][59][60][61] …”
Section: Discussionmentioning
confidence: 99%
“…Within this approach, the so-called √ N 0 speedup occurs on a complete graph and on cubic graphs whose dimension d is larger than 4 [11]. Unfortunately, in low-dimensional cubic graphs (d ≤ 3), the search algorithm does not provide substantial speedup, a negative feature that has been observed also on fractal networks by Mulken et al [20].…”
Section: Introductionmentioning
confidence: 95%
“…Examples include the element distinctness problem [13], the spatial search problem [14], and the hitting problem [15,16]. Consequently, CTQW and excitonmediated quantum walk have been studied in a large variety of networks such as binary and glued trees [16,17], Apollonian networks [18,19], fractal networks [20,21], sequentially growing networks [22] and star graphs [23][24][25][26][27][28].…”
Section: Introductionmentioning
confidence: 99%