An application of the Deutsch-Josza algorithm to formal languages and the word problem in groups

Details An application of the Deutsch-Josza algorithm to formal languages and the word problem in groups An application of the Deutsch-Josza algorithm to formal languages and the word problem in groups

2008-01-18

arxiv.org/abs/0801.2801v2

Physics

Quantum Physics

14 pages, 2 EPS figure

Scientific paper

We adapt the Deutsch-Josza algorithm to the context of formal language theory. Specifically, we use the algorithm to distinguish between trivial and nontrivial words in groups given by finite presentations, under the promise that a word is of a certain type. This is done by extending the original algorithm to functions of arbitrary length binary output, with the introduction of a more general concept of parity. We provide examples in which properties of the algorithm allow to reduce the number of oracle queries with respect to the deterministic classical case. This has some consequences for the word problem in groups with a particular kind of presentation.

Affiliated with

Also associated with

No associations

Rating

An application of the Deutsch-Josza algorithm to formal languages and the word problem in groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An application of the Deutsch-Josza algorithm to formal languages and the word problem in groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An application of the Deutsch-Josza algorithm to formal languages and the word problem in groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-690371