A decision procedure for well-formed linear quantum cellular automata

Details A decision procedure for well-formed linear quantum cellular automata A decision procedure for well-formed linear quantum cellular automata

1999-06-23

arxiv.org/abs/cs/9906024v2

Random Structures and Algorithms 11, 381-394, 1997

Computer Science

Data Structures and Algorithms

Scientific paper

In this paper we introduce a new quantum computation model, the linear quantum cellular automaton. Well-formedness is an essential property for any quantum computing device since it enables us to define the probability of a configuration in an observation as the squared magnitude of its amplitude. We give an efficient algorithm which decides if a linear quantum cellular automaton is well-formed. The complexity of the algorithm is $O(n^2)$ in the algebraic model of computation if the input automaton has continuous neighborhood.

Affiliated with

Also associated with

No associations

Rating

A decision procedure for well-formed linear quantum 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 A decision procedure for well-formed linear quantum cellular automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A decision procedure for well-formed linear quantum cellular automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-28840