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 quantum gate set. In this paper, we examine computation by quantum walks 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 also be interpreted as performing the task of quantum state discrimination.
Original language | English |
---|---|
Pages | 39-51 |
Number of pages | 13 |
DOIs | |
Publication status | Published - 1 Aug 2014 |
Event | 9th Workshop on Quantum Physics and Logic, QPL 2012 - Brussels, Belgium Duration: 10 Oct 2012 → 12 Oct 2012 |
Workshop
Workshop | 9th Workshop on Quantum Physics and Logic, QPL 2012 |
---|---|
Abbreviated title | QPL 2012 |
Country/Territory | Belgium |
City | Brussels |
Period | 10/10/12 → 12/10/12 |
Keywords
- computation theory
- computer circuits
- quantum computers
- discrete time
- expressive power
- quantum state discrimination
- quantum walk
- two ways
- universal quantum gates
- quantum theory