Formal languages analysed by quantum walks
arXiv:1209.5238
Abstract
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.
9 Pages, 5 figures. Accepted to QPL 2012
References in corpus (7)
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
- Quantum Communication Through an Unmodulated Spin Chain
- Universal computation by quantum walk
- Universal quantum computation using the discrete time quantum walk
- Universal computation by multi-particle quantum walk
- Quantum walks on general graphs
- Quantum walk as a generalized measuring device