Formal languages analysed by quantum walks
  Discrete time quantum walks are known to be universal for quantum computation. This has been proven by showing that they can simulate a universal gate set. In this paper we examine computation in terms of language acceptance and present two ways in which discrete time quantum walks can accept some languages with certainty. These walks can take quantum as well as classical inputs, and we show that when the input is quantum, the walks can be interpreted as performing state discrimination. 
Katie Barr, Viv Kendon
quant-ph cs.FL