On the completeness of quantum computation models
Computational Complexity
2015-05-18 v1 Logic in Computer Science
Quantum Physics
Abstract
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.)
Cite
@article{arxiv.1004.1027,
title = {On the completeness of quantum computation models},
author = {Pablo Arrighi and Gilles Dowek},
journal= {arXiv preprint arXiv:1004.1027},
year = {2015}
}
Comments
15 pages, LaTeX