On the completeness of quantum computation models

DOI10.1007/978-3-642-13962-8_3MaRDI QIDQ3576187zbMATH OpenOpenAlexFDO

Authors Pablo Arrighi, Gilles Dowek

Publication date 29 July 2010

Published in Programs, Proofs, Processes (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1004.1027

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10)

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.)

Recommendations

• The physical Church-Turing thesis and the principles of quantum theory
• scientific article; zbMATH DE number 2013192
• Introduction to Special Section on Quantum Computation
• Quantum Complexity Theory
• scientific article; zbMATH DE number 1072528

Cited in

(2)

• Models in quantum computing: a systematic review
• An overview of quantum cellular automata

This page was built for publication: On the completeness of quantum computation models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576187)