Optimization of Oracle circuits based on minimum weight and template matching

Optimizing quantum lines is essential to improve the computational efficiency and reduce the resource cost of quantum algorithms, especially in the case of Oracle circuit constructed from Boolean functions. This optimization process is divided into two key stages. In the first stage, the MCT gates o...

Full description

Saved in:
Bibliographic Details
Published inLiang zi dian zi xue bao Vol. 41; no. 1; p. 151
Main Authors Yang, Donghan, Li, Zhiqiang, Wu, Xi, Pan, Wenjie, Yang, Hui
Format Journal Article
LanguageChinese
English
Published Beijing Science Press 01.01.2024
Subjects
Algorithms
Boolean functions
Circuits
Gates (circuits)
Minimum weight
Optimization
Qubits (quantum computing)
Template matching
Online AccessGet full text

Cover

More Information
Summary:Optimizing quantum lines is essential to improve the computational efficiency and reduce the resource cost of quantum algorithms, especially in the case of Oracle circuit constructed from Boolean functions. This optimization process is divided into two key stages. In the first stage, the MCT gates of the same controlled points of Oracle circuits are reordered based on the minimum weight matching algorithm to minimize the number of gates for generating circuits. In the second stage, the method of template matching is utilized to further reduce the number of gates and the cost of the circuits. The experimental results show that, compared with the optimization tool of RCViewer+, for 4-10 qubits, the number of Oracle circuit gates can be reduced by about 48.3%, and the cost can be reduced by about 64.5% using Deutsch-Jozsa algorithm, while the number of Oracle circuit gates is reduced by about 25.0%, and the cost is reduced by about 18.2% using Grover algorithm.
ISSN:1007-5461