Discrete-Time Quantum Walks on Oriented Graphs
arXiv:2001.04814 · doi:10.4204/EPTCS.315.3
Abstract
The interest in quantum walks has been steadily increasing during the last two decades. It is still worth to present new forms of quantum walks that might find practical applications and new physical behaviors. In this work, we define discrete-time quantum walks on arbitrary oriented graphs by partitioning a graph into tessellations, which is a collection of disjoint cliques that cover the vertex set. By using the adjacency matrices associated with the tessellations, we define local unitary operators, whose product is the evolution operator of our quantum walk model. We introduce a parameter, called alpha, that quantifies the amount of orientation. We show that the parameter alpha can be tuned in order to increase the amount of quantum walk-based transport on oriented graphs.
arXiv commentIn Proceedings QSQW 2020, arXiv:2004.01061
References in corpus (16)
- From quantum cellular automata to quantum lattice gases
- The Staggered Quantum Walk Model
- On the digraph of a unitary matrix
- Quantum Transport Enhancement by Time-Reversal Symmetry Breaking
- Alternate two-dimensional quantum walk with a single-qubit coin
- Chiral Quantum Walks
- Faster transport with a directed quantum walk
- Staggered Quantum Walks with Hamiltonians
- One-Dimensional Coinless Quantum Walks
- Quantum search on the two-dimensional lattice using the staggered model with Hamiltonians
- Simulation of Quantum Walks and Fast Mixing with Classical Processes
- Quantum Walk Search with Time-Reversal Symmetry Breaking
- Moments of Coinless Quantum Walks on Lattices
- Continuous-Time Quantum Walks on Directed Bipartite Graphs
- The graph tessellation cover number: extremal bounds, efficient algorithms and hardness
- The tessellation problem of quantum walks