Universality of quantum Turing machines with deterministic control

被引：5
|
作者：
Mateus, P. [1 ]
Sernadas, A.
Souto, A.
机构：
[1] Univ Lisbon, Inst Super Tecn, Dept Matemat, P-1699 Lisbon, Portugal
来源：
JOURNAL OF LOGIC AND COMPUTATION | 2017年 / 27卷 / 01期
关键词：
Quantum computation; computational complexity; quantum Kolmogorov complexity; COMPLEXITY;
D O I：
10.1093/logcom/exv008
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Asimple notion of quantum Turing machine with deterministic, classical control is proposed and shown to be powerful enough to compute any unitary transformation that is computable by a finitely generated quantum circuit. Anefficient universal machine with the s-m-n property is presented. The BQPclass is recovered. Arobust notion of plain Kolmogorov complexity of quantum states is proposed and compared with those previously reported in the literature.
引用
收藏
页码：1 / 19
页数：19
相关论文
共 50 条
12345