Towards A Theory Of Quantum Computability
Logic in Computer Science
2015-04-14 v1
Abstract
We propose a definition of quantum computable functions as mappings between superpositions of natural numbers to probability distributions of natural numbers. Each function is obtained as a limit of an infinite computation of a quantum Turing machine. The class of quantum computable functions is recursively enumerable, thus opening the door to a quantum computability theory which may follow some of the classical developments.
Cite
@article{arxiv.1504.02817,
title = {Towards A Theory Of Quantum Computability},
author = {Stefano Guerrini and Simone Martini and Andrea Masini},
journal= {arXiv preprint arXiv:1504.02817},
year = {2015}
}