.png){kind=icon}
.png){kind=icon}
Return
Continuous evolution for efficient quantum architecture search
.png){kind=icon}
OA
AI
DOI：10.1140/epjqt/s40507-024-00265-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Variational quantum algorithms (VQAs) have been successfully applied to quantum approximate optimization algorithms, variational quantum compiling, and quantum machine learning models. The performance of VQAs is significantly influenced by the architecture of parameterized quantum circuits (PQCs). Quantum architecture search aims to automatically discover high-performance quantum circuits for specific VQA tasks. Quantum architecture search algorithms that utilize both SuperCircuit training and a parameter-sharing approach can save computational resources. If we directly follow the parameter-sharing approach, the SuperCircuit has to be trained to compensate for the worse search space. To address the challenges posed by the worse search space, we introduce an optimization strategy known as the efficient continuous evolutionary approach using Non-dominated Sorting Genetic Algorithm-II (NSGA-II). Then, we leverage prior information (symmetric property) designing Structure Symmetric Pruning for removing redundant gates of the searched ansatz. Experiments show that the efficient continuous evolutionary approach can search for more quantum architectures with better performance; the number of high-performance ansatzes obtained by our method is 10% higher than that in the literature (Du et al. in npj Quantum Inf. 8:62, 2022). The application of Structure Symmetric Pruning effectively reduces the number of parameters in quantum circuits without compromising their performance significantly. In binary classification tasks, the pruned quantum circuits exhibit an average accuracy reduction of 0.044 compared to their unpruned counterparts.
Keywords:
Quantum architecture search
NSGA-II
Symmetric pruning
Journal
IF:
5.6
Papers:
529
Citations:
1.1K