A Survey of Universal Quantum von Neumann Architecture

被引:3
作者
Liu, Yuan-Ting [1 ,2 ]
Wang, Kai [1 ,2 ]
Liu, Yuan-Dong [1 ,2 ]
Wang, Dong-Sheng [1 ]
机构
[1] Chinese Acad Sci, Inst Theoret Phys, CAS Key Lab Theoret Phys, Beijing 100190, Peoples R China
[2] Univ Chinese Acad Sci, Sch Phys Sci, Beijing 100049, Peoples R China
基金
中国国家自然科学基金;
关键词
quantum computing; von Neumann architecture; quantum entanglement; TELEPORTATION; SIMULATION; COMPUTER; MODEL;
D O I
10.3390/e25081187
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
The existence of universal quantum computers has been theoretically well established. However, building up a real quantum computer system not only relies on the theory of universality, but also needs methods to satisfy requirements on other features, such as programmability, modularity, scalability, etc. To this end, here we study the recently proposed model of quantum von Neumann architecture by putting it in a practical and broader setting, namely, the hierarchical design of a computer system. We analyze the structures of quantum CPU and quantum control units and draw their connections with computational advantages. We also point out that a recent demonstration of our model would require less than 20 qubits.
引用
收藏
页数:23
相关论文
共 81 条
  • [1] Quantum circuits cannot control unknown operations
    Araujo, Mateus
    Feix, Adrien
    Costa, Fabio
    Brukner, Caslav
    [J]. NEW JOURNAL OF PHYSICS, 2014, 16
  • [2] Arora S, 2009, COMPUTATIONAL COMPLEXITY: A MODERN APPROACH, P1, DOI 10.1017/CBO9780511804090
  • [3] ELEMENTARY GATES FOR QUANTUM COMPUTATION
    BARENCO, A
    BENNETT, CH
    CLEVE, R
    DIVINCENZO, DP
    MARGOLUS, N
    SHOR, P
    SLEATOR, T
    SMOLIN, JA
    WEINFURTER, H
    [J]. PHYSICAL REVIEW A, 1995, 52 (05): : 3457 - 3467
  • [4] Parameterized quantum circuits as machine learning models
    Benedetti, Marcello
    Lloyd, Erika
    Sack, Stefan
    Fiorentini, Mattia
    [J]. QUANTUM SCIENCE AND TECHNOLOGY, 2019, 4 (04)
  • [5] THE COMPUTER AS A PHYSICAL SYSTEM - A MICROSCOPIC QUANTUM-MECHANICAL HAMILTONIAN MODEL OF COMPUTERS AS REPRESENTED BY TURING-MACHINES
    BENIOFF, P
    [J]. JOURNAL OF STATISTICAL PHYSICS, 1980, 22 (05) : 563 - 591
  • [6] Bennett C.H., 1984, P IEEE INT C COM SYS, P175, DOI DOI 10.1016/J.TCS.2014.05.025
  • [7] TELEPORTING AN UNKNOWN QUANTUM STATE VIA DUAL CLASSICAL AND EINSTEIN-PODOLSKY-ROSEN CHANNELS
    BENNETT, CH
    BRASSARD, G
    CREPEAU, C
    JOZSA, R
    PERES, A
    WOOTTERS, WK
    [J]. PHYSICAL REVIEW LETTERS, 1993, 70 (13) : 1895 - 1899
  • [8] Quantum complexity theory
    Bernstein, E
    Vazirani, U
    [J]. SIAM JOURNAL ON COMPUTING, 1997, 26 (05) : 1411 - 1473
  • [9] Bertalanffy L.v., 1972, TRENDS GEN SYSTEMS T
  • [10] Brassard G., 2002, CONTEMP MATH, V305, P53, DOI [DOI 10.1090/CONM/305/05215, 10.1090/conm/305/05215]