Consistent Rotation Maps Induce a Unitary Shift Operator in Discrete Time Quantum Walks

TL;DR

This paper explains how consistent rotation maps are essential for efficiently implementing coined discrete time quantum walks on regular graphs, highlighting their role in the computational process.

Contribution

It introduces the concept of consistent rotation maps and demonstrates their importance in the efficient computation of quantum walks.

Findings

Consistent rotation maps are necessary for efficient quantum walk computation.

The paper clarifies the role of rotation maps in quantum walk algorithms.

Provides a theoretical foundation for implementing quantum walks on regular graphs.

Abstract

In this work we explain the necessity for consistently labeled rotation maps for efficiently computing coined discrete time quantum walks on regular graphs.