Quantum Algorithm Optimization using quantum Karnaugh Map
Abstract
Every quantum algorithm is represented by set of quantum circuits. Any optimization scheme for a quantum algorithm and quantum computation is very important especially in the arena of quantum computation with limited number of qubit resources in NISQ-based machines. Major obstacle to this goal is the large number of elemental quantum gates to build even small quantum circuits. Recently, we proposed and demonstrated a general technique called quantum Karnaugh map (QKM) that significantly reduces the number of elemental gates to build quantum circuits. This is impactful for the design of quantum circuits, and we showed this could reduce the number of gates by 60% and 46% for the four- and five-qubit Toffoli gates, two key quantum circuits, respectively, as compared with simplest known decomposition. Reduced circuit complexity often goes hand-in-hand with higher efficiency and bandwidth. By performing quantum circuits studies on IBM-Q machine, AFRL group in Rome showed that a single CNOT operation can be reliably performed in NISQ environment. Here, we propose to realize QKM in a NISQ-based machine accessible to AFRL. The quantum circuit optimization protocol realized in NISQ machines in this white paper would provide leapfrogging ground for the optimization of quantum circuits and algorithms.
Document Details
- Document Type
- DoD Grant Award
- Publication Date
- Nov 16, 2022
- Source ID
- FA23862110089
Entities
People
- David B Ahn
Organizations
- Air Force Office of Scientific Research
- United States Air Force
- University of Seoul