  We show that the hitting time of the discrete time quantum random walk on the
n-bit hypercube from one corner to its opposite is polynomial in n. This gives
the first exponential quantum-classical gap in the hitting time of discrete
quantum random walks. We provide the framework for quantum hitting time and
give two alternative definitions to set the ground for its study on general
graphs. We then give an application to random routing.
