Universality of quantum Turing machines with deterministic control

DOI10.1093/logcom/exv008zbMath1362.68077OpenAlexW2035893303WikidataQ59196613 ScholiaQ59196613MaRDI QIDQ2987040

André Souto, Paulo Mateus, Amílcar Sernadas

Publication date: 17 May 2017

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exv008

zbMATH Keywords

computational complexityquantum computationquantum Kolmogorov complexity

Mathematics Subject Classification ID

Quantum computation (81P68) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Size-based termination of higher-order rewriting

This page was built for publication: Universality of quantum Turing machines with deterministic control