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 条
  • [21] On timing analysis of combinational circuits
    Ben Salah, R
    Bozga, M
    Maler, O
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2003, 2791 : 204 - 218
  • [22] Formal verification of combinational circuits
    Jain, J
    Narayan, A
    Fujita, M
    SangiovanniVincentelli, A
    TENTH INTERNATIONAL CONFERENCE ON VLSI DESIGN, PROCEEDINGS, 1997, : 218 - 225
  • [23] EFFICIENCY OF PIPELINED COMBINATIONAL CIRCUITS
    DAVIO, M
    BIOUL, G
    DIGITAL PROCESSES, 1978, 4 (01): : 3 - 16
  • [24] Synthesizing testable combinational circuits
    Matrosova, AY
    Ostanin, SA
    Parshina, NA
    AUTOMATION AND REMOTE CONTROL, 1999, 60 (02) : 250 - 256
  • [25] Realization of combinational logic circuits using standard functions in quantum dot cellular automata
    Chakrabarty, Ratna
    Mandal, Niranjan Kumar
    NANOSYSTEMS-PHYSICS CHEMISTRY MATHEMATICS, 2021, 12 (05): : 583 - 597
  • [26] Combinational logic circuits with photonic devices
    Schiopu, P
    Degeratu, V
    Degeratu, S
    SIOEL '99: SIXTH SYMPOSIUM ON OPTOELECTRONICS, 2000, 4068 : 584 - 590
  • [27] ASYNCHRONOUS MULTIPLIERS AS COMBINATIONAL HANDSHAKE CIRCUITS
    HAANS, J
    VANBERKEL, K
    PEETERS, A
    SCHALIJ, F
    ASYNCHRONOUS DESIGN METHODOLOGIES, 1993, 28 : 149 - 163
  • [28] DIAGNOSIS AND FAULT EQUIVALENCE IN COMBINATIONAL CIRCUITS
    ROY, BK
    IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (09) : 955 - 963
  • [29] TEST POINT PLACEMENT FOR COMBINATIONAL CIRCUITS
    AZEMA, P
    LOZES, A
    DIAZ, M
    DIGITAL PROCESSES, 1977, 3 (03): : 227 - 235
  • [30] COMBINATIONAL PROFILES OF SEQUENTIAL BENCHMARK CIRCUITS
    BRGLEZ, F
    BRYAN, D
    KOZMINSKI, K
    1989 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-3, 1989, : 1929 - 1934