THE NOTIONS OF SYMMETRY AND COMPUTATIONAL FEEDBACK IN THE PARADIGM OF STEADY, SIMULTANEOUS QUANTUM COMPUTATION

被引:13
作者
CASTAGNOLI, G [1 ]
RASETTI, M [1 ]
机构
[1] POLITECN TORINO, DIPARTIMENTO FIS, I-10129 TURIN, ITALY
关键词
D O I
10.1007/BF00673003
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Digital computation-i.e., the coherent concatenation of logical if/then statements-is generally mapped onto the temporal transformation of a physical state. In the alternative paradigm of steady, simultaneous quantum computation, logical concatenations are mapped onto the transformations of a quantum steady state into itself. Such transformations, separated from the time variable and thus freed from the one-way progression of time, can map circular logical concatenations. This gives rise to nondeterministic and nonrecursive computation. Toy model Hamiltonians of elementary (steady) computations are given to exemplify the applicability of the paradigm.
引用
收藏
页码:2335 / 2347
页数:13
相关论文
共 21 条
[1]   ON QUANTUM-MECHANICAL AUTOMATA [J].
ALBERT, DZ .
PHYSICS LETTERS A, 1983, 98 (5-6) :249-252
[2]  
BAEZ JC, 1983, T AM MATH SOC, V208, P339
[3]   THE THERMODYNAMICS OF COMPUTATION - A REVIEW [J].
BENNETT, CH .
INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 1982, 21 (12) :905-940
[4]  
BIRMAN J, 1982, BRAIDS LINKS MAPPING
[5]   VIRTUALLY-DETERMINISTIC QUANTUM COMPUTING OF NONDETERMINISTIC POLYNOMIAL PROBLEMS [J].
BRASHER, JD ;
HESTER, CF ;
CAULFIELD, HJ .
INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 1991, 30 (07) :973-977
[6]   QUANTUM STEADY COMPUTATION [J].
CASTAGNOLI, G .
INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 1991, 5 (13) :2253-2269
[7]  
CASTAGNOLI G, 1991, 9TH P INT C LOG METH, V3, P13
[8]  
CASTAGONI C, 1992, INT J MOD PHYS C, V3, P661
[9]   QUANTUM-THEORY, THE CHURCH-TURING PRINCIPLE AND THE UNIVERSAL QUANTUM COMPUTER [J].
DEUTSCH, D .
PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 1985, 400 (1818) :97-117
[10]  
DRINFELD VG, 1985, DOKL AKAD NAUK SSSR, V32, P254