Q-Map: quantum circuit implementation of boolean functions

被引：0

作者：

Hajjdiab, Hassan ^{[1
]}

Khalil, Ashraf ^{[2
]}

Eleuch, Hichem ^{[3
,4
]}

机构：

[1] Concordia Univ, Comp Sci & Software Engn Dept, Montreal, PQ, Canada

[2] Zayed Univ, Coll Technol Innovat, Abu Dhabi, U Arab Emirates

[3] Univ Sharjah, Dept Appl Phys & Astron, Sharjah, U Arab Emirates

[4] Texas A&M Univ, Inst Quantum Sci & Engn, College Stn, TX 77843 USA

来源：

PHYSICA SCRIPTA | 2024年 / 99卷 / 08期

关键词：

reveresible computing; quantum circuit; boolean function; QISKIT; REVERSIBLE LOGIC; SUPREMACY;

D O I：

10.1088/1402-4896/ad5c17

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

Quantum computing has gained attention in recent years due to the significant progress in quantum computing technology. Today many companies like IBM, Google and Microsoft have developed quantum computers and simulators for research and commercial use. The development of quantum techniques and algorithms is essential to exploit the full power of quantum computers. In this paper we propose a simple visual technique (we call Q-Map) for quantum realization of classical Boolean logic circuits. The proposed method utilizes concepts from Boolean algebra to produce a quantum circuit with minimal number of quantum gates.

引用

页数：15

共 50 条

[41] Evolvable hardware with Boolean functions network implementation
Mazare, Alin
Ionescu, Laurentiu
Serban, Gheorghe
Barbu, Vlad
2011 INTERNATIONAL CONFERENCE ON APPLIED ELECTRONICS (AE), 2011,
[42] Complexity of sequential implementation of partial Boolean functions
L. A. Sholomov
Doklady Mathematics, 2007, 75 : 449 - 452
[43] On the Implementation of Monotone Boolean Functions by Memoryless Programs
Chashkin, A., V
MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2022, 77 (03) : 136 - 143
[44] A self-timed implementation of Boolean functions
Saarepera, M
Yoneda, T
FIFTH INTERNATIONAL SYMPOSIUM ON ADVANCED RESEARCH IN ASYNCHRONOUS CIRCUITS AND SYSTEMS - PROCEEDINGS, 1999, : 243 - 250
[45] Fast Karnough Map for Simplification of Complex Boolean Functions
El-Bakry, Hazem M.
SELECTED TOPICS IN APPLIED COMPUTER SCIENCE, 2010, : 478 - +
[46] Q-MAP:: a novel multicast routing,method in wireless ad hoc networks with multiagent reinforcement learning
Sun, RY
Tatsumi, SJ
Zhao, G
2002 IEEE REGION 10 CONFERENCE ON COMPUTERS, COMMUNICATIONS, CONTROL AND POWER ENGINEERING, VOLS I-III, PROCEEDINGS, 2002, : 667 - 670
[47] Circuit complexity of symmetric Boolean functions in antichain basis
Podolskaya, Olga V.
DISCRETE MATHEMATICS AND APPLICATIONS, 2016, 26 (01): : 31 - 39
[48] Enumeration of circuit breaker mechanisms through Boolean functions
Deo, Hrishikesh V.
Amarnath, C.
PROCEEDINGS OF THE ASME INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, VOL 7, PTS A AND B, 2005, : 351 - 357
[49] Detecting Affine Equivalence Of Boolean Functions And Circuit Transformation
Zeng, Xiao
Yang, Guowu
Song, Xiaoyu
Perkowski, Marek A.
Chen, Gang
COMPUTER JOURNAL, 2023, 66 (09): : 2220 - 2229
[50] Modified Karnaugh map for quantum boolean circuits construction
Wang, SA
Lu, CY
Tsai, IM
Kuo, SY
2003 THIRD IEEE CONFERENCE ON NANOTECHNOLOGY, VOLS ONE AND TWO, PROCEEDINGS, 2003, : 651 - 654

← 1 2 3 4 5 →