A PromiseBQP-complete String Rewriting Problem

Details A PromiseBQP-complete String Rewriting Problem A PromiseBQP-complete String Rewriting Problem

2007-05-08

arxiv.org/abs/0705.1180v2

Physics

Quantum Physics

transition rules corrected, added more detailed explanations

Scientific paper

We are given three strings s, t, and t' of length L over some fixed finite alphabet and an integer m that is polylogarithmic in L. We have a symmetric relation on substrings of constant length that specifies which substrings are allowed to be replaced with each other. Let Delta(n) denote the difference between the numbers of possibilities to obtain t from s and t' from s after n replacements. The problem is to determine the sign of Delta(m). As promises we have a gap condition and a growth condition. The former states that |Delta(m)| >= epsilon c^m where epsilon is inverse polylogarithmic in L and c>0 is a constant. The latter is given by Delta(n) <= c^n for all n. We show that this problem is PromiseBQP-complete, i.e., it represents the class of problems which can be solved efficiently on a quantum computer.

Affiliated with

Also associated with

No associations

Rating

A PromiseBQP-complete String Rewriting Problem 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 A PromiseBQP-complete String Rewriting Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A PromiseBQP-complete String Rewriting Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-645215