The expressive power of quantum walks in terms of language acceptance

Katie Barr, Viv Kendon

Research output: Contribution to conferencePaperpeer-review

8 Downloads (Pure)

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 languageEnglish
Pages39-51
Number of pages13
DOIs
Publication statusPublished - 1 Aug 2014
Event9th Workshop on Quantum Physics and Logic, QPL 2012 - Brussels, Belgium
Duration: 10 Oct 201212 Oct 2012

Workshop

Workshop9th Workshop on Quantum Physics and Logic, QPL 2012
Abbreviated titleQPL 2012
Country/TerritoryBelgium
CityBrussels
Period10/10/1212/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

Fingerprint

Dive into the research topics of 'The expressive power of quantum walks in terms of language acceptance'. Together they form a unique fingerprint.

Cite this