Published March 5, 2021
| Version v1
Journal article
Finding more than one path through a simple maze with a quantum walk
Creators
- 1. Physics Program, Graduate Center of the City University of New York, 365 Fifth Avenue, New York, NY 10016 (United States)
- 2. Department of Physics, Hunter College of the City University of New York, 695 Park Avenue, New York, NY 10065 (United States)
Description
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. (paper)
Availability note (English)
Available from http://dx.doi.org/10.1088/1751-8121/abde79Additional details
Identifiers
Publishing Information
- Journal Title
- Journal of Physics. A, Mathematical and Theoretical (Online)
- Journal Volume
- 54
- Journal Issue
- 9
- Journal Page Range
- [11 p.]
- ISSN
- 1751-8121
INIS
- Country of Publication
- United Kingdom
- Country of Input or Organization
- International Atomic Energy Agency (IAEA)
- INIS RN
- 53048272
- Subject category
- S71: CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS;
- Descriptors DEI
- DIAGRAMS; GRAPH THEORY; QUANTUM MECHANICS
- Descriptors DEC
- INFORMATION; MATHEMATICS; MECHANICS