Quantum Combinational Logics and their Realizations with Circuits

被引:0
|
作者
Tong, Xiaoxue [1 ]
Chen, Tian [1 ]
Pan, Naiqiao [1 ]
Zhang, Xiangdong [1 ]
机构
[1] Beijing Inst Technol, Key Lab Adv Optoelect Quantum Architecture & Measu, Minist Educ, Beijing Key Lab Nanophoton & Ultrafine Optoelect S, Beijing 100081, Peoples R China
基金
中国国家自然科学基金;
关键词
classical logic circuit; exponential speedup; quantum combinational logic circuits; quantum NAND tree; quantum walk;
D O I
10.1002/qute.202300251
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Classical combinational logic circuits (CCLCs) are widely used in various fields. Corresponding to the CCLCs, here schemes are given for some quantum combinational logic circuits (QCLCs) based on the quantum NAND tree. Three typical circuits, adder, comparator, and seven-segment display decoder, are discussed in detail as examples. All the designs of the schemes are based on the quantum random walk theory. Furthermore, these QCLCs are mapped onto the classical circuit networks and design new types of CCLCs, and take advantage of the fact that there is a good correspondence between the voltage in the circuit satisfying Kirchhoff's law and the system wave function satisfying the Schrodinger equation. These CCLCs that are designed have exponential speedup functions compared with conventional ones, which have been demonstrated experimentally. Because classical circuit networks possess good scalability and stability, the realization of QCLCs on classical circuits is expected to have potential applications for information processing in the era of big data. Schemes are given for some quantum combinational logic circuits (QCLCs) based on the quantum NAND tree. Three typical circuits, adder, comparator, and seven-segment display decoder, are discussed in detail as examples. All the designs of the schemes are based on the quantum random walk theory. The realization of QCLCs on classical circuits is expected to have potential applications for information processing.image
引用
收藏
页数:8
相关论文
共 50 条
  • [31] Analysis of combinational cycles in sequential circuits
    Shiple, TR
    Singhal, V
    Brayton, RK
    SangiovanniVincentelli, AL
    ISCAS 96: 1996 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS - CIRCUITS AND SYSTEMS CONNECTING THE WORLD, VOL 4, 1996, : 592 - 595
  • [32] Combinational Fault Simulation in Sequential Circuits
    Ubar, Raimund
    Kousaar, Jaak
    Gorev, Maksim
    Devadze, Sergei
    2015 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2015, : 2876 - 2879
  • [33] Theorems for Fault Collapsing in Combinational Circuits
    Audhild Vaaje
    Journal of Electronic Testing, 2006, 22 : 23 - 36
  • [34] Designing combinational circuits with list homomorphisms
    Dosch, Walter
    JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING, 2005, 5 (01) : S27 - S43
  • [35] Designing combinational circuits with list homomorphisms
    Dosch, W
    THIRD ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING RESEARCH, MANAGMENT AND APPLICATIONS, PROCEEDINGS, 2005, : 288 - 297
  • [36] STUDYING THE CONTROLLABILITY OF COMBINATIONAL-CIRCUITS
    SKOBELEV, VG
    AUTOMATION AND REMOTE CONTROL, 1988, 49 (01) : 109 - 113
  • [37] Synthesis and Optimization of Combinational Interface Circuits
    Ki-Seok Chung
    Rajesh K. Gupta
    Taewhan Kim
    C.L. Liu
    Journal of VLSI signal processing systems for signal, image and video technology, 2002, 31 : 243 - 261
  • [38] DETECTION OF FAILURES IN COMBINATIONAL DIGITAL CIRCUITS
    KOHAVI, Z
    SPIRES, DA
    PROCEEDINGS OF THE INSTITUTION OF ELECTRICAL ENGINEERS-LONDON, 1971, 118 (05): : 643 - +
  • [39] Theorems for fault collapsing in combinational circuits
    Vaaje, A
    JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS, 2006, 22 (01): : 23 - 36
  • [40] GRAPHICAL REPRESENTATION OF COMBINATIONAL-CIRCUITS
    ZAKREVSKIJ, AD
    AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1990, (06): : 59 - 65