STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Handbook of logic in computer science (vol. 4)
A Lambda Calculus for Quantum Computation
SIAM Journal on Computing
Towards a quantum programming language
Mathematical Structures in Computer Science
A lambda calculus for quantum computation with classical control
Mathematical Structures in Computer Science
An Algebra of Pure Quantum Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
The church-turing thesis over arbitrary domains
Pillars of computer science
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Information and Computation
Hi-index | 0.00 |
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.