Can a universal quantum computer be fully quantum?

被引：43

作者：

Myers, JM

机构：

[1] Gordon McKay Laboratory, Harvard University, Cambridge, MA

来源：

PHYSICAL REVIEW LETTERS | 1997年 / 78卷 / 09期

关键词：

D O I：

10.1103/PhysRevLett.78.1823

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

A conflict is pointed out in the definition of a universal quantum computer between the need for a halt qubit and the need for operating on superpositions;bf states of a computational basis.

引用

页码：1823 / 1824

页数：2

共 7 条

[1]

BERNSTEIN E, 1993, 25TH P ANN ACM S THE, P11

[2]

Boolos GS., 1989, COMPUTABILITY LOGIC

[3] QUANTUM COMPUTATIONAL NETWORKS [J].

DEUTSCH, D .

PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 1989, 425 (1868) :73-90

[4] 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

[5] Quantum computation and Shor's factoring algorithm [J].

Ekert, A ;

Jozsa, R .

REVIEWS OF MODERN PHYSICS, 1996, 68 (03) :733-753

[6]

Shor P. W., 1994, Proceedings. 35th Annual Symposium on Foundations of Computer Science (Cat. No.94CH35717), P124, DOI 10.1109/SFCS.1994.365700

[7] Quantum information processing: Cryptography, computation, and teleportation [J].

Esch, J .

PROCEEDINGS OF THE IEEE, 1996, 84 (12) :1717-1718

← 1 →