  Quantum walks are expected to serve important modelling and algorithmic
applications in many areas of science and mathematics. Although quantum walks
have been successfully implemented physically in recent times, no major efforts
have been made to combat the error associated with these physical
implementations in a fault-tolerant manner. In this paper, we propose a
systematic method to implement fault-tolerant quantum walks in discrete time on
arbitrarily complex graphs, using quantum states encoded with the Steane code
and a set of universal fault tolerant matrix operations.
