Quick Navigation
Topics
Open Quantum Systems Decoherence
Quantum walk-based search and centrality
arXiv
Authors: Scott D. Berry, Jingbo B. Wang
Year
2010
Paper ID
11001
Status
Preprint
Abstract Read
~2 min
Abstract Words
87
Citations
N/A
Abstract
We study the discrete-time quantum walk-based search for a marked vertex on a graph. By considering various structures in which not all vertices are equivalent, we investigate the relationship between the successful search probability and the position of the marked vertex, in particular its centrality. We find that the maximum value of the search probability does not necessarily increase as the marked vertex becomes more central and we investigate an interesting relationship between the frequency of the successful search probability and the centrality of the marked vertex.
Why This Paper Matters
- This paper contributes to the Open Quantum Systems & Decoherence research area in the Quantum Articles archive.
- It adds a 2010 reference point for readers tracking recent quantum research.
- We study the discrete-time quantum walk-based search for a marked vertex on a graph.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.