T.J. Proctor
Nonreversal and nonrepeating quantum walks.
Proctor, T.J.; Barr, K.E.; Hanson, B.; Martiel, S.; Pavlovic, V.; Bullivant, A.; Kendon, V.M.
Authors
K.E. Barr
B. Hanson
S. Martiel
V. Pavlovic
A. Bullivant
Dr Vivien Kendon viv.kendon@durham.ac.uk
Academic Visitor
Abstract
We introduce a variation of the discrete-time quantum walk, the nonreversal quantum walk, which does not step back onto a position that it has just occupied. This allows us to simulate a dimer and we achieve it by introducing a different type of coin operator. The nonrepeating walk, which never moves in the same direction in consecutive time steps, arises by a permutation of this coin operator. We describe the basic properties of both walks and prove that the even-order joint moments of the nonrepeating walker are independent of the initial condition, being determined by five parameters derived from the coin instead. Numerical evidence suggests that the same is the case for the nonreversal walk. This contrasts strongly with previously studied coins, such as the Grover operator, where the initial condition can be used to control the standard deviation of the walker.
Citation
Proctor, T., Barr, K., Hanson, B., Martiel, S., Pavlovic, V., Bullivant, A., & Kendon, V. (2014). Nonreversal and nonrepeating quantum walks. Physical Review A, 89(4), Article 042332. https://doi.org/10.1103/physreva.89.042332
Journal Article Type | Article |
---|---|
Acceptance Date | Jul 5, 2013 |
Online Publication Date | Apr 30, 2014 |
Publication Date | 2014-04 |
Deposit Date | Nov 5, 2014 |
Journal | Physical Review A - Atomic, Molecular, and Optical Physics |
Print ISSN | 1050-2947 |
Electronic ISSN | 1094-1622 |
Publisher | American Physical Society |
Peer Reviewed | Peer Reviewed |
Volume | 89 |
Issue | 4 |
Article Number | 042332 |
DOI | https://doi.org/10.1103/physreva.89.042332 |
Public URL | https://durham-repository.worktribe.com/output/1442641 |
Related Public URLs | http://arxiv.org/pdf/1303.1966 |
You might also like
Quantum algorithms for scientific computing.
(2024)
Journal Article
Cycle discrete-time quantum walks on a noisy quantum computer
(2024)
Journal Article
Using copies can improve precision in continuous-time quantum computing
(2023)
Journal Article
Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
(2023)
Journal Article
Experimental test of search range in quantum annealing
(2021)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search