Equivalence between discrete quantum walk models in arbitrary topologies
arXiv:0911.0042 · doi:10.1103/PhysRevA.80.052301
Abstract
Coin and scattering are the two major formulations for discrete quantum walks models, each believed to have its own advantages in different applications. Although they are related in some cases, it was an open question their equivalence in arbitrary topologies. Here we present a general construction for the two models for any graph and also for position dependent transition amplitudes. We then prove constructively their unitary equivalence. Defining appropriate projector operators, we moreover show how to obtain the probabilities for one model from the evolution of the other.
Revtex, 5 pages, 2 figures, published version
References in corpus (7)
- Universal computation by quantum walk
- Spatial search by quantum walk
- Decoherence in quantum walks - a review
- Connecting the discrete and continuous-time quantum walks
- Quantum searches on highly symmetric graphs
- Modifying quantum walks: A scattering theory approach
- Scattering quantum random-walk search with errors
Cited by in corpus (15)
- Quantum walks: a comprehensive review
- Perfect state transfer by means of discrete-time quantum walk search algorithms on highly symmetric graphs
- Quantum Walks
- Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs
- Green's function approach for quantum graphs: an overview
- Quantum walks as a probe of structural anomalies in graphs
- Spatial Search on Johnson Graphs by Continuous-Time Quantum Walk
- Percolated quantum walks with a general shift operator: From trapping to transport
- A counterintuitive role of geometry in transport by quantum walks
- Finding paths with quantum walks or quantum walking through a maze
- Unveiling and exemplifying the unitary equivalence of discrete time quantum walk models
- Quantum walk based state transfer algorithms on the complete M-partite graph
- Green function approach for scattering quantum walks
- Superdiffusivity of quantum walks: A Feynman sum-over-paths description
- Coherence as resource in scattering quantum walk search on complete graph