Quantum Algorithms of Solving the Backtracking of One-dimensional Cellular Automata

Details Quantum Algorithms of Solving the Backtracking of One-dimensional Cellular Automata Quantum Algorithms of Solving the Backtracking of One-dimensional Cellular Automata

2011-09-14

arxiv.org/abs/1109.2998v1

Computer Science

Data Structures and Algorithms

14 pages, 2 figures

Scientific paper

In [Wolfram 1982; Wolfram 1983; Wolfram 2002], the backtracking of one-dimensional cellular automata is to find out which of the 2n possible initial configurations of width n evolve to a specific configuration. In this paper, in one-dimensional cellular automata for a specific configuration of width n, its unique initial configuration can be found by mean of the proposed quantum algorithm with polynomial quantum gates, polynomial quantum bits and the successful probability that is the same as that of Shor's quantum order-finding algorithm in [Shor 1994].

Affiliated with

Also associated with

No associations

Rating

Quantum Algorithms of Solving the Backtracking of One-dimensional Cellular Automata 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 Quantum Algorithms of Solving the Backtracking of One-dimensional Cellular Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Algorithms of Solving the Backtracking of One-dimensional Cellular Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-568852