Sciweavers

Share
CIE
2010
Springer

On the Completeness of Quantum Computation Models

10 years 3 months ago
On the Completeness of Quantum Computation Models
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.
Pablo Arrighi, Gilles Dowek
Added 19 Jul 2010
Updated 19 Jul 2010
Type Conference
Year 2010
Where CIE
Authors Pablo Arrighi, Gilles Dowek
Comments (0)
books