On the completeness of quantum computation models

Details On the completeness of quantum computation models On the completeness of quantum computation models

2010-04-07

arxiv.org/abs/1004.1027v1

6th conference on Computability in Europe, CiE 2010, Proceedings in LNCS

Computer Science

Computational Complexity

15 pages, LaTeX

Scientific paper

The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite "tensorial dimension". Such vector spaces with a finite tensorial dimension permit to define an absolute notion of completeness for quantum computation models and give a precise meaning to the Church-Turing thesis in the framework of quantum theory. (Extra keywords: quantum programming languages, denotational semantics, universality.)

Affiliated with

Also associated with

No associations

Rating

On the completeness of quantum computation models 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 On the completeness of quantum computation models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the completeness of quantum computation models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-396848