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. © 2010 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Arrighi, P., & Dowek, G. (2010). On the completeness of quantum computation models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6158 LNCS, pp. 21–30). Springer Verlag. https://doi.org/10.1007/978-3-642-13962-8_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
