TY - JOUR
T1 - Hierarchical Quantum Architecture Search for Variational Quantum Algorithms
AU - Zhao, Tong
AU - Chen, Bo
AU - Wu, Guanting
AU - Zeng, Liang
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2024
Y1 - 2024
N2 - Designing efficient variational quantum algorithms (VQAs) is crucial for transforming the theoretical advantages of quantum algorithms into practical applications. In this context, quantum architecture search (QAS) has been introduced to automate the search and design of VQAs. However, current mainstream QAS algorithms typically perform both global and local searches simultaneously, which can result in high search space complexity and optimization challenges. In this paper, we propose a hierarchical quantum architecture search framework based on a two-stage search structure. In the first stage, global exploration of the overall quantum circuit structure is performed, while in the second stage, local optimization of quantum gate selection is carried out. We provide a numerical analysis of the theoretical advantages of the proposed framework in reducing the search space. To evaluate practical performance, we conduct experiments on quantum chemistry tasks with different algorithm combinations integrated into the framework. The results demonstrate the effectiveness of the hierarchical search structure in automating quantum circuit design.
AB - Designing efficient variational quantum algorithms (VQAs) is crucial for transforming the theoretical advantages of quantum algorithms into practical applications. In this context, quantum architecture search (QAS) has been introduced to automate the search and design of VQAs. However, current mainstream QAS algorithms typically perform both global and local searches simultaneously, which can result in high search space complexity and optimization challenges. In this paper, we propose a hierarchical quantum architecture search framework based on a two-stage search structure. In the first stage, global exploration of the overall quantum circuit structure is performed, while in the second stage, local optimization of quantum gate selection is carried out. We provide a numerical analysis of the theoretical advantages of the proposed framework in reducing the search space. To evaluate practical performance, we conduct experiments on quantum chemistry tasks with different algorithm combinations integrated into the framework. The results demonstrate the effectiveness of the hierarchical search structure in automating quantum circuit design.
KW - Automated quantum circuit design
KW - hierarchical quantum architecture search
UR - https://www.scopus.com/pages/publications/85203533576
U2 - 10.1109/TQE.2024.3454640
DO - 10.1109/TQE.2024.3454640
M3 - Article
AN - SCOPUS:85203533576
SN - 2689-1808
VL - 5
JO - IEEE Transactions on Quantum Engineering
JF - IEEE Transactions on Quantum Engineering
M1 - 3103410
ER -