Access the full text.
Sign up today, get DeepDyve free for 14 days.
D. D’Alessandro (2009)
Connection between continuous and discrete time quantum walks. From D-dimensional lattices to general graphsReports on Mathematical Physics, 66
G. Molfetta, F. Debbasch (2011)
Discrete-time quantum walks: Continuous limit and symmetriesJournal of Mathematical Physics, 53
(1995)
Random Walks and Random Environments: Random walks, vol
Andrew Childs, J. Goldstone (2003)
Spatial search by quantum walkPhysical Review A, 70
A. Mallick, S. Mandal, C. Chandrashekar (2016)
Simulation of neutrino oscillations using discrete-time quantum walk
A. Anishchenko, A. Blumen, O. Mülken (2011)
Enhancing the spreading of quantum walks on star graphs by additional bondsQuantum Information Processing, 11
Y. Aharonov, L. Davidovich, N. Zagury (1993)
Quantum random walks.Physical review. A, Atomic, molecular, and optical physics, 48 2
B'alint Koll'ar, T. Kiss, Jaroslav Novotn'y, I. Jex (2012)
Asymptotic dynamics of coined quantum walks on percolation graphs.Physical review letters, 108 23
A. Ambainis (2003)
QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONSInternational Journal of Quantum Information, 01
E. Farhi, S. Gutmann (1997)
Quantum computation and decision treesPhysical Review A, 58
R. Portugal, R. Santos, T. Fernandes, D. Gonçalves (2015)
The staggered quantum walk modelQuantum Information Processing, 15
Y. Shapir, A. Aharony, A. Harris (1982)
Localization and Quantum PercolationPhysical Review Letters, 49
A. Oliveira, R. Portugal, R. Donangelo (2006)
Decoherence in two-dimensional quantum walksPhysical Review A, 74
D. Meyer (1996)
On the absence of homogeneous scalar unitary cellular automataPhysics Letters A, 223
G. Paparo, Markus Müller, F. Comellas, M. Martin-Delgado (2013)
Quantum Google in a Complex NetworkScientific Reports, 3
Lov Grover (1996)
A fast quantum mechanical algorithm for database search
M. Hillery, J. Bergou, E. Feldman (2003)
Quantum walks based on an interferometric analogyPhysical Review A, 68
G. Lawler, V. Limic (2010)
Random Walk: A Modern Introduction
R. Portugal (2015)
Establishing the equivalence between Szegedy’s and coined quantum walks using the staggered modelQuantum Information Processing, 15
D. Aharonov, A. Ambainis, J. Kempe, U. Vazirani (2000)
Quantum walks on graphs
O. Mülken, V. Pernice, A. Blumen (2007)
Quantum transport on small-world networks: a continuous-time quantum walk approach.Physical review. E, Statistical, nonlinear, and soft matter physics, 76 5 Pt 1
Shantanav Chakraborty, Leonardo Novo, A. Ambainis, Y. Omar (2015)
Spatial Search by Quantum Walk is Optimal for Almost all Graphs.Physical review letters, 116 10
T. Wong (2015)
Faster quantum walk search on a weighted graphPhysical Review A, 92
A. Romanelli, R. Siri, G. Abal, A. Auyuanet, R. Donangelo (2004)
Decoherence in the quantum walk on the linePhysica A-statistical Mechanics and Its Applications, 347
A. Ambainis, J. Kempe, Alexander Rivosh (2004)
Coins make quantum walks faster
M. Santha (2008)
Quantum Walk Based Search Algorithms
R. Santos, R. Portugal, M. Fragoso (2012)
Decoherence in quantum Markov chainsQuantum Information Processing, 13
R. Portugal (2016)
Staggered Quantum Walks on GraphsPhysical Review A, 93
Andrew Childs (2008)
On the Relationship Between Continuous- and Discrete-Time Quantum WalkCommunications in Mathematical Physics, 294
GF Lawler, V Limic (2010)
Random Walk: A Modern Introduction. Cambridge Studies in Advanced Mathematics
F. Strauch (2006)
Connecting the discrete- and continuous-time quantum walksPhysical Review A, 74
Z. Darázs, T. Kiss (2012)
Time evolution of continuous-time quantum walks on dynamical percolation graphsJournal of Physics A: Mathematical and Theoretical, 46
J. Kempe (2003)
Quantum random walks: An introductory overviewContemporary Physics, 44
N. DheerajM, T. Brun (2015)
Continuous Limit of Discrete Quantum WalksPhysical Review A, 91
The connection between coined and continuous-time quantum walk models has been addressed in a number of papers. In most of those studies, the continuous-time model is derived from coined quantum walks by employing dimensional reduction and taking appropriate limits. In this work, we produce the evolution of a coined quantum walk on a generic graph using a continuous-time quantum walk on a larger graph. In addition to expanding the underlying structure, we also have to switch on and off edges during the continuous-time evolution to accommodate the alternation between the shift and coin operators from the coined model. In one particular case, the connection is very natural, and the continuous-time quantum walk that simulates the coined quantum walk is driven by the graph Laplacian on the dynamically changing expanded graph.
Quantum Information Processing – Springer Journals
Published: Dec 16, 2016
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.