QUANTUM STATE TRANSITION DIAGRAMS - A BRIDGE FROM CLASSICAL COMPUTING TO QUANTUM COMPUTING

被引:1
|
作者
Hook, Loyd R. [1 ]
Lee, Samuel C. [1 ]
机构
[1] Univ Oklahoma, Sch Elect & Comp Engn, Norman, OK 73072 USA
关键词
Sequential machine; quantum state; quantum computing;
D O I
10.1117/12.847450
中图分类号
TB3 [工程材料学];
学科分类号
0805 ; 080502 ;
摘要
Very few papers have been written on the topic of a quantum version of the finite state machine, (or finite state automata). Furthermore, these papers only serve to define what a quantum finite state machine might be in the mathematical sense using the early languages of Turing machines. This paper seeks to further develop the notion of a quantum finite state machine (FSM) using constructs developed for the classical FSM and utilized for classical FSM design. In particular the quantum state transition diagram (QSTD) is constructed to further the understanding and realization of quantum finite state machines and quantum computers.
引用
收藏
页数:5
相关论文
共 50 条
  • [21] Classical computing, quantum computing, and Shor's factoring algorithm
    Manin, YI
    [J]. ASTERISQUE, 2000, (266) : 375 - +
  • [22] Tools for Quantum Computing Based on Decision Diagrams
    Wille, Robert
    Hillmich, Stefan
    Burgholzer, Lukas
    [J]. ACM TRANSACTIONS ON QUANTUM COMPUTING, 2022, 3 (03):
  • [23] CUDA Quantum: The Platform for Integrated Quantum-Classical Computing
    Kim, Jin-Sung
    McCaskey, Alex
    Heim, Bettina
    Modani, Manish
    Stanwyck, Sam
    Costa, Timothy
    [J]. 2023 60TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, DAC, 2023,
  • [24] Forrelation: A Problem that Optimally Separates Quantum from Classical Computing
    Aaronson, Scott
    Ambainis, Andris
    [J]. STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2015, : 307 - 316
  • [25] FORRELATION: A PROBLEM THAT OPTIMALLY SEPARATES QUANTUM FROM CLASSICAL COMPUTING
    Aaronson, Scott
    Ambainis, Andris
    [J]. SIAM JOURNAL ON COMPUTING, 2018, 47 (03) : 982 - 1038
  • [26] On computing spectral densities from classical, semiclassical, and quantum simulations
    Gottwald, Fabian
    Ivanov, Sergei D.
    Kuehn, Oliver
    [J]. JOURNAL OF CHEMICAL PHYSICS, 2019, 150 (08):
  • [27] Optimised Trotter decompositions for classical and quantum computing
    Ostmeyer, Johann
    [J]. JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2023, 56 (28)
  • [28] Qunity: A Unified Language for Quantum and Classical Computing
    Voichick F.
    Li L.
    Rand R.
    Hicks M.
    [J]. Proceedings of the ACM on Programming Languages, 2023, 7 : 921 - 951
  • [29] Experimental Blind Quantum Computing for a Classical Client
    Huang, He-Liang
    Zhao, Qi
    Ma, Xiongfeng
    Liu, Chang
    Su, Zu-En
    Wang, Xi-Lin
    Li, Li
    Liu, Nai-Le
    Sanders, Barry C.
    Lu, Chao-Yang
    Pan, Jian-Wei
    [J]. PHYSICAL REVIEW LETTERS, 2017, 119 (05)
  • [30] Beating Classical Computing Without a Quantum Computer
    Franson, James D.
    [J]. SCIENCE, 2013, 339 (6121) : 767 - 768