Discrete-Time Quantum Walks on Oriented Graphs

@inproceedings{Chagas2020DiscreteTimeQW,
  title={Discrete-Time Quantum Walks on Oriented Graphs},
  author={Bruno Chagas and Renato Portugal},
  booktitle={QSQW},
  year={2020}
}
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… 
2 Citations

Figures from this paper

Second-order topological insulator in a coinless discrete-time quantum walk

Higher-order topological insulators not only exhibit the exotic bulk-boundary correspondence principle but also have an important application in quantum computing. However, it seems they have not

Brownian-Huygens Propagation: Modeling Wave Functions with Discrete Particle-Antiparticle Random Walks

  • H. Hrgovčić
  • Mathematics
    International Journal of Theoretical Physics
  • 2022
We present a simple method of discretely modeling solutions of the classical wave and Klein-Gordon equations using variations of random walks on a graph. Consider a collection of particles executing

References

SHOWING 1-10 OF 28 REFERENCES

Quantum walks on graphs

A lower bound on the possible speed up by quantum walks for general graphs is given, showing that quantum walks can be at most polynomially faster than their classical counterparts.

Quantum Random Walks in One Dimension

  • N. Konno
  • Mathematics, Physics
    Quantum Inf. Process.
  • 2002
The results show that the behavior of quantum random walk is striking different from that of the classical ramdom walk.

Quantum Walks and Search Algorithms

This book addresses an interesting area of quantum computation called quantum walks, which play an important role in building quantum algorithms, in particular search algorithms. Quantum walks are

Simulation of quantum walks and fast mixing with classical processes

We compare discrete-time quantum walks on graphs to their natural classical equivalents, which we argue are lifted Markov chains (LMCs), that is, classical Markov chains with added memory. We show

Quantum walks on directed graphs

It is shown that reversibility is a necessary and sufficient condition for a directed graph to allow the notion of a discrete-time quantum walk, and some implications of this condition are discussed.

Faster transport with a directed quantum walk

We give an example of faster transport with a quantum walk on an inherently directed graph, on the directed line with a variable number of self-loops at each vertex. These self-loops can be thought

One-dimensional coinless quantum walks

A coinless, discrete-time quantum walk possesses a Hilbert space whose dimension is smaller compared to the widely-studied coined walk. Coined walks require the direct product of the site basis with

Staggered quantum walks with Hamiltonians

Quantum walks are recognizably useful for the development of new quantum algorithms, as well as for the investigation of several physical phenomena in quantum systems. Actual implementations of

Quantum search on the two-dimensional lattice using the staggered model with Hamiltonians

Quantum search on the two-dimensional lattice with one marked vertex and cyclic boundary conditions is an important problem in the context of quantum algorithms with an interesting unfolding. It