Journal
ACM JOURNAL ON EMERGING TECHNOLOGIES IN COMPUTING SYSTEMS
Volume 11, Issue 1, Pages -Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/2629430
Keywords
Quantum benchmark; quantum circuit; quantum library
Categories
Funding
- Intelligence Advanced Research Projects Agency (IARPA) via Department of Interior National Business Center [D11PC20165]
Ask authors/readers for more resources
Quantum algorithms are known for their ability to solve some problems much faster than classical algorithms. They are executed on quantum circuits, which consist of a cascade of quantum gates. However, synthesis of quantum circuits is not straightforward because of the complexity of quantum algorithms. Generally, quantum algorithms contain two parts: classical and quantum. Thus, synthesizing circuits for the two parts separately reduces overall synthesis complexity. In addition, many quantum algorithms use similar subroutines that can be implemented with similar circuit modules. Because of their frequent use, it is important to use automated scripts to generate such modules efficiently. These modules can then be subjected to further synthesis optimizations. This article proposes QLib, a quantum module library, which contains scripts to generate quantum modules of different sizes and specifications for well-known quantum algorithms. Thus, QLib can also serve as a suite of benchmarks for quantum logic and physical synthesis.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available