Quick Navigation
Topics
Open Quantum Systems Decoherence
Quantum Foundations
Finding more than one path through a simple maze with a quantum walk
arXiv
Authors: Mark Hillery
Year
2020
Paper ID
22227
Status
Preprint
Abstract Read
~2 min
Abstract Words
58
Citations
N/A
Abstract
We study quantum walks through chains consisting of two and three star graphs. The first star has a distinguished vertex labelled START and the last has one labelled END. There are multiple paths between these two vertices, and the object is to find these paths. We show that a quantum walk can do this with a quantum speedup.
Why This Paper Matters
- This paper contributes to the Quantum Foundations research area in the Quantum Articles archive.
- It adds a 2020 reference point for readers tracking recent quantum research.
- We study quantum walks through chains consisting of two and three star graphs.
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.